A construction of linear codes and strongly regular graphs from \(q\)-polynomials
From MaRDI portal
Publication:2359969
DOI10.1016/j.disc.2017.04.016zbMath1365.05302OpenAlexW2614176506MaRDI QIDQ2359969
Publication date: 23 June 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.04.016
Related Items (4)
Estimations on some hybrid exponential sums related to Kloosterman sums ⋮ Constructing few-weight linear codes and strongly regular graphs ⋮ Two new classes of projective two-weight linear codes ⋮ Linear codes with few weights from weakly regular plateaued functions
Cites Work
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Linear codes from a generic construction
- Linear codes with two or three weights from quadratic bent functions
- A construction of codes with linearity from two linear codes
- A class of three-weight linear codes and their complete weight enumerators
- Complete weight enumerators of a family of three-weight linear codes
- The weight distribution of a class of \(p\)-ary cyclic codes
- A note on linear permutation polynomials
- How to build robust shared control systems
- A coding theory construction of new systematic authentication codes
- 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
- Hamming Weights of the Duals of Cyclic Codes With Two Zeros
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- The Geometry of Two-Weight Codes
- Fundamentals of Error-Correcting Codes
This page was built for publication: A construction of linear codes and strongly regular graphs from \(q\)-polynomials