Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums
From MaRDI portal
Publication:6159448
DOI10.1007/s12095-022-00604-4zbMath1526.94059WikidataQ114849070 ScholiaQ114849070MaRDI QIDQ6159448
Chengju Li, Qin Yue, Xiaoshan Quan, Xia Li
Publication date: 20 June 2023
Published in: Cryptography and Communications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Complete weight enumerators of some linear codes and their applications
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- How to build robust shared control systems
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
- Weight enumerators of reducible cyclic codes and their dual codes
- A coding theory construction of new systematic authentication codes
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- New linear codes with few weights derived from Kloosterman sums
- Two classes of two-weight linear codes
- 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
- Monomial and quadratic bent functions over the finite fields of odd characteristic
- Monomial bent functions
- Cyclotomic Linear Codes of Order $3$
- A Generic Construction of Cartesian Authentication Codes
- Fundamentals of Error-Correcting Codes
- Kloosterman sums and finite field extensions
This page was built for publication: Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums
