A class of BCH codes of length $ n = \frac{q^m-1}{4} $
- 1 January 2025
- journal article
- research article
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (3) , 903-921
Abstract
Cyclic codes have been widely used in communication systems and data transmission due to their efficient encoding and decoding algorithms. In particular, BCH codes are a significant class of cyclic codes. This paper mainly studies a class of narrow-sense BCH codes with length $ n = \frac{q^m-1}{4} $ and privodes their parameters. Specifically, we determine the first few largest coset leaders and the weight distributions of some BCH codes. Finally, we obtain some linear codes with good parameters.
Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- BCH cyclic codesDiscrete Mathematics, 2024
- Parameters of two classes of negacyclic BCH codesJournal of Applied Mathematics and Computing, 2023
- A family of cyclic codes with two zerosJournal of Applied Mathematics and Computing, 2023
- On some cyclic codes of lengthFinite Fields and Their Applications, 2019
- A q-polynomial approach to constacyclic codesFinite Fields and Their Applications, 2017
- Dimensions of three types of BCH codes overDiscrete Mathematics, 2017
- The dimension and minimum distance of two classes of primitive BCH codesFinite Fields and Their Applications, 2017
- The Bose and Minimum Distance of a Class of BCH CodesIEEE Transactions on Information Theory, 2015
- Hamming weights in irreducible cyclic codesDiscrete Mathematics, 2013
- On Quantum and Classical BCH CodesIEEE Transactions on Information Theory, 2007