A class of linear codes with their complete weight enumerators over finite fields
From MaRDI portal
Publication:2121001
DOI10.1007/s12095-021-00496-wzbMath1505.94098OpenAlexW3167623445MaRDI QIDQ2121001
Publication date: 1 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00496-w
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (2)
Several classes of linear codes with few weights over finite fields ⋮ Quantum codes from trace codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complete weight enumerators of some linear codes and their applications
- A class of three-weight linear codes and their complete weight enumerators
- Complete weight enumerators of a family of three-weight linear codes
- A construction of optimal constant composition codes
- Complete weight enumerators of a new class of linear codes
- A coding theory construction of new systematic authentication codes
- A construction of linear codes and their complete weight enumerators
- A class of three-weight and five-weight linear codes
- On constant composition codes
- Two classes of two-weight linear codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- On constant-composition codes over Z/sub q/
- A Generic Construction of Cartesian Authentication Codes
- Optimal Constant Composition Codes From Zero-Difference Balanced Functions
- A Bound for Error-Correcting Codes
- Complete weight enumerators of two classes of linear codes
- Coding and Cryptography
- Complete weight enumerators of a class of linear codes
This page was built for publication: A class of linear codes with their complete weight enumerators over finite fields
