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.
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- D. Chase, A class of algorithms for decoding block codes with channel measurement information, IEEE Trans.Info.Theory 18 (1970), 170–182.Google Scholar
- P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Info. and Control, 23 (1973), 407–438.Google Scholar
- J.M. Goethals, On the Golay perfect binary code, J. of Combin. Theory 11 (1971), 178–186.Google Scholar
- F.J.MacWilliams and N.J.A.Sloane, The Theory of Error-Correcting codes, North Holland Publishing Comp. (1981).Google Scholar