The q-Ary Antiprimitive BCH Codes
| Autor: | Hongwei Zhu, Tor Helleseth, Xiaoqiang Wang, Minjia Shi |
|---|---|
| Rok vydání: | 2022 |
| Předmět: |
Discrete mathematics
Computer science Minimum distance Data_CODINGANDINFORMATIONTHEORY Library and Information Sciences Type (model theory) Computer Science Applications Finite field Computer Science::Discrete Mathematics Encoding (memory) Decoding methods BCH code Computer Science::Information Theory Information Systems |
| Zdroj: | IEEE Transactions on Information Theory. 68:1683-1695 |
| ISSN: | 1557-9654 0018-9448 |
| Popis: | It is well-known that cyclic codes have efficient encoding and decoding algorithms. In recent years, antiprimitive BCH codes have attracted a lot of attention. The objective of this paper is to study BCH codes of this type over finite fields and analyse their parameters. Some lower bounds on the minimum distance of antiprimitive BCH codes are given. The BCH codes presented in this paper have good parameters in general, containing many optimal linear codes. In particular, two open problems about the minimum distance of BCH codes of this type are partially solved in this paper. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|