Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. Algorithms and Data Structur
ALGORITHMIC RESULTS IN LIST DECODING (Foundations and Trends(R) in Theoretical Computer Science)
β Scribed by Venkatesan Guruswami
- Publisher
- Now Publishers Inc
- Year
- 2007
- Tongue
- English
- Leaves
- 91
- Series
- Foundations and Trends R in Theoretical Computer Science
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
Algorithmic Results in List Decoding introduces and motivates the problem of list decoding, and discusses the central algorithmic results of the subject, culminating with the recent results on achieving "list decoding capacity." The main technical focus is on giving a complete presentation of the recent algebraic results achieving list decoding capacity, while pointers or brief descriptions are provided for other works on list decoding. Algorithmic Results in List Decoding is intended for scholars and graduate students in the fields of theoretical computer science and information theory. The author concludes by posing some interesting open questions and suggests directions for future work.
β¦ Subjects
ΠΠΈΠ±Π»ΠΈΠΎΡΠ΅ΠΊΠ°;ΠΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½Π°Ρ Π»ΠΈΡΠ΅ΡΠ°ΡΡΡΠ°;ΠΠ»Π³ΠΎΡΠΈΡΠΌΡ ΠΈ ΡΡΡΡΠΊΡΡΡΡ Π΄Π°Π½Π½ΡΡ ;
π SIMILAR VOLUMES
Average-Case Complexity is a thorough survey of the average-case complexity of problems in NP. The study of the average-case complexity of intractable problems began in the 1970s, motivated by two distinct applications: the developments of the foundations of cryptography and the search for methods t