A construction of linear codes and strongly regular graphs from q-polynomials
From MaRDI portal
Publication:2359969
Recommendations
- Constructing few-weight linear codes and strongly regular graphs
- scientific article; zbMATH DE number 4104861
- A q-polynomial approach to constacyclic codes
- Some optimal codes and strongly regular graphs from the linear group L₄(3)
- A construction of q-ary linear codes with irreducible cyclic codes
- The graphs of non-degenerate linear codes
- On the Grassmann graph of linear codes
- Counting polynomials for linear codes, hyperplane arrangements, and matroids
- Constructing quasi-cyclic codes from linear algebra theory
- Linear codes with complementary duals from some strongly regular subgraphs of the McLaughlin graph
Cites work
- A class of three-weight linear codes and their complete weight enumerators
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A coding theory construction of new systematic authentication codes
- A construction of binary linear codes from Boolean functions
- A construction of codes with linearity from two linear codes
- A note on linear permutation polynomials
- Complete weight enumerators of a family of three-weight linear codes
- Fundamentals of Error-Correcting Codes
- Hamming Weights of the Duals of Cyclic Codes With Two Zeros
- How to build robust shared control systems
- scientific article; zbMATH DE number 3871188 (Why is no real title available?)
- Linear codes from a generic construction
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear codes with two or three weights from quadratic bent functions
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- The Geometry of Two-Weight Codes
- The weight distribution of a class of p-ary cyclic codes
Cited in
(9)- A family of projective two-weight linear codes
- Linear codes with few weights from weakly regular plateaued functions
- Some new two-weight codes and strongly regular graphs
- Constructing few-weight linear codes and strongly regular graphs
- On strongly walk regular graphs, triple sum sets and their codes
- Two new classes of projective two-weight linear codes
- Estimations on some hybrid exponential sums related to Kloosterman sums
- Combinatorial t-designs and strongly regular graphs from projective codes over finite fields
- Several classes of three-weight or four-weight linear codes
This page was built for publication: A construction of linear codes and strongly regular graphs from \(q\)-polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359969)