A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
From MaRDI portal
Publication:1171042
DOI10.1016/0097-3165(82)90014-0zbMath0497.94011OpenAlexW2002343488MaRDI QIDQ1171042
Publication date: 1982
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(82)90014-0
Related Items (10)
Sum-rank product codes and bounds on the minimum distance ⋮ Rank error-correcting pairs ⋮ A symmetric Roos bound for linear codes ⋮ Monomial codes seen as invariant subspaces ⋮ Four infinite families of ternary cyclic codes with a square-root-like lower bound ⋮ A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes ⋮ On some bounds on the minimum distance of cyclic codes over finite fields ⋮ Roos bound for skew cyclic codes in Hamming and rank metric ⋮ Constacyclic codes as invariant subspaces ⋮ New bounds on the minimum distance of cyclic codes
Cites Work
This page was built for publication: A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
