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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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).
E.F. Assmus Jr. and H.F. Mattson Jr., Error-Correcting Codes, Report AFCRL-72-0504, Air Force Cambridge Res. Labs., Bedford, Mass. (1972).
D. Chase, A class of algorithms for decoding block codes with channel measurement information, IEEE Trans.Info.Theory 18 (1970), 170–182.
P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Info. and Control, 23 (1973), 407–438.
J.M. Goethals, On the Golay perfect binary code, J. of Combin. Theory 11 (1971), 178–186.
F.J.MacWilliams and N.J.A.Sloane, The Theory of Error-Correcting codes, North Holland Publishing Comp. (1981).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bossert, M., Hergert, F. (1986). A decoding algorithm for linear codes. In: Calmet, J. (eds) Algebraic Algorithms and Error-Correcting Codes. AAECC 1985. Lecture Notes in Computer Science, vol 229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16776-5_718
Download citation
DOI: https://doi.org/10.1007/3-540-16776-5_718
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16776-1
Online ISBN: 978-3-540-39855-4
eBook Packages: Springer Book Archive