- A New Approach to Information Theory (R Lipton, STACS 1994)
- Optimal error correction against computationally bounded noise (Silvio Micali, Chris Peikert, Madhu Sudan, D Wilson, TCC 2005)
- Cryptographic Error Correction (Chris Peikert, 2006 (PhD Thesis))
- Private Locally Decodable Codes (Rafail Ostrovsky, O Pandey, Amit Sahai, 2007)
- Public key encryption which is simultaneously a locally-decodable error-correcting code (B Hemenway, R Ostrovsky, 2007)
- Public-Key Locally-Decodable Codes (B Hemenway, Rafail Ostrovsky, Crypto 2008)
-
Reed-Solomon
- demonstration of RS en-/decoding in DVD players (Tom Høholdt)
-
Reed-Muller
-
Surveys, descriptions, tutorials
- On the Reed-Muller codes
(E. F. Assmus, Jr.) - Reed-Muller Codes
(Sebastian Raaphorst, 2003)
- On the Reed-Muller codes
-
Papers
- A Noise-Adaptive Algorithm for First-Order Reed-Muller Decoding
(Jon Feldman, Matteo Frigo, Ibrahim Abou-Faycal, IEEE VTC 2002)
- A Noise-Adaptive Algorithm for First-Order Reed-Muller Decoding
-
Surveys, descriptions, tutorials
- Turbo Codes
-
Algebraic-Geometric Codes
- Algebraic geometry codes (Høholdt, Pellikaan, van Lint, Handbook of Coding Theory, 1998)
- On the decoding of algebraic-geometric codes (Tom Høholdt, Ruud Pellikaan, 1995)
- Linear-time decodable LDPC codes
-
CRT codes
-
List decoding
- Chinese remaindering with errors
(Oded Goldreich, Dana Ron, Madhu Sudan, 1999) - Finding smooth integers using CRT decoding
(Dan Boneh, STOC 2000) - "Soft-decision" decoding of Chinese remainder codes
(Venkatesan Guruswami, Amit Sahai, Madhu Sudan) - Improveing the alphabet size in high noise, almost optimal rate list decodable codes
(Eran Rom, Amnon Ta-Shma, ECC TR04-069)
- Chinese remaindering with errors
- Constructions of Codes from Number Fields (Venkatesan Guruswami, 2001)
-
List decoding
-
Papers
- Decoding Reed Solomon codes beyond the error-correction diameter (Madhu Sudan, 1997)
- Improved decoding of Reed-Solomon and algebraic-geometric codes (Venkatesan Guruswami, Madhu Sudan)
- Decoding Algebraic-Geometric Codes Beyond the Error-Correction Bound (M. Amin Shokrollahi, Hal Wasserman, 1998)
- List decoding algorithms for certain concatenated codes (Venkatesan Guruswami, Madhu Sudan)
- List decoding: Algorithms and Applications (Madhu Sudan, 2000 (a survey))
- Elwyn Berlekamp (Berkeley)
- Jon Feldman (Google)
- G. David Forney, Jr. (MIT)
- Venkatesan Guruswami (MIT)
- Tom Høholdt (DTU)
- Ruud Pellikaan (TUE)
- M. Amin Shokrollahi (Digital Fountain)
- Neil Sloane (AT&T)
- Daniel Spielman (Yale)
- Madhu Sudan (MIT)
-
Algorithms & Complexity
- The complexity of error-correcting codes (Daniel A. Spielman, 1997)
- Algorithmic issues in coding theory (Madhu Sudan (1997))
- Complexity Issues in Coding Theory (Alexander Barg, Handbook of Coding Theory)
- Computationally Efficient Error-Correcting Codes and Holographic Proofs (Daniel A. Spielman, MIT, 1995)
- Error Detecting and Error Correcting Codes (R.W. Hamming, 1950 (scanned))
- A Library of Linear (and Nonlinear) Codes (Neil Sloane)
- Bounds on the minimum distance of linear codes (Broewer)
- Empirical and Theoretical Code Performance Curves (David MacKay)
- The Error Correcting Codes (ECC) Page (Includes implementations)
- Handbook of Coding Theory: Volume II (Pless, Huffman, Brualdi)
- The Art of Error Correcting Coding (Robert H. Morelos-Zaragoza, 2002 (the companion website))
- A Crash Course on Coding Theory (Madhu Sudan (4 lectures of 10, slides))
- Introduction to Coding Theory (Jon Feldman, Columbia, 2004)
- Search Category - Coding Theory (Netscape directory)
- The Error Correcting Codes (ECC) Page
- International Page on Error Control Coding (Steven Pietrobon)
- Useful links for coding theory (Daniel A. Spielman)
-
Papers
- On families of hash functions via geometric codes and concatenation (Jürgen Bierbrauer, Thomas Johansson, Gregory Kabatinskii, Ben Smeets, Crypto 93)
![[Cool]](http://research.cyber.ee/~lipmaa/gifs/cool.gif)
- Authentication via algebraic-geometric codes (Jürgen Bierbrauer, 1997)
- Some Applications of Coding Theory in Cryptography (Jim Massey, 1995)
- Cryptographic Hardness based on the Decoding of Reed-Solomon Codes with Applications (Aggelos Kiayias, Moti Yung, ECCC TR02-017)
- Polynomial Reconstruction Based Cryptography (A Short Survey) (Aggelos Kiayias and Moti Yung, SAC 2001)
- On the security of error-correcting codes based cryptosystems (Jean-Sebastien Coron, eprint 2003/036)
- List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument Cynthia Dwork, Ronen Shaltiel, Adam Smith, and Luca Trevisan, TCC 2004 (08.05.04)
- On families of hash functions via geometric codes and concatenation (Jürgen Bierbrauer, Thomas Johansson, Gregory Kabatinskii, Ben Smeets, Crypto 93)
- @Universal hash functions
![[citeseer]](http://citeseer.ist.psu.edu/icon/cssmall.gif){kind=icon}
research.cyber.ee