Binary cyclic codes from permutation polynomials over F₂^m
From MaRDI portal
Publication:6918217
Cites work
- \(\alpha\)-flocks and hyperovals
- A note on cyclic codes from APN functions
- A sequence construction of cyclic codes over finite fields
- A simple stream cipher with proven properties
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- 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)\)
- 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
- Generalizations of the BCH bound
- scientific article; zbMATH DE number 1972828 (Why is no real title available?)
- Maximum distance<tex>q</tex>-nary codes
- New classes of permutation binomials and permutation trinomials over finite fields
- On Quantum and Classical BCH Codes
- Permutation trinomials over finite fields with even characteristic
- Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
- Some cyclic codes from some monomials
- The dual-containing primitive BCH codes with the maximum designed distance and their applications to quantum codes
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
Cited in
(3)- New results of binary cyclic codes from sparse polynomials over \(\mathbb{F}_{2^n}\)
- Constructing infinite families of cyclic codes utilizing cryptographic functions over finite fields
- Infinite families of \(\mathrm{t}\)-error-correcting binary cyclic codes from sparse polynomials over \(\mathbb{F}_{2^n}\)
This page was built for publication: Binary cyclic codes from permutation polynomials over \(\mathbb{F}_{2^m}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918217)
