Bibliographic Details
| Title: |
On binary LCD BCH codes of length $ \frac{{{2^m} + 1}}{3} $. |
| Authors: |
Liu, Yuzhe, Kai, Xiaoshan, Zhu, Shixin |
| Source: |
Advances in Mathematics of Communications; Aug2024, Vol. 18 Issue 4, p1-15, 15p |
| Subject Terms: |
CYCLIC codes, LINEAR codes, DATA transmission systems, BINARY codes |
| Abstract: |
BCH codes are a special subclass of cyclic codes and have many important applications in data storage and communication systems. In this paper, we investigate the structure of binary linear complementary dual (LCD) BCH codes with length $ n = \frac{{{2^m} + 1}}{3} $, where $ m \geq 7 $ is an odd integer. By exploring cyclotomic cosets modulo $ n $, we determine the dimension of LCD BCH codes for designed distance $ \delta $ in the range $ 2 \le \delta \le{2^{\frac{{m + 1}}{2}}} $. Furthermore, we compute the first five largest coset leaders modulo $ n $ and construct some binary LCD BCH codes. We also present two families of optimal binary linear codes from LCD BCH codes. [ABSTRACT FROM AUTHOR] |
|
Copyright of Advances in Mathematics of Communications is the property of American Institute of Mathematical Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Nájsť tento článok vo Web of Science