Abstract
Symbol error rate versus error probability for the binary symmetric channel is evaluated for perfect binary codes, i.e. repetition codes (2m+1, 1, 2m+1), Hamming codes (2m−1, 2m−1−m, 3) and Golay code (23, 12, 7), and for the parity check codes (n+1, n, 2).
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
Berlekamp E.R. (1968): Algebraic Coding Theory, McGraw Hill, New York.
Peterson W.W. and Weldon E.J. (1972): Error-Correcting Codes, MIT Press, Boston.
van Lint J.H. (1973): Coding Theory, Lecture Notes in Mathematics n.201, Springer Verlag, Berlin.
Mailliams F.J. and Sloane N.J.A. (1977): The Theory of Error Correcting Codes, vol. XX, North-Holland, Amsterdam.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1983 ACADEMIA, Publishing House of the Czechoslovak Academy of Sciences, Prague
About this chapter
Cite this chapter
Elia, M. (1983). Symbol Error Rate of Binary Block Codes. In: Transactions of the Ninth Prague Conference. Czechoslovak Academy of Sciences, vol 9A. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7013-7_25
Download citation
DOI: https://doi.org/10.1007/978-94-009-7013-7_25
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7015-1
Online ISBN: 978-94-009-7013-7
eBook Packages: Springer Book Archive