论文信息 - A Decoding Algorithm for Linear Codes

A Decoding Algorithm for Linear Codes

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.

Martin Bossert | Ferdinand Hergert

[1] Philippe Delsarte,et al. Four Fundamental Parameters of a Code and Their Combinatorial Significance , 1973, Inf. Control..

[2] David Chase,et al. Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[3] Harold F. Mattson,et al. Generalized t-Designs and Majority Decoding of Linear Codes , 1976, Inf. Control..

[4] H. Mattson,et al. Algebraic Theory of Codes 2 , 1970 .

[5] Jean-Marie Goethals,et al. On the Golay Perfect Binary Code , 1971, J. Comb. Theory, Ser. A.

[6] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .