Abstract
We now consider the problem of constructing linear codes which are capable of correcting all error words of weight no greater than t. If the code is defined as the null space of the H matrix, and the syndrome is given by st = HRt, then the decoder must attempt to find a minimum weight E which solves the equation
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1970 Springer-Verlag Wien
About this chapter
Cite this chapter
Berlekamp, E.R. (1970). Hamming Codes, Single Error — Correcting and Cyclic. In: A Survey of Algebraic Coding Theory. International Centre for Mechanical Sciences, vol 28. Springer, Vienna. https://doi.org/10.1007/978-3-7091-4325-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-7091-4325-4_3
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81088-0
Online ISBN: 978-3-7091-4325-4
eBook Packages: Springer Book Archive