A new lower bound for the minimum distance of a cyclic code
From MaRDI portal
Publication:3671045
DOI10.1109/TIT.1983.1056672zbMath0519.94010MaRDI QIDQ3671045
Publication date: 1983
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
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, A commutative algebra approach to linear codes, On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1}, Power error locating pairs, Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)