Linear codes from a generic construction
From MaRDI portal
Abstract: A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach. The first objective of this paper is to establish relationships among some classes of linear codes obtained with this approach, so that the parameters of some classes of linear codes can be derived from those of other classes with known parameters. In this way, linear codes with new parameters will be derived. The second is to present a class of three-weight binary codes and consider their applications in secret sharing.
Recommendations
- Construction of a class of linear codes
- scientific article; zbMATH DE number 3882337
- Publication:4945067
- A construction of codes with linearity from two linear codes
- scientific article; zbMATH DE number 5054194
- Construction of linear covering codes
- scientific article; zbMATH DE number 2154148
- scientific article; zbMATH DE number 1714649
- A generalized extension theorem for linear codes
- scientific article; zbMATH DE number 1227010
Cites work
- A Class of Three-Weight and Four-Weight Codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A coding theory construction of new systematic authentication codes
- Almost asymptotic regulation of Markovian jumping linear systems in discrete time
- Cyclotomic Linear Codes of Order 3
- Explicit evaluation of certain exponential sums.
- Fundamentals of Error-Correcting Codes
- How to build robust shared control systems
- scientific article; zbMATH DE number 3135133 (Why is no real title available?)
- scientific article; zbMATH DE number 3871188 (Why is no real title available?)
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 1553591 (Why is no real title available?)
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear Codes From Some 2-Designs
- Secret sharing schemes from three classes of linear codes
- The Geometry of Two-Weight Codes
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
Cited in
(26)- A family of nonbinary linear codes
- Two classes of linear codes and their weight distributions
- Complete weight enumerators of a class of linear codes with two weights
- Four classes of linear codes from cyclotomic cosets
- More constructions of 3-weight linear codes
- A family of linear codes from constant dimension subspace codes
- Minimal linear codes from weakly regular bent functions
- Minimal linear codes constructed from functions
- Minimal linear codes from Maiorana-McFarland functions
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- A construction of q-ary linear codes with irreducible cyclic codes
- Construction of linear covering codes
- The parameters of minimal linear codes
- A Relation Between the Characteristic Generators of a Linear Code and its Dual
- scientific article; zbMATH DE number 2154157 (Why is no real title available?)
- scientific article; zbMATH DE number 1424164 (Why is no real title available?)
- A class of linear codes with a few weights
- A class of minimum linear codes and their applications
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- scientific article; zbMATH DE number 5054194 (Why is no real title available?)
- Linear codes with few weights over finite fields
- Minimal linear codes constructed from hierarchical posets with two levels
- Several classes of linear codes and their weight distributions
- Optimal few-weight codes from projective spaces
- Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings
- Dual and Hull code in the first two generic constructions and relationship with the Walsh transform of cryptographic functions
This page was built for publication: Linear codes from a generic construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301633)
