On binary cyclic codes with minimum distance d=3.
From MaRDI portal
On binary cyclic codes with minimum distance \(d=3\).
Recommendations
Cited in
(26)- On the minimum distance of negacyclic codes with two zeros
- scientific article; zbMATH DE number 2154140 (Why is no real title available?)
- Kloosterman sum identities and low-weight codewords in a cyclic code with two zeros
- scientific article; zbMATH DE number 493082 (Why is no real title available?)
- On differential uniformity and nonlinearity of functions
- Some results on the minimum distance structure of cyclic codes
- On the minimum distance of ternary cyclic codes
- A note on binary cyclic codes of blocklength 63
- Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
- On 3-to-1 and Power APN S-Boxes
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
- scientific article; zbMATH DE number 1285452 (Why is no real title available?)
- Optimal \(p\)-ary cyclic codes with two zeros
- Maximal arcs in projective three-spaces and double-error-correcting cyclic codes
- On the minimum distances of non-binary cyclic codes
- Equidistant binary arithmetic codes (Corresp.)
- On the triple-error-correcting cyclic codes with zero set \(\{1, 2^i+1, 2^j+ 1\}\)
- On a (145, 32) binary cyclic code
- scientific article; zbMATH DE number 3487346 (Why is no real title available?)
- On the covering radius of some binary cyclic codes
- Algebraic quantum synchronizable codes
- On classical Kloosterman sums
- On a sequence of cyclic codes with minimum distance six
- Several families of binary cyclic codes with good parameters
- On three weights in cyclic codes with two zeros.
- Irreducible trinomials over finite fields
This page was built for publication: On binary cyclic codes with minimum distance \(d=3\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130096)
