论文信息 - The Performance of Block Codes

The Performance of Block Codes

Modern technologies such as cell phones and optical computer drives depend on algorithms for effective compression and transmission of digital information. The author surveys some mathematical developments in coding theory, a part of the revolution in information theory initiated by Shannon.

E. Berlekamp

[1] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.

[2] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[3] M. Tsfasman,et al. Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound , 1982 .

[4] Robert J. McEliece,et al. A low-rate improvement on the Elias bound (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[5] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[6] R. Gallager. Information Theory and Reliable Communication , 1968 .

[7] Elwyn R. Berlekamp,et al. Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..

[8] Andrew J. Viterbi,et al. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[9] Barney Reiffen,et al. A Note on "Very Noisy" Channels , 1963, Information and Control.

[10] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[11] I. Reed,et al. Polynomial Codes Over Certain Finite Fields , 1960 .

[12] Peter Elias,et al. List decoding for noisy channels , 1957 .