On the minimum distances of non-binary cyclic codes
From MaRDI portal
Publication:1963168
DOI10.1023/A:1008354504832zbMath0941.94020OpenAlexW1523747139MaRDI QIDQ1963168
Pascale Charpin, Aimo Tietäväinen, Victor A. Zinoviev
Publication date: 24 January 2000
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008354504832
Related Items (6)
On the minimum distance of negacyclic codes with two zeros ⋮ Optimal \(p\)-ary cyclic codes with two zeros ⋮ A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes ⋮ On bases of BCH codes with designed distance 3 and their extensions ⋮ Irreducible trinomials over finite fields ⋮ Counting irreducible polynomials over GF(3) with first and third coefficients given
This page was built for publication: On the minimum distances of non-binary cyclic codes
