Skip to main content
SpringerLink
Log in

Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2227))

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 to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. T. Kasami, “On Recursive Maximum Likelihood Decoding Algorithms for Linear Codes,” Technical Report of IEICE, IT2000-58, pp. 75–83, Mar. 2001.

    Google Scholar 

  6. 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.

    MATH  Google Scholar 

  7. G. D. Forney Jr., “Coset codes II: Binary lattice and related codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1152–1187, Sept. 1988.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Sciences, Hiroshima City University, 4-1, Ozuka-Higashi 3, 731-3194, Asaminami, Hiroshima, Japan

    Tadao Kasami & Hitoshi Tokushige

  2. Graduate School of Information Science, Nara Institute of Science and Technology, 630-0101, 8916-5 Takayama, Ikoma, Nara, Japan

    Yuichi Kaji

Authors
  1. Tadao Kasami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hitoshi Tokushige
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuichi Kaji
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, RMIT University, GPO Box 2476V, 3001, Melbourne, Australia

    Serdar Boztaş

  2. Department of Computing, Macquarie University, 2109, NSW, Australia

    Igor E. Shparlinski

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation