An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity | SpringerLink
Skip to main content
Springer Nature Link
Log in

An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity

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

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

Abstract

Based on h reference words, Kasami et. al. proposed an integer programming problem (IPP) whose optimal value of the objective function gives a sufficient condition on the optimality of a decoded codeword. The IPP has been solved for 1 ≤ h ≤ 3. In this paper, an algorithm for solving the IPP for h = 4 is presented. The computational complexity of this algorithm is investigated.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. D. J. Taipale and M. B. Pursley, “An Improvement to Generalized Minimum-Distance Decoding,” IEEE Trans. Inform. Theory, vol. 37, pp. 167–172, Jan. 1991.

    Article  MATH  MathSciNet  Google Scholar 

  2. T. Kaneko, T. Nishijima, H. Inazumi and S. Hirasawa, “An Efficient Maximum Likelihood Decoding Algorithm for Linear Block Codes with Algebraic Decoder,” IEEE Trans. Inform. Theory, vol. 40, pp. 320–327, Mar. 1994.

    Article  MATH  Google Scholar 

  3. T. Kasami, T. Takata, T. Koumoto, T. Fujiwara, H. Yamamoto and S. Lin, “The Least Stringent Sufficient Condition on Optimality of Suboptimal Decoded Codewords,” Technical Report of IEICE, Japan, IT94-82, Jan. 1995.

    Google Scholar 

  4. T. Kasami, T. Koumoto, T. Takata and S. Lin, “The Effectiveness of the Least Stringent Sufficient Condition on Optimality of Decoded Codewords,” Proc. 3rd Int. Symp. Commun. Theory & Appl., Ambleside, UK, pp. 324–333, July 1995.

    Google Scholar 

  5. T. Koumoto, T. Takata, T. Kasami and S. Lin, “A Low-Weight Trellis Based Iterative Soft-Decision Decoding Algorithm for Binary Linear Block Codes,”IEEE Trans. Inform. Theory, vol. 45, pp. 731–741, Mar. 1999.

    Article  MATH  MathSciNet  Google Scholar 

  6. T. Kasami, Y. Tang, T. Koumoto and T. Fujiwara, “Sufficient Conditions for Ruling-Out Useless Iterative Steps in a Class of Iterative Decoding Algorithms,” to appear in IEICE Trans. Fundamentals, vol. E82-A, Oct. 1999.

    Google Scholar 

  7. T. Koumoto and T. Kasami, “An Iterative Decoding Algorithm Based on Information of Decoding Failure,” Proc. of the 20th Symp. Inform. Theory & Appl., Matsuyama, Japan, pp. 325–328, Dec. 1997.

    Google Scholar 

  8. Y. Tang, T. Kasami and T. Fujiwara, “An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes,” Technical Report of NAIST, Japan, NAIST-IS-TR98012, Oct. 1998.

    Google Scholar 

  9. T. Kasami, “On Integer Programming Problems Related to Soft-decision Iterative Decoding Algorithms,” to appear in Proc. of the 13th Int. Symp. AAECC, Honolulu, HI, USA, Nov. 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Nara, Japan

    Yuansheng Tang & Toru Fujiwara

  2. Department of Computer Science, Faculty of Information Science, Hiroshima City University, Hiroshima, Japan

    Tadao Kasami

Authors
  1. Yuansheng Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tadao Kasami
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Toru Fujiwara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Hawaii, 2540 Dole St., # 483, Honolulu, HI, 96822, USA

    Marc Fossorier  & Shu Lin  & 

  2. Institute of Industrial Science, University of Tokyo, 7-22-1, Roppongi, Minato-ku, Tokyo, 106, Japan

    Hideki Imai

  3. AAECC/IRIT, Université Paul Sabatier, 118, Route de Narbonne, F31067, Toulouse, Cedex, France

    Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tang, Y., Kasami, T., Fujiwara, T. (1999). An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-46796-3_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66723-0

  • Online ISBN: 978-3-540-46796-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation