Infinite families of minimal binary codes via Krawtchouk polynomials
From MaRDI portal
Publication:6544459
Recommendations
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- Minimal linear codes from Maiorana-McFarland functions
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Minimal binary linear codes: a general framework based on bent concatenation
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- A class of three-weight cyclic codes
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- Linear codes from simplicial complexes
- Minimal Binary Linear Codes
- Minimal Linear Codes From Characteristic Functions
- Minimal binary linear codes: a general framework based on bent concatenation
- Minimal linear codes arising from blocking sets
- Minimal linear codes constructed from functions
- Minimal linear codes from Maiorana-McFarland functions
- Minimal linear codes from weakly regular bent functions
- Minimal linear codes over finite fields
- Minimal vectors in linear codes
- On minimal and quasi-minimal linear codes
- Several Families of Binary Minimal Linear Codes From Two-to-One Functions
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- The weight enumerators of several classes of \(p\)-ary cyclic codes
- Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
This page was built for publication: Infinite families of minimal binary codes via Krawtchouk polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544459)
