Constructing infinite families of cyclic codes utilizing cryptographic functions over finite fields
From MaRDI portal
Cites work
- A generalization of APN functions for odd characteristic
- A note on cyclic codes from APN functions
- A sequence construction of cyclic codes over finite fields
- A simple stream cipher with proven properties
- Bent functions. Fundamentals and results
- 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}\)
- Binary Linear Codes With Few Weights From Two-to-One Functions
- Complex sequences over GF(p/sup M/) with a two-level autocorrelation function and a large linear span
- Cyclic Codes and Sequences From Generalized Coulter–Matthews Function
- Cyclic codes from low differentially uniform functions
- Cyclic codes from some monomials and trinomials
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- Fundamentals of Error-Correcting Codes
- Generalizations of the BCH bound
- Linear codes from functions
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Monomial generalized almost perfect nonlinear functions
- New results of binary cyclic codes from sparse polynomials over \(\mathbb{F}_{2^n}\)
- On decoding BCH codes
- On Self-Dual Cyclic Codes Over Finite Fields
- Permutation polynomials and applications to coding theory
- Several Families of Binary Minimal Linear Codes From Two-to-One Functions
- Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
- Some cyclic codes from some monomials
- Sparse permutations with low differential uniformity
- Symplectic spreads and permutation polynomials
- The weight distribution of a class of p-ary cyclic codes
This page was built for publication: Constructing infinite families of cyclic codes utilizing cryptographic functions over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326034)
