Skip to main content Accessibility help
×
Hostname: page-component-5bbb9b7966-pzgb8 Total loading time: 0 Render date: 2026-02-25T02:55:22.243Z Has data issue: false hasContentIssue false

2 - Basics

Published online by Cambridge University Press:  aN Invalid Date NaN

Enrico Paolini
Affiliation:
University of Bologna
Gianluigi Liva
Affiliation:
German Aerospace Center, Wessling
Balázs Matuz
Affiliation:
Huawei Munich Research Center
Marco Chiani
Affiliation:
University of Bologna
Get access

Summary

Basic definitions and tools for error correction: In Chapter 2, we provide the basic elements of classical error correcting codes, how to perform operations in finite fields, the decision rules, the structure and properties of classical block codes, and finally a description of the Reed–Solomon codes which are particularly important for the erasure channel.

Information

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2026

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Book purchase

Temporarily unavailable

References

Shannon, C., “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, no. 3, pp. 379423, 623656, July 1948.10.1002/j.1538-7305.1948.tb01338.xCrossRefGoogle Scholar
Barg, A., “At the dawn of the theory of codes,” Math. Intelligencer, vol. 15, no. 1, pp. 2027, 1993.10.1007/BF03025254CrossRefGoogle Scholar
Calderbank, A. R., “The art of signaling: Fifty years of coding theory,” IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 25612595, 1998.10.1109/18.720549CrossRefGoogle Scholar
Hamming, R. W., “Error detecting and error correcting codes,” Bell Syst. Tech. J., vol. 29, no. 2, pp. 147160, 1950.10.1002/j.1538-7305.1950.tb00463.xCrossRefGoogle Scholar
Golay, M. J., “Notes on digital coding,” Proc. IEEE, vol. 37, p. 657, 1949.Google Scholar
Muller, D. E., “Metric properties of Boolean algebra and their application to switching circuits, Univ. of Ill., Digital Computer Lab,” Internal Report, Technical Report, 1953.Google Scholar
Muller, D. E., “Application of boolean algebra to switching circuit design and to error detection,” Trans. I.R.E. Professional Group on Electronic Computers, vol. EC-3, no. 3, pp. 612, 1954.10.1109/IREPGELC.1954.6499441CrossRefGoogle Scholar
Reed, I., “A class of multiple-error-correcting codes and the decoding scheme,” Trans. IRE Professional Group on Information Theory, vol. 4, no. 4, pp. 3849, 1954.10.1109/TIT.1954.1057465CrossRefGoogle Scholar
Hocquenghem, A., “Codes correcteurs d’erreurs,” Chiffers, vol. 2, pp. 147156, 1959.Google Scholar
Bose, R. and Ray-Chaudhuri, D., “On a class of error correcting binary group codes,” Information and Control, vol. 3, no. 1, pp. 6879, 1960.10.1016/S0019-9958(60)90287-4CrossRefGoogle Scholar
Reed, I. and Solomon, G., “Polynomial codes over certain finite fields,” J. Soc. Indust. Appl. Math., vol. 8, no. 2, pp. 300304, June 1960.10.1137/0108018CrossRefGoogle Scholar
Chen, C., Peterson, W. W., and E. Weldon Jr, “Some results on quasi-cyclic codes,” Information and Control, vol. 15, no. 5, pp. 407423, 1969.CrossRefGoogle Scholar
Berlekamp, E., Algebraic coding theory. New York, NY, USA: McGraw-Hill, 1968.Google Scholar
Peterson, W. and Weldon, E., Jr., Error-correcting codes. Cambridge, MA, USA: MIT Press, 1972.Google Scholar
MacWilliams, F. and Sloane, N., The theory of error-correcting codes. Amsterdam, the Netherlands: North Holland Mathematical Libray, 1977, vol. 16.Google Scholar
Wicker, S. B. and Bhargava, V. K., Reed-Solomon Codes and Their Applications. New York, NY, USA: Wiley-IEEE Press, 1994.Google Scholar
McEliece, R. J., The theory of information and coding. New York, NY, USA: Cambridge University Press, 2004.10.1017/CBO9780511819896CrossRefGoogle Scholar
Ryan, W. E., Lin, S., and Wilson, S. G., Channel Codes: Classical and Modern. Cambridge University Press, 2024.10.1017/9781009335928CrossRefGoogle Scholar
Roth, R. and Seroussi, G., “On generator matrices of MDS codes,” IEEE Trans. Inf. Theory, vol. 31, no. 6, pp. 826830, 1985.10.1109/TIT.1985.1057113CrossRefGoogle Scholar
Seroussi, G., “A systolic Reed-Solomon encoder,” IEEE Trans. Inf. Theory, vol. 37, no. 4, pp. 12171220, 1991.10.1109/18.86977CrossRefGoogle Scholar
Bloemer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., and Zuckerman, D., “An XOR-based erasure-resilient coding scheme,” International Computer Science Institute, Berkeley, CA, Technical Report TR-95.048, Technical Report, 1995.Google Scholar
Plank, J. and Xu, L., “Optimizing Cauchy Reed-Solomon codes for fault-tolerant network storage applications,” in Proc. Fifth IEEE Int. Symp. Network Computing and Applications (NCA’06), 2006, pp. 173180.10.1109/NCA.2006.43CrossRefGoogle Scholar

Accessibility standard: WCAG 2.2 A

Why this information is here

This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

Accessibility Information

The PDF of this book complies with version 2.2 of the Web Content Accessibility Guidelines (WCAG), offering more comprehensive accessibility measures for a broad range of users and meets the basic (A) level of WCAG compliance, addressing essential accessibility barriers.

Content Navigation

Table of contents navigation
Allows you to navigate directly to chapters, sections, or non‐text items through a linked table of contents, reducing the need for extensive scrolling.
Index navigation
Provides an interactive index, letting you go straight to where a term or subject appears in the text without manual searching.

Reading Order & Textual Equivalents

Single logical reading order
You will encounter all content (including footnotes, captions, etc.) in a clear, sequential flow, making it easier to follow with assistive tools like screen readers.
Short alternative textual descriptions
You get concise descriptions (for images, charts, or media clips), ensuring you do not miss crucial information when visual or audio elements are not accessible.

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×