Two-weight or three-weight binary linear codes from cyclotomic mappings
From MaRDI portal
Publication:2101179
DOI10.1016/J.FFA.2022.102114OpenAlexW4307815954MaRDI QIDQ2101179
Yuhua Sun, Lan Wang, Jianying Fang, Qiang Wang
Publication date: 28 November 2022
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2022.102114
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Linear codes with two or three weights from quadratic bent functions
- A class of linear codes with a few weights
- A kind of three-weight linear codes
- Complete solving of explicit evaluation of Gauss sums in the index 2 case
- Explicit evaluation of some exponential sums
- How to build robust shared control systems
- On some classes of codes with a few weights
- Hamming weights in irreducible cyclic codes
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Recent results and problems on constructions of linear codes from cryptographic functions
- A class of three-weight cyclic codes
- Three classes of linear codes with two or three weights
- 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
- Secret sharing schemes from three classes of linear codes
- Cyclotomic Linear Codes of Order $3$
- A Generic Construction of Cartesian Authentication Codes
- The Geometry of Two-Weight Codes
- Fundamentals of Error-Correcting Codes
- A note on evaluations of some exponential sums
- Cyclotomic Mapping Permutation Polynomials over Finite Fields
This page was built for publication: Two-weight or three-weight binary linear codes from cyclotomic mappings
