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

被引：0

作者：

Khebbou, Driss ^{[1
]}

Benkhouya, Reda ^{[2
]}

Chana, Idriss ^{[3
]}

Ben-azza, Hussain ^{[1
]}

机构：

[1] Moulay Ismail Univ, Ecole Natl Super Arts & Metiers, Meknes, Morocco

[2] Ibn Tofail Univ, Fac Sci, Kenitra, Morocco

[3] Moulay Ismail Univ, Ecole Super Technol, Meknes, Morocco

来源：

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS | 2021年 / 12卷 / 11期

关键词：

Binary linear codes; code construction; minimum hamming distance; error-correcting codes; weight distribution; coding theory; hadamard matrix;

D O I：

10.14569/IJACSA.2021.0121150

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：446 / 451

页数：6

共 50 条

[31] Reliability-based information set decoding of binary linear block codes
Fossorier, MPC
Lin, S
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1999, E82A (10) : 2034 - 2042
[32] GOOD BLOCK CODES DERIVED FROM CYCLIC CODES
PIRET, P
ELECTRONICS LETTERS, 1974, 10 (18) : 391 - 392
[33] The construction of periodically time-variant convolutional codes using binary linear block codes
Ogasahara, Naonori
Kobayashi, Manabu
Hirasawa, Shigeichi
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2007, 90 (09): : 31 - 40
[34] BINARY SLIDING BLOCK CODES
BERGER, T
LAU, JKY
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (03) : 343 - 353
[35] A Family of Low Complexity Adaptive Binary Linear Block Codes
Loskot, Pavel
Beaulieu, Norman C.
GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2006,
[36] G-projectable and Δ-projectable binary linear block codes
Esmaeili, Morteza
Hivadi, Morteza
DESIGNS CODES AND CRYPTOGRAPHY, 2007, 45 (01) : 51 - 64
[37] Determination of the local weight distribution of binary linear block codes
Yasunaga, Kenji
Fujiwara, Toru
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (10) : 4444 - 4454
[38] G-projectable and Λ-projectable binary linear block codes
Morteza Esmaeili
Morteza Hivadi
Designs, Codes and Cryptography, 2007, 45 : 51 - 64
[39] ON THE TRELLIS COMPLEXITY OF CERTAIN BINARY LINEAR BLOCK-CODES
YTREHUS, O
IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (02) : 559 - 560
[40] Low weight subtrellises for binary linear block codes and their applications
Kasami, T
Koumoto, T
Fujiwara, T
Yamamoto, H
Desaki, Y
Lin, S
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (11) : 2095 - 2103

← 1 2 3 4 5 →