Skip to main content
SpringerLink
Log in

Construction of Some Good Binary Linear Codes Using Hadamard Matrix and BCH Codes

  • Conference paper
  • First Online:
Proceedings of Sixth International Congress on Information and Communication Technology

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 235))

Abstract

This paper presents a new method of constructing good binary linear codes. The proposed method is first based on the BCH codes parity matrix and Hadamard’s matrix, and after on a GUAVA-based computer search, which allowed us to find several good codes with rates >0.5.

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 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.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

References

  1. Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27:379–423. https://doi.org/10.1002/j.1538-7305.1948.tb01338.x

    Article  MathSciNet  MATH  Google Scholar 

  2. Hamming RW (1950) Error detecting and error correcting codes. Bell Syst Tech J 29:147–160. https://doi.org/10.1002/j.1538-7305.1950.tb00463.x

    Article  MathSciNet  MATH  Google Scholar 

  3. Marcel Golay (1949) Notes on digital coding

    Google Scholar 

  4. Tomlinson M, Tjhai CJ, Ambroze MA, Ahmed M, Jibril M (2017) Bounds on error-correction coding performance. In: Tomlinson M, Tjhai CJ, Ambroze MA, Ahmed M, Jibril M (eds) Error-correction coding and decoding: bounds, codes, decoders, analysis and applications. Springer International Publishing, Cham, pp 3–23

    Chapter  Google Scholar 

  5. Augot D, Charpin P, Sendrier N (1992) Studying the locator polynomials of minimum weight codewords of BCH codes. IEEE Trans Inf Theory 38:960–973. https://doi.org/10.1109/18.135638

    Article  MathSciNet  MATH  Google Scholar 

  6. Augot D, Sendrier N (1994) Idempotents and the BCH bound. IEEE Trans Inf Theory 40:204–207. https://doi.org/10.1109/18.272483

    Article  MATH  Google Scholar 

  7. Dianwu Y, Zhengming H (1996) On the dimension and minimum distance of BCH codes over GF(q). J Electron China 13:216–221. https://doi.org/10.1007/BF02685830

    Article  Google Scholar 

  8. Peterson W (1960) Encoding and error-correction procedures for the Bose-Chaudhuri codes. IRE Trans Inf Theory 6:459–470. https://doi.org/10.1109/TIT.1960.1057586

    Article  MathSciNet  MATH  Google Scholar 

  9. Spence LE, Insel AJ, Friedberg S (1999) Elementary Linear algebra: a matrix approach. presented at the (1999)

    Google Scholar 

  10. Morelos-Zaragoza RH (2006) The art of error correcting coding. John Wiley & Sons Inc., Hoboken, NJ, USA

    Book  Google Scholar 

  11. Hadamard J (1893) RESOLUTION D’UNE QUESTION RELATIVE AUX DETERMINANTS—in Bulletin des Sciences Mathematiques, Septembre 1893. See Description (1893)

    Google Scholar 

  12. Hadamard Matrix—an overview | ScienceDirect Topics, https://www.sciencedirect.com/topics/computer-science/hadamard-matrix

  13. Grassl, Markus Bounds on the minimum distance of linear codes and quantum codes. http://www.codetables.de

  14. Vardy A (1997) The intractability of computing the minimum distance of a code. IEEE Trans Inf Theory 43:1757–1766. https://doi.org/10.1109/18.641542

    Article  MathSciNet  MATH  Google Scholar 

  15. Bozzano Luisa. Handbook of Coding Theory, Volume II—1st Edition, https://www.elsevier.com/books/handbook-of-coding-theory/luisa/978-0-444-50087-8

  16. Zimmermann K-H (1996) Integral Hecke modules, integral generalized reed-Muller codes, and linear codes. Techn Univ, Hamburg-Harburg

    Google Scholar 

  17. The GAP Group, http://www.gap-system.org

  18. Robert H. Morelos-Zaragoza: The Art of Error Correcting Coding, http://the-art-of-ecc.com/

Download references

Author information

Authors and Affiliations

  1. Moulay Ismail University, Meknes, Morocco

    Driss Khebbou & Idriss Chana

  2. Ibn Tofail University, Kenitra, Morocco

    Reda Benkhouya

Authors
  1. Driss Khebbou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reda Benkhouya
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Idriss Chana
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Middlesex University, London, UK

    Xin-She Yang

  2. University of Reading, Reading, UK

    Simon Sherratt

  3. JIS University, Kolkata, India

    Nilanjan Dey

  4. Global Knowledge Research Foundation, Ahmedabad, India

    Amit Joshi

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Khebbou, D., Benkhouya, R., Chana, I. (2022). Construction of Some Good Binary Linear Codes Using Hadamard Matrix and BCH Codes. In: Yang, XS., Sherratt, S., Dey, N., Joshi, A. (eds) Proceedings of Sixth International Congress on Information and Communication Technology. Lecture Notes in Networks and Systems, vol 235. Springer, Singapore. https://doi.org/10.1007/978-981-16-2377-6_49

Download citation

Publish with us

Policies and ethics

Search

Navigation