On binary cyclic codes with minimum distance \(d=3\).
From MaRDI portal
Publication:1130096
zbMath1038.94562MaRDI QIDQ1130096
Pascale Charpin, Victor A. Zinoviev, Aimo Tietäväinen
Publication date: 19 August 1998
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items
On the minimum distance of negacyclic codes with two zeros, On classical Kloosterman sums, On the covering radius of some binary cyclic codes, Algebraic quantum synchronizable codes, Optimal \(p\)-ary cyclic codes with two zeros, On three weights in cyclic codes with two zeros., A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes, Irreducible trinomials over finite fields, Kloosterman sum identities and low-weight codewords in a cyclic code with two zeros, On 3-to-1 and Power APN S-Boxes, On differential uniformity and nonlinearity of functions
