Advertisement

Residual Error Rate of Binary Linear Block Codes

  • G. D. Cohen
  • P. J. Godlewski
Part of the International Centre for Mechanical Sciences book series (CISM, volume 219)

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.

Keywords

Block Code Code Word Weight Enumerator Transitive Permutation Group Binary Symmetric Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Berlekamp, E.R., Algebraic Coding Theory. New York: Mc Graw-Hill, 1968, pp. 397–399.MATHGoogle Scholar

Copyright information

© Springer-Verlag Wien 1975

Authors and Affiliations

  • G. D. Cohen
    • 1
  • P. J. Godlewski
    • 1
  1. 1.Laboratoire des CommunicationsEcole Nationale Supérieure des TélécommunicationsParisFrance

Personalised recommendations