Abstract
First, top-down RMLD(recursive maximum likelihood decoding) algorithms are reviewed. Then, in connection with adjacent subcodewords, a concept of conditional syndrome is introduced. Based on this, sufficient conditions of most likely local sub-codewords in top-down RMLD algorithms are presented. These conditions lead to efficient implementations of top-down RMLD algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T. Fujiwara, H. Yamamoto, T. Kasami and S. Lin, “A trellis-based recursive maximum likelihood decoding algorithm for linear codes” IEEE Trans. Inform. Theory, vol. 44, pp. 714–729, Mar. 1998.
Y. Kaji, T. Fujiwara and T. Kasami, “An efficient call-by-need algorithm for the maximum likelihood decoding of a linear code,” Proc. of ISITA2000, Honolulu, HA, USA, pp. 335–338, Nov., 2000.
T. Kasami, H. Tokushige and Y. Kaji, “Search procedures in top-down recursive maximum likelihood decoding algorithm,” Proc. of SITA2000, Aso, Kumamoto, Japan, pp. 535–538, Oct. 2000.
Y. Kaji, H. Tokushige and T. Kasami, “An improved search algorithm for the adaptive and recursive MLD,” Proc. of 2001 ISIT, Washington, D.C., Jun. 2001.
T. Kasami, “On Recursive Maximum Likelihood Decoding Algorithms for Linear Codes,” Technical Report of IEICE, IT2000-58, pp. 75–83, Mar. 2001.
S. Lin, T. Kasami, T. Fujiwara and M. Fossorier, Trellises and Trellis-based Decoding Algorithms for Linear Block Codes, Kluwer Academic Publishers, Boston, MA, 1998.
G. D. Forney Jr., “Coset codes II: Binary lattice and related codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1152–1187, Sept. 1988.
T. Kasami, “On integer programming problems related to soft-decision iterative decoding algorithms,” Proc. of AAECC-13, Honolulu, Hawaii, USA. Lecture Notes in Computer Science, vol. 1719, pp. 43–54, Spring Verlag, Nov. 1999.
T. Kasami, H. Tokushige, T. Fujiwara, H. Yamamoto and S. Lin, “A recursive maximum likelihood decoding algorithm for some transitive invariant binary block codes,” IEICE Trans. Fundamentals, vol. E81-A, pp. 1916–1924, Sept. 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kasami, T., Tokushige, H., Kaji, Y. (2001). Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms. In: Boztaş, S., Shparlinski, I.E. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2001. Lecture Notes in Computer Science, vol 2227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45624-4_35
Download citation
DOI: https://doi.org/10.1007/3-540-45624-4_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42911-1
Online ISBN: 978-3-540-45624-7
eBook Packages: Springer Book Archive