Infinite families of t-error-correcting binary cyclic codes from sparse polynomials over F₂^n
From MaRDI portal
Publication:7363331
Cites work
- A note on cyclic codes from APN functions
- A sequence construction of cyclic codes over finite fields
- A simple stream cipher with proven properties
- Algebraic function fields and codes
- Binary \([n,(n \pm 1)/2]\) cyclic codes with good minimum distances from sequences
- Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
- Binary cyclic codes from permutation polynomials over \(\mathbb{F}_{2^m}\)
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Complex sequences over GF(p/sup M/) with a two-level autocorrelation function and a large linear span
- Cyclic codes from low differentially uniform functions
- Cyclic codes from some monomials and trinomials
- Fundamentals of Error-Correcting Codes
- Further results on permutation trinomials over finite fields with even characteristic
- Generalizations of the BCH bound
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- New classes of permutation trinomials of \(\mathbb{F}_{2^{2m}}\)
- New permutation trinomials constructed from fractional polynomials
- New results of binary cyclic codes from sparse polynomials over \(\mathbb{F}_{2^n}\)
- Number of Points of Varieties in Finite Fields
- On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code
- On the triple-error-correcting cyclic codes with zero set \(\{1, 2^i+1, 2^j+ 1\}\)
- Permutation polynomials and applications to coding theory
- Several classes of complete permutation polynomials
- Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
- Some cyclic codes from some monomials
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
This page was built for publication: Infinite families of \(\mathrm{t}\)-error-correcting binary cyclic codes from sparse polynomials over \(\mathbb{F}_{2^n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363331)
