Algorithmic Results in List Decoding
- ISBN-10
- 1601980043
- ISBN-13
- 9781601980045
- Category
- Computers
- Pages
- 98
- Language
- English
- Published
- 2007-01-24
- Publisher
- Now Publishers Inc
- Author
- Venkatesan Guruswami
Description
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.
Get the book
Similar books
-
List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition
By Venkatesan GuruswamiThis book presents some spectacular new results in the area of decoding algorithms for error-correcting codes.
-
Error Correction Coding: Mathematical Methods and Algorithms
By Todd K. MoonThis text offers both "classical" coding theory-such as Hamming, BCH, Reed-Solomon, Reed-Muller, and convolutional codes-as well as modern codes and decoding methods, including turbo codes, LDPC codes, repeat-accumulate codes, space time ...
-
Encyclopedia of Algorithms
By Ming-Yang KaoFoundations of Software Technology and Theoretical Computer Science FSTTCS 2005. LNCS, vol. ... 11(2), 109–125 (1981) Parameterized Matching 1993; Baker MOSHE LEWENSTEIN Department of Computer Science, Bar-Ilan University, Ramat-Gan, ...
-
Introduction to Coding Theory
By Ron RothPublisher description
-
Joint Source Channel Coding Using Arithmetic Codes
By Khalid Sayood, Dongsheng Bi, Michael Ward HoffmanProposes a new way of looking at arithmetic codes with forbidden symbols.
-
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton,...
By R. Ravi, José D.P. Rolim, Klaus Jansen... algorithms, and show that under some mild conditions property testers for Boolean functions can be transformed into this canonical form. Our first main result shows, roughly speaking, that every ... Boolean Function Properties Introduction.
-
Proceedings Of The International Congress Of Mathematicians 2010 (Icm 2010) (In 4 Volumes) - Vol. I: Plenary Lectures And Ceremonies,...
By Bhatia Rajendra, Pal Arup, Rangarajan GM. Kisin, Potentially semi-stable deformation rings, J. AMS, 21, 513–546, ... R. Taylor, On Galois representations associated to Hilbert modular forms, Invent. Math. ... Modular elliptic curves and Fermat's last theorem, Ann. of Math.
-
Joint Source Channel Coding Using Arithmetic Codes
By Michael Hoffman, Bi Dongsheng, Khalid SayoodBased on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants.
-
Locally Decodable Codes
By Sergey YekhaninThis book introduces and motivates locally decodable codes, and discusses the central results of the subject. It will benefit computer scientists, electrical engineers, and mathematicians with an interest in coding theory.
-
Information Theory, Inference and Learning Algorithms
By David J. C. MacKayMACKAY , D. J. C. , and NEAL , R. M. ( 1995 ) Good codes based for blind source separation . In ICA : Principles and Practice , ed . by S. Roberts and R. Everson . Cambridge Univ . Press . on very sparse matrices .