Generalizations of the BCH bound

Cited In (24)

A symmetric Roos bound for linear codes
Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
Sum-rank product codes and bounds on the minimum distance
On some bounds on the minimum distance of cyclic codes over finite fields
Rank error-correcting pairs
On the triple-error-correcting cyclic codes with zero set \(\{1, 2^i+1, 2^j+ 1\}\)
Linear codes invariant under cyclic endomorphisms
A note on cyclic codes from APN functions
New bounds on the minimum distance of cyclic codes
Algebraic theory of block codes detecting independent errors
Some properties of skew codes over finite fields
Four infinite families of ternary cyclic codes with a square-root-like lower bound
Another generalisation of the binary Reed-Muller codes and its applications
Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
Coding and bounds for partially defective memory cells
A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
BCH cyclic codes
Cyclic codes from cyclotomic sequences of order four
A survey of constructive coding theory, and a table of binary codes of highest known rate
Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
Roos bound for skew cyclic codes in Hamming and rank metric
Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
On the roots and minimum rank distance of skew cyclic codes
A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound

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)