Several Families of Binary Minimal Linear Codes From Two-to-One Functions
From MaRDI portal
Cited in
(19)- Infinite families of minimal binary codes via Krawtchouk polynomials
- Few-weight linear codes over \(\mathbb{F}_p\) from \(t\)-to-one mappings
- Two classes of exceptional \(m\)-to-1 rational functions
- New constructions of 2-to-1 mappings over \(\mathbb{F}_{2^n}\) and their applications to binary linear codes
- Constructions of binary quantum CSS-T codes from some special functions
- Minimal linear codes from vectorial functions
- Optimal CIS codes, optimal t-CIS codes and their applications in cryptography
- Complete classification of 3-to-1 quadrinomials of the form \(x^3(x^{3q-3} + bx^{2q-2} + cx^{q-1} + d)\in\mathbb{F}_q[x]\) on \(\mathbb{F}_{q^2}^\ast\)
- Several classes of wide minimal binary linear codes based on general Maiorana-McFarland class
- Obtaining new classes of optimal linear codes by puncturing and shortening optimal cyclic codes
- Several classes of linear codes with few weights derived from Weil sums
- Parametric construction approach of balanced Boolean functions from two-to-one mappings
- Complete weight enumerators and weight hierarchies of two classes of linear codes
- Exceptional 2-to-1 rational functions
- The classifications of o-monomials and of 2-to-1 binomials are equivalent
- Construction of minimal binary linear codes with dimension n+3
- Several classes of linear codes with AMDS duals and their subfield codes
- Constructing infinite families of cyclic codes utilizing cryptographic functions over finite fields
- Constructions of binary self-orthogonal singly-even wide minimal linear codes with few weights
This page was built for publication: Several Families of Binary Minimal Linear Codes From Two-to-One Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197496)
