Advertisement

Eurocode ’92 pp 369-382 | Cite as

Suboptimal Decoding of Linear Codes

  • I. I. Dumer
Part of the International Centre for Mechanical Sciences book series (CISM, volume 339)

Abstract

Suboptimal decoding algorithms of linear codes in an arbitrary “symmetric” memoryless channel are considered. The decoding error probability є is upper bounded by twice the error probability є e of maximum likelihood (ML) decoding. For the q-ary codes of length n → ∞ and code rate R the asymptotic equality є ~ є e holds, while the number of decoding operations is upper bounded by the value qn(c+0(1)), where 0(1) → 0 and c = min (R(1-R), (1-R)/2). For channels with discrete (quantized) output the better estimate c = R(1-R)/(1+R) is obtained. Suboptimal coverings with polynomial construction complexity are also considered.

Keywords

Error Probability Linear Code Code Rate Cyclic Code Light Vector 
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]
    G.S. Evseev, On the complexity of decoding linear codes. Problemy Peredachi Informatsii, vol. 19, no. 1, pp. 3 - 8, 1983.MathSciNetGoogle Scholar
  2. [2]
    L. Levitin and C. Hartmann, A new approach to the general minimum distance decoding problem: The zero-neighbours algorithm IEEE Trans. Inform. Theory, vol. IT-31, pp. 379 - 384, 1985.Google Scholar
  3. [3]
    I.I. Dumer, Two algorithms for linear codes decoding. Problemy Peredachi Informatsii, vol. 25, no. 1, pp. 24 - 32, 1989.MathSciNetGoogle Scholar
  4. [4]
    E.A. Krouk, A bound on the decoding complexity of linear block codes. Problemy Peredachi Informatsii, vol. 25, no. 3, pp. 103 - 106, 1989.MathSciNetGoogle Scholar
  5. [5]
    J.T. Coffey and R.M.F. Goodman, The complexity of information set decoding. IEEE Trans. Inform. Theory, vol. IT-36, pp. 1031 - 1037, 1990.Google Scholar
  6. [6]
    I.I. Dumer, On minimum distance decoding of linear codes. Int. Proc. of the Fifth Intern. Workshop on Information Theory. Convolutional Codes; Multiuser Communication. Moscow, pp. 50 - 52, Jan. 1991.Google Scholar
  7. [7]
    R.G. Gallager, Information Theory and Reliable Communication. New York: John Wiley & Sons, 1968.MATHGoogle Scholar
  8. [8]
    J.K. Wolf, Efficient maximum likelihood decoding of linear codes using a trellis. IEEE Trans. Inform. Theory, vol. IT-24, pp. 76 - 80, 1978.Google Scholar
  9. [9]
    Donald E. Knuth, The Art of Computer Programming Vol. 2: Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1969.MATHGoogle Scholar
  10. [10]
    P. Erdos and J. Spencer, Probabilistic methods in combinatorics. Akademiai Kiado, Budapest, 1974.Google Scholar

Copyright information

© Springer-Verlag Wien 1993

Authors and Affiliations

  • I. I. Dumer
    • 1
    • 2
  1. 1.Institute for Problems of Information TransmissionMoscowRussia
  2. 2.Manchester UniversityManchesterUK

Personalised recommendations