Abstract
We consider two decoders: an incomplete decoder,Di, as defined in [1], which corrects up to t errors, and a complete one, D, derived from Di (see section 4). In section 2 the decoding probability corresponding to Di, Pd, is expanded in series up to the two first orders. We then compute an exact expression for the residual error rate Rre for both Di, and D, and derive a straightforward upper bound for Rre of D. Series expansions of these quantities are given, based on the results of section 2. Basically, a classical result on the decoding probability due to J. Mac Williams [1] is used.
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., Algebraic Coding Theory. New York: Mc Graw-Hill, 1968, pp. 397–399.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag Wien
About this chapter
Cite this chapter
Cohen, G.D., Godlewski, P.J. (1975). Residual Error Rate of Binary Linear Block Codes. In: Longo, G. (eds) Information Theory New Trends and Open Problems. International Centre for Mechanical Sciences, vol 219. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2730-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2730-8_14
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81378-2
Online ISBN: 978-3-7091-2730-8
eBook Packages: Springer Book Archive