Finding Good Binary Linear Block Codes based on Hadamard Matrix and Existing Popular Codes

Because of their algebraic structure and simple hardware implementation, linear codes as class of error-correcting codes, are used in a multitude of situations such as Compact disk, backland bar code, satellite and wireless communication, storage systems, ISBN numbers and so more. Nevertheless, the design of linear codes with high minimum Hamming distance to a given dimension and length of the code, remains an open challenge in coding theory. In this work, we propose a code construction method for constructing good binary linear codes from popular ones, while using the Hadamard matrix. The proposed method takes advantage of the MacWilliams identity for computing the weight distribution, to overcome the problem of computing the minimum Hamming distance for larger dimensions.

@article{Khebbou2021,
  title     = {Finding Good Binary Linear Block Codes based on Hadamard Matrix and Existing Popular Codes},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {12},
  number    = {11},
  year      = {2021},
  publisher = {The Science and Information Organization},
  author    = {Driss Khebbou and Reda Benkhouya and Idriss Chana and Hussain Ben-azza},
  doi       = {10.14569/IJACSA.2021.0121150},
  url       = {https://doi.org/10.14569/IJACSA.2021.0121150}
}