Five families of the narrow-sense primitive BCH codes over finite fields
From MaRDI portal
Publication:2243889
DOI10.1007/s10623-021-00942-zzbMath1481.94156OpenAlexW3203404927MaRDI QIDQ2243889
Xiaoshan Kai, Binbin Pang, Shixin Zhu
Publication date: 11 November 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00942-z
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some new results on dimension and Bose distance for various classes of BCH codes
- The dimension and minimum distance of two classes of primitive BCH codes
- Dimensions of three types of BCH codes over \(\mathrm{GF}(q)\)
- Parameters of Several Classes of BCH Codes
- The Bose and Minimum Distance of a Class of BCH Codes
- On a class of error correcting binary group codes
- Fundamentals of Error-Correcting Codes
- On the number of information symbols in Bose-Chaudhuri codes
- Studying the locator polynomials of minimum weight codewords of BCH codes
- Idempotents and the BCH bound
- Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not
- Narrow-Sense BCH Codes Over $ {\mathrm {GF}}(q)$ With Length $n=\frac {q^{m}-1}{q-1}$
- The Minimum Distance of Some Narrow-Sense Primitive BCH Codes
- BCH Codes with Minimum Distance Proportional to Code Length
- On Two Classes of Primitive BCH Codes and Some Related Codes
- A Class of Narrow-Sense BCH Codes
- Some results on the minimum weight of primitive BCH codes (Corresp.)
This page was built for publication: Five families of the narrow-sense primitive BCH codes over finite fields