Minimal linear codes derived from weakly regular bent and plateaued functions
From MaRDI portal
Publication:6580114
DOI10.1142/S021949882550077XMaRDI QIDQ6580114
Publication date: 29 July 2024
Published in: Journal of Algebra and its Applications (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Exponential sums (11T23) Boolean functions (94D10)
Cites Work
- Title not available (Why is that?)
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Linear codes from simplicial complexes
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Minimal linear codes over finite fields
- Minimal linear codes from weakly regular bent functions
- Minimal binary linear codes: a general framework based on bent concatenation
- Minimal linear codes from Maiorana-McFarland functions
- Minimal linear codes from weakly regular plateaued balanced functions
- Explicit Criteria for Construction of Plateaued Functions
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Minimal Binary Linear Codes
- Minimal vectors in linear codes
- Three Combinatorial Perspectives on Minimal Codes
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- Minimal Linear Codes From Characteristic Functions
- Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic
- Minimal Linear Codes in Odd Characteristic
This page was built for publication: Minimal linear codes derived from weakly regular bent and plateaued functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580114)
