Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic
From MaRDI portal
Cited in
(27)- More constructions of 3-weight linear codes
- Complete weight enumerators of few-weight linear codes
- Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- Several classes of minimal linear codes from weakly regular and non-weakly regular bent functions
- Several new classes of p-ary weakly regular plateaued functions and minimal codes with several weights
- Linear codes from defining sets over \(\mathbb{F}_p + u\mathbb{F}_p\) and their applications
- Minimal linear codes from weakly regular bent functions
- Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
- Minimal linear codes constructed from partial spreads
- Regular dessins uniquely determined by a nilpotent automorphism group
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- Minimal linear codes derived from weakly regular bent and plateaued functions
- Construction of minimal binary linear codes with dimension n+3
- Minimal linear codes from Maiorana-McFarland functions
- Several classes of minimal linear codes from vectorial Boolean functions and p-ary functions
- Minimal binary linear codes: a general framework based on bent concatenation
- Minimal linear codes constructed from functions
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
- Four classes of wide minimal q-ary linear codes from a general method
- The parameters of minimal linear codes
- Minimal codes derived from plateaued functions over \(\mathbb{F}_5\)
- Minimal linear codes from vectorial functions
- Minimal linear codes constructed from hierarchical posets with two levels
- Complete weight enumerators of quasi-2-dimensional cyclic codes
- Two new families of linear codes with five Lee-weights over \(\mathbb{F}_q + u \mathbb{F}_q\) and their Gray images
- Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings
- Infinite families of minimal binary codes via Krawtchouk polynomials
This page was built for publication: Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211491)