Back to Search
Start Over
The q-Ary Antiprimitive BCH Codes
- Source :
- IEEE Transactions on Information Theory. 68:1683-1695
- Publication Year :
- 2022
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 2022.
-
Abstract
- 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.
- Subjects :
- 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
Subjects
Details
- ISSN :
- 15579654 and 00189448
- Volume :
- 68
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Information Theory
- Accession number :
- edsair.doi...........a94697dcf862dfb71aea91db3b609718