Information Theory of Data Transmission Codes
George Thomas,
George Thomas
University of Southwestern Louisiana, Lafayette, LA
Search for more papers by this authorGeorge Thomas,
George Thomas
University of Southwestern Louisiana, Lafayette, LA
Search for more papers by this authorFirst published: 27 December 1999
Abstract
The sections in this article are
- 1 Data Sources and Channels
- 2 Block Coding
- 3 Convolutional Codes
- 4 Additional Topics
- 5 Applications
Bibliography
- 1 C. E. Shannon A mathematical theory of communications, Bell Syst. Tech. J., 27: 379–423, 623–656, 1948.
- 2 R. G. Gallager Information Theory and Reliable Communication, New York: Wiley, 1968.
- 3 E. R. Berlekamp Algebraic Coding Theory, New York: McGraw-Hill, 1989.
- 4 W. W. Peterson E. J. Weldon, Jr. Error Correcting Codes, 2nd ed., Cambridge, MA: MIT Press, 1972.
- 5 E. R. Berlekamp Key Papers in the Development of Coding Theory, New York: IEEE Press, 1974.
- 6 F. J. MacWilliams N. J. A. Sloane The Theory of Error Correcting Codes, Amsterdam, The Netherlands: North-Holland, 1977.
- 7 R. E. Blahut Theory and Practice of Error Control Codes, Reading, MA: Addison-Wesley, 1983.
- 8 S. Lin D. J. Costello, Jr. Error Control Coding: Fundamentals and Applications, Englewood Cliffs, NJ: Prentice-Hall, 1983.
- 9 A. M. Michelson A. H. Levesque Error Control Techniques for Digital Communications, New York: Wiley, 1985.
- 10 R. W. Hamming Error detecting and error correcting codes, Bell Syst. Tech. J., 29: 147–160, 1950.
- 11 D. E. Slepian A class of binary signaling alphabets, Bell Syst. Tech. J., 35: 203–234, 1956.
- 12 F. J. MacWilliams A theorem on the distribution of weights in a systematic code, Bell Syst. Tech. J., 42: 79–94, 1963.
- 13 E. Prange Cyclic error-correcting codes in two symbols, AFCRC-TN-57-103, Air Force Cambridge Research Center, Cambridge, MA, 1957.
- 14
R. C. Bose
D. K. Ray-Chaudhuri
On a class of error correcting binary group codes,
Inf. Control,
3:
68–79,
1960.
10.1016/S0019-9958(60)90287-4 Google Scholar
- 15 A. Hocquenghem Codes correcteurs d’erreurs, Chiffres, 2: 147–156, 1959, in French.
- 16 W. W. Peterson Encoding and decoding procedures for the Bose–Chaudhuri codes, IRE Trans. Inf. Theory, 6: 459–470, 1960.
- 17 D. C. Gorenstein N. Zierler A class of error-correcting codes in pm symbols, J. Soc. Ind. Appl. Math (SIAM), 9: 207–214, 1961.
- 18 R. T. Chien Cyclic decoding procedure for the BCH codes, IEEE Trans. Inf. Theory, 10: 357–363, 1964.
- 19 E. R. Berlekamp On decoding binary BCH codes, IEEE Trans. Inf. Theory, 11: 577–580, 1965.
- 20 J. L. Massey Shift register synthesis and BCH decoding, IEEE Trans. Inf. Theory, 15: 122–127, 1969.
- 21 R. E. Blahut Transform techniques for error control codes, IBM J. Res. Develop., 23: 299–315, 1979.
- 22 I. S. Reed G. Solomon Polynomial codes over certain finite fields, J. Soc. Ind. Appl. Math. (SIAM), 8: 300–304, 1960.
- 23 S. B. Wicker V. K. Bhargava Reed–Solomon Codes and Their Applications, Piscataway, NJ: IEEE Press, 1994.
- 24 A. Tietvainen A short proof for the nonexistence of unknown perfect codes over GF(q),q > 2, Ann. Acad. Sci. Fenn. A, 580: 1–6, 1974.
- 25
M. J. E. Golay
Binary coding,
IRE Trans. Inf. Theory,
4:
23–28,
1954.
10.1109/TIT.1954.1057463 Google Scholar
- 26
P. Elias
Error-free coding,
IRE Trans. Inf. Theory,
4:
29–37,
1954.
10.1109/TIT.1954.1057464 Google Scholar
- 27 H. O. Burton E. J. Weldon, Jr. Cyclic product codes, IRE Trans. Inf. Theory, 11: 433–440, 1965.
- 28 G. D. Forney, Jr. Concatenated Codes, Cambridge, MA: MIT Press, 1966.
- 29 J. Justesen A class of constructive asymptotically algebraic codes, IEEE Trans. Inf. Theory, 18: 652–656, 1972.
- 30 E. N. Gilbert A comparison of signaling alphabets, Bell Syst. Tech. J., 31: 504–522, 1952.
- 31 M. A. Tsfasman S. G. Vladut T. Zink Modular curves, Shimura curves and Goppa codes which are better than the Varsharmov–Gilbert bound, Math. Nachr., 109: 21–28, 1982.
- 32 R. J. McEliece et al. New upper bounds on the rate of a code via the Delsarte–MacWilliams inequalities, IEEE Trans. Inf. Theory, 23: 157–166, 1977.
- 33 T. Verhoeff An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. Inf. Theory, 33: 665–680, 1987.
- 34 P. Elias Coding for noisy channels, IRE Conv. Rec., 4: 37–47, 1955.
- 35 R. M. Fano A heuristic discussion of probabilistic decoding, IEEE Trans. Inf. Theory, 9: 64–74, 1963.
- 36 J. M. Wozencraft B. Reiffan Sequential Decoding, Cambridge, MA: MIT Press, 1961.
- 37
J. L. Massey
Threshold Decoding,
Cambridge, MA:
MIT Press,
1963.
10.21236/AD0407946 Google Scholar
- 38 A. J. Viterbi Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Trans. Inf. Theory, 13: 260–269, 1967.
- 39 G. D. Forney, Jr. Convolutional codes I: Algebraic structure, IEEE Trans. Inf. Theory, 16: 720–738, 1970.
- 40 S. J. Mason Feedback theory—Further properties of signal flow graphs, Proc. IRE, 44: 920–926, 1956.
- 41 R. F. H. Fischer J. B. Huber Comparison of precoding schemes for digital subscriber lines, IEEE Trans. Commun., 45: 334–343, 1997.
- 42 S. G. Wilson Digital Modulation and Coding, Upper Saddle River, NJ: Prentice-Hall, 1996.
- 43 G. Ungerboeck Channel coding with amplitude/phase modulation, IEEE Trans. Inf. Theory, 28: 55–67, 1982.
- 44 G. Ungerboeck IEEE Commun. Mag., 25 (2): 12–21, 1987.
- 45 C. Berrou A. Glavieux Near-optimum error correcting coding and decoding: Turbo codes, IEEE Trans. Commun., 44: 1261–1271, 1996.
- 46 E. Ayanoglu R. D. Gitlin N. C. Oguz Performance improvement in broadband networks using a forward error correction for lost packet recovery, J. High Speed Netw., 2: 287–304, 1993.
- 47 C. Partridge Gigabit Networks, Reading, MA: Addison-Wesley, 1994.
- 48 T. S. Rzeszewski Digital Video: Concepts and Applications across Industries, Piscataway, NJ: IEEE Press, 1995.
- 49 T. S. Rappaport Wireless Communications: Principles and Practice, Upper Saddle River, NJ: Prentice-Hall, 1996.
Wiley Encyclopedia of Electrical and Electronics Engineering
Browse other articles of this reference work:
