Generalizations of the BCH bound
From MaRDI portal
Cited in
(33)- Algebraic theory of block codes detecting independent errors
- A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
- Another generalisation of the binary Reed-Muller codes and its applications
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
- Roos bound for skew cyclic codes in Hamming and rank metric
- New bounds on the minimum distance of cyclic codes
- Sum-rank product codes and bounds on the minimum distance
- Rank error-correcting pairs
- Some properties of skew codes over finite fields
- Cyclic codes from cyclotomic sequences of order four
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
- A survey of constructive coding theory, and a table of binary codes of highest known rate
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
- On the triple-error-correcting cyclic codes with zero set \(\{1, 2^i+1, 2^j+ 1\}\)
- On some bounds on the minimum distance of cyclic codes over finite fields
- On the roots and minimum rank distance of skew cyclic codes
- Four infinite families of ternary cyclic codes with a square-root-like lower bound
- Coding and bounds for partially defective memory cells
- Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
- BCH cyclic codes
- Linear codes invariant under cyclic endomorphisms
- A class of affine-invariant codes and their related codes
- Binary cyclic codes from permutation polynomials over \(\mathbb{F}_{2^m}\)
- Some bounds on the cardinality of the b-symbol weight spectrum of codes
- Decoding up to Hartmann-Tzeng and Roos bounds for rank codes
- Additive twisted codes: new distance bounds and infinite families of quantum codes
- Linear codes invariant under a linear endomorphism
- New results of binary cyclic codes from sparse polynomials over \(\mathbb{F}_{2^n}\)
- Constructing infinite families of cyclic codes utilizing cryptographic functions over finite fields
- Infinite families of \(\mathrm{t}\)-error-correcting binary cyclic codes from sparse polynomials over \(\mathbb{F}_{2^n}\)
- A note on cyclic codes from APN functions
- A symmetric Roos bound for linear codes
This page was built for publication: Generalizations of the BCH bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652536)
