The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
From MaRDI portal
Publication:1696137
DOI10.1007/S12095-017-0221-1zbMath1412.94236OpenAlexW2599578366MaRDI QIDQ1696137
Tor Helleseth, Zhengchun Zhou, Pan Tan, Deng Tang
Publication date: 14 February 2018
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-017-0221-1
Linear codes (general theory) (94B05) Exponential sums (11T23) Authentication, digital signatures and secret sharing (94A62)
Related Items (6)
Complete weight enumerators of three classes of linear codes ⋮ Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums ⋮ Two new classes of projective two-weight linear codes ⋮ A class of two or three weights linear codes and their complete weight enumerators ⋮ Binary linear codes with few weights from Boolean functions ⋮ New linear codes with few weights derived from Kloosterman sums
Cites Work
- How to build robust shared control systems
- A coding theory construction of new systematic authentication codes
- 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 Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Monomial and quadratic bent functions over the finite fields of odd characteristic
- Monomial bent functions
- Secret sharing schemes from three classes of linear codes
- A Generic Construction of Cartesian Authentication Codes
- Fundamentals of Error-Correcting Codes
- Kloosterman sums and finite field extensions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
