Several classes of linear codes with few weights over finite fields
From MaRDI portal
Publication:6063257
DOI10.1016/j.ffa.2023.102304MaRDI QIDQ6063257
Sihem Mesnager, Yucong He, Nian Li, Lisha Wang, Xiangyong Zeng
Publication date: 7 November 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cryptography (94A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Linear codes with two or three weights from quadratic bent functions
- How to build robust shared control systems
- Optimal non-projective linear codes constructed from down-sets
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- A coding theory construction of new systematic authentication codes
- Constant composition codes as subcodes of linear codes
- A construction of \(p\)-ary linear codes with two or three weights
- A class of linear codes and their complete weight enumerators
- Complete weight enumerators of a class of linear codes over finite fields
- Recent results and problems on constructions of linear codes from cryptographic functions
- A new construction of two-, three- and few-weight codes via our GU codes and their applications
- A class of linear codes with their complete weight enumerators over finite fields
- Minimal linear codes from weakly regular plateaued balanced functions
- Several classes of linear codes with few weights from the closed butterfly structure
- A construction of linear codes and their complete weight enumerators
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Linear Codes From Some 2-Designs
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Cyclotomic Linear Codes of Order $3$
- A Generic Construction of Cartesian Authentication Codes
- The Geometry of Two-Weight Codes
- Fundamentals of Error-Correcting Codes
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- Two or Three Weight Linear Codes From Non-Weakly Regular Bent Functions
- Quaternary Linear Codes and Related Binary Subfield Codes
- A Subfield-Based Construction of Optimal Linear Codes Over Finite Fields
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- Minimal Linear Codes From Characteristic Functions
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- A Bound for Error-Correcting Codes
- Complete weight enumerators of two classes of linear codes
- Complete weight enumerators of a class of linear codes
This page was built for publication: Several classes of linear codes with few weights over finite fields