Long binary narrow-sense BCH codes are normal
From MaRDI portal
Recommendations
Cites work
- An asymptotic bound on the covering radii of binary BCH codes
- Covering bounds for codes
- Covering machines
- Covering radius for long BCH codes
- Equations over finite fields. An elementary approach
- Further results on the covering radius of codes
- scientific article; zbMATH DE number 429512 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284426 (Why is no real title available?)
- La conjecture de Weil. I
- Lower bounds for binary covering codes
- Modified bounds for covering codes
- Number of Points of Varieties in Finite Fields
- On \((p,1)\)-subnormal \(q\)-ary covering codes
- On Some Exponential Sums
- On the covering radius of codes
- On the covering radius of cyclic linear codes and arithmetic codes
- On the covering radius of long binary BCH codes
Cited in
(3)
This page was built for publication: Long binary narrow-sense BCH codes are normal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352424)