Infinite families of minimal binary codes via Krawtchouk polynomials
From MaRDI portal
Publication:6544459
DOI10.1007/S10623-023-01353-YWikidataQ129604663 ScholiaQ129604663MaRDI QIDQ6544459FDOQ6544459
Authors: Xiaoni Du, R. S. Rodriguez, Hao Wu 
Publication date: 27 May 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
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
Boolean functionsMaiorana-McFarland classKrawtchouck polynomialsAshikhmin-Barg's boundminimal binary linear codes
Cites Work
- On minimal and quasi-minimal linear codes
- Title not available (Why is that?)
- Minimal vectors in linear codes
- A class of three-weight cyclic codes
- The weight enumerators of several classes of \(p\)-ary cyclic codes
- Minimal linear codes over finite fields
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- Minimal linear codes from weakly regular bent functions
- Linear codes from simplicial complexes
- Minimal Binary Linear Codes
- Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic
- Minimal linear codes arising from blocking sets
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Minimal Linear Codes From Characteristic Functions
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- Minimal linear codes from Maiorana-McFarland functions
- Minimal binary linear codes: a general framework based on bent concatenation
- Minimal linear codes constructed from functions
- Several Families of Binary Minimal Linear Codes From Two-to-One Functions
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)
