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)
94B15: Cyclic codes
Related Items
Four infinite families of ternary cyclic codes with a square-root-like lower bound, On some bounds on the minimum distance of cyclic codes over finite fields, Power error locating pairs, A symmetric Roos bound for linear codes, Constacyclic codes as invariant subspaces, A commutative algebra approach to linear codes, 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, Monomial codes seen as invariant subspaces, A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes, On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1}