Abstract
Massey’s theorem is used to determine the minimum distance of the Golay codes. The same method can be used to determine the minimum distance of other cyclic codes. This suggests that Massey’s theorem may be a powerful tool whose uses are not yet fully uncovered.
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.
References
J. L. Massey, “Shift-register synthesis and BCH decoding”, IEEE Transactions on Information Theory, Vol. 15, pp. 122–127, 1969.
U. Maurer and R. Viscardi, Running-Key Generators with Memory in the Nonlinear Combining Function, Diploma thesis, ETH Swiss Federal Institute of Technology, Zurich, 1984.
K. Saints and C. Heegard, “On hyperbolic cascaded Reed-Solomon codes”, Proceedings of the Tenth International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, San Juan, Puerto Rico, 1993.
S. Sakata, “Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array”, Journal of Symbolic Computation, Vol. 5, pp. 321–337, 1988.
R. E. Blahut, Algebraic Methods for Signal Processing and Communication Coding,Springer-Verlag, 1992.
T. Schaub, A Linear Complexity Approach to Cyclic Codes, Doctor of Technical Sciences Dissertation, ETH Swiss Federal Institute of Technology, Zurich, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Blahut, R.E. (1994). Massey’s Theorem and the Golay Codes. In: Blahut, R.E., Costello, D.J., Maurer, U., Mittelholzer, T. (eds) Communications and Cryptography. The Springer International Series in Engineering and Computer Science, vol 276. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2694-0_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2694-0_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6159-6
Online ISBN: 978-1-4615-2694-0
eBook Packages: Springer Book Archive