Minimun distance decoding algorithms for linear codes

  • Alexander Barg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1255)


Some known general (i.e., applicable to all linear codes) algorithms of minimum distance decoding use a certain set of codewords to successively improve the current decision. Important examples in this class are the minimal-vectors decoding [14] and zero-neighbours decoding [16]. These two methods have some common features that enable us to introduce a general gradient-like decoding algorithm. We formulate key properties of this decoding, which allows us to analyze known algorithms in this class in a simple and unified manner. Further, we show that under certain conditions, gradient-like algorithms must examine all zero neighbours, and therefore, the size of this set provides a lower bound on the complexity of algorithms in this class. This implies that general asymptotic improvements of the zero-neighbours decoding algorithm in the class of gradient-like methods are impossible.

The second group of methods, information set decoding, is better studied and yields algorithms with best known asymptotic complexity. All known algorithms in this group can be viewed as modifications of covering set decoding. Following [4], we introduce an algorithm that for long codes ensures the maximum likelihood performance and has the smallest known asymptotic complexity for any code rate R, 0<R<1.


Linear Code Code Rate Decode Algorithm Voronoi Region Decode Method 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Ashikhmin, A. Barg, G. Cohen, and L. Huguet, “Variations on minimal codewords in linear codes,” in G. Cohen, M. Giustu, and T. Mora, Eds., Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lect. Notes Comput. Sci., 948, Berlin: Springer (1995), pp. 96–105.Google Scholar
  2. 2.
    A. Ashikhmin and A. Barg, “Minimal vectors in linear codes,” submitted. Preliminary version available from 343/preprints, Preprint 94-113.Google Scholar
  3. 3.
    A. Barg, “Complexity issues in coding theory,” in R. Brualdi, V. Pless and W. C. Huffman, Handbook of Coding Theory Elsevier Science, to be published.Google Scholar
  4. 4.
    A. Barg, E. Krouk and H. C. A. van Tilborg, “The complexity of hard-decision decoding of linear codes,” IEEE Int. Sympos. Inform. Theory, Ulm (1997).Google Scholar
  5. 5.
    A. Barg and I. Dumer, “On computing the weight spectrum of cyclic codes,” IEEE Trans. Inform. Theory, IT-38 (4) (1992), 1382–1386.Google Scholar
  6. 6.
    V. M. Blinovskii, “Lower asymptotic bound on the number of linear code words in a sphere of given radius in F qn,” Problems of Info. Trans., 23 (2) (1987), 50–53 (Russian) and 130–132 (English translation).Google Scholar
  7. 7.
    A. Canteaut and F. Chabaud, “A new algorithm for finding minimum-weight codewords in a linear code: application to primitive narrow-sense BCH codes of length 511,” Rapport de recherche no. 2685, INRIA, Rocquencourt (1995).Google Scholar
  8. 8.
    A. H. Chan and R. A. Games, “(n, k, t)-covering systems and error-trapping decoding,” IEEE Trans. Inform. Theory, IT-27 (1981), 643–646.Google Scholar
  9. 9.
    J. T. Coffey and R. M. F. Goodman, “The complexity of information set decoding,” IEEE Trans. Inform. Theory, IT-35 (5) (1990), 1031–1037.Google Scholar
  10. 10.
    I. Dumer, “Two decoding algorithms for linear codes,” Problems of Info. Trans., 25 (1) (1989), 24–32 (Russian) and 17–23 (English translation).Google Scholar
  11. 11.
    -, “On minimum distance decoding of linear codes,” Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, Moscow (1991), pp. 50–52.Google Scholar
  12. 12.
    G. S. Evseev, “Complexity of decoding for linear codes,” Problems of Info. Trans., 19 (1) (1983), 3–8 (Russian) and 1–6 (English translation).Google Scholar
  13. 13.
    C. R. P. Hartmann and L. B. Levitin, “An improvement of the zero-neighbors minimum distance decoding algorithm: The zero-guard algorithm,” IEEE Int. Sympos. Inform. Theory, Kobe, Japan (1988).Google Scholar
  14. 14.
    T.-Y. Hwang, “Decoding linear block codes for minimizing word error rate,” IEEE Trans. Inform. Theory, IT-25 (6) (1979), 733–737.Google Scholar
  15. 15.
    E. A. Krouk, “Decoding complexity bound for linear block codes,” Problems of Info. Trans., 25 (3) (1989) (Russian), 103–107 (Russian) and 251–254 (English translation).Google Scholar
  16. 16.
    L. Levitin and C. R. P. Hartmann, “A new approach to the general minimum distance decoding problem: The zero-neighbours algorithm,” IEEE Trans. Inform. Theory, IT-31 (3) (1985), 379–384.Google Scholar
  17. 17.
    J. K. Omura, “Iterative decoding of linear codes by a modulo-2 linear program,” Discrete Math., 3 (1972), 193–208.Google Scholar
  18. 18.
    E. Prange, “The use of information sets in decoding cyclic codes,” IRE Trans., IT-8 (1962), S5–S9.Google Scholar
  19. 19.
    J. van Tilburg, “On the McEliece public-key cryptosystem,” in S. Goldwasser, Ed., “Advances in Cryptology” (Crypto'88), Lect. Notes Comput. Science 403, New-York: Springer (1990), pp. 119–131.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Alexander Barg
    • 1
  1. 1.Bell Laboratories 2C-375Murray Hill

Personalised recommendations