Advertisement

A decoding algorithm for linear codes

  • Martin Bossert
  • Ferdinand Hergert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 229)

Abstract

A decoding algorithm for linear codes is presented, which is able to correct beyond the half minimum distance and which has the capability to include soft decision decoding. Results on applying this algorithm to some codes (with and without soft decision) are included.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E.F. Assmus Jr., J.M. Goethals and H.F. Mattson Jr., Generalized t-designs and majority logic decoding of linear codes, Info. and Control 32 (1976), 43–60.Google Scholar
  2. [2]
    E.F. Assmus Jr. and H.F. Mattson Jr., Algebraic Theory of Codes II, Report AFCRL-71-0013, Air Force Cambridge Res. Labs., Bedford, Mass. (1970).Google Scholar
  3. [3]
    E.F. Assmus Jr. and H.F. Mattson Jr., Error-Correcting Codes, Report AFCRL-72-0504, Air Force Cambridge Res. Labs., Bedford, Mass. (1972).Google Scholar
  4. [4]
    D. Chase, A class of algorithms for decoding block codes with channel measurement information, IEEE Trans.Info.Theory 18 (1970), 170–182.Google Scholar
  5. [5]
    P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Info. and Control, 23 (1973), 407–438.Google Scholar
  6. [6]
    J.M. Goethals, On the Golay perfect binary code, J. of Combin. Theory 11 (1971), 178–186.Google Scholar
  7. [7]
    F.J.MacWilliams and N.J.A.Sloane, The Theory of Error-Correcting codes, North Holland Publishing Comp. (1981).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Martin Bossert
    • 1
  • Ferdinand Hergert
    • 2
  1. 1.Institut für Netzwerk- und SignaltheorieTH DarmstadtWest Germany
  2. 2.FB Mathematik - AG 1 -TH DarmstadtWest Germany

Personalised recommendations