Linear Codes From Some 2-Designs
From MaRDI portal
Publication:2977427
Abstract: A classical method of constructing a linear code over with a -design is to use the incidence matrix of the -design as a generator matrix over of the code. This approach has been extensively investigated in the literature. In this paper, a different method of constructing linear codes using specific classes of -designs is studied, and linear codes with a few weights are obtained from almost difference sets, difference sets, and a type of -designs associated to semibent functions. Two families of the codes obtained in this paper are optimal. The linear codes presented in this paper have applications in secret sharing and authentication schemes, in addition to their applications in consumer electronics, communication and data storage systems. A coding-theory approach to the characterisation of highly nonlinear Boolean functions is presented.
Cited in
(only showing first 100 items - show all)- Generic construction of Boolean functions with a few Walsh transform values of any possible algebraic degree
- Three-weight cyclic codes and their weight distributions
- Several classes of linear codes with few weights from the closed butterfly structure
- Constructions of cyclic codes and extended primitive cyclic codes with their applications
- Additive codes with few weights
- A class of two or three weights linear codes and their complete weight enumerators
- Complete weight enumerators of a new class of linear codes
- Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums
- A class of three-weight linear codes over finite fields of odd characteristic
- Minimal linear codes constructed from hierarchical posets with two levels
- The weight distributions of several classes of few-weight linear codes
- Weight distributions and weight hierarchies of a class of binary linear codes with a few weights
- Complete weight enumerators of some classes of linear codes with a few weights
- Construction of minimal linear codes with few weights from weakly regular plateaued functions
- Characterization of \(p\)-ary functions in terms of association schemes and its applications
- Complete weight enumerators of a class of linear codes over finite fields
- Several infinite families of \(p\)-ary weakly regular bent functions
- Complete weight enumerators of a class of linear codes with two weights
- An inductive construction of minimal codes
- Complete weight enumerators of a class of linear codes with two or three weights
- Three-weight and five-weight linear codes over finite fields
- A family of distance-optimal minimal linear codes with flexible parameters
- A class of linear codes with a few weights
- A class of three-weight linear codes and their complete weight enumerators
- Bent functions linear on elements of some classical spreads and presemifields spreads
- Complete weight enumerators of some linear codes from quadratic forms
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Two classes of \(p\)-ary bent functions and linear codes with three or four weights
- Three classes of binary linear codes with good parameters
- Designs from subcode supports of linear codes
- Complete weight enumerators of a family of three-weight linear codes
- A construction of linear codes and their complete weight enumerators
- Further projective binary linear codes derived from two-to-one functions and their duals
- Trace codes over \(\mathbb {Z}_4,\) and Boolean functions
- A kind of three-weight linear codes
- Two classes of two-weight linear codes
- Complete weight enumerator for a class of linear codes from defining sets and their applications
- Connection of \(p\)-ary \(t\)-weight linear codes to Ramanujan Cayley graphs with \(t+1\) eigenvalues
- Optimal binary linear codes from posets of the disjoint union of two chains
- Some shortened codes from linear codes constructed by defining sets
- Several classes of linear codes and their weight distributions
- Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
- Construction of binary self-orthogonal codes
- The cross-correlation spectrum of ternary perfect sequences and their decimations
- Linear codes with few weights from inhomogeneous quadratic functions
- A new lower bound on the second-order nonlinearity of a class of monomial bent functions
- On the weight distribution of some minimal codes
- Several classes of binary linear codes and their weight enumerators
- On generalized hyper-bent functions
- Linear codes from quadratic forms
- Dual transform and projective self-dual codes
- New linear codes with few weights derived from Kloosterman sums
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- More constructions of 3-weight linear codes
- Projective binary linear codes from special Boolean functions
- The extended codes of projective two-weight codes
- Several classes of linear codes with few weights over finite fields
- Two new classes of projective two-weight linear codes
- Some two-weight and three-weight linear codes
- Two classes of optimal p-ary few-weight codes from down-sets
- Multi-point codes from the GGS curves
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- A construction of q-ary linear codes with two weights
- Linear codes from vectorial Boolean power functions
- Generalized Hamming weights of linear codes from cryptographic functions
- The subfield codes of hyperoval and conic codes
- On binary linear codes supporting t-designs
- Binary and ternary leading-systematic LCD codes from special functions
- Constructions of several classes of linear codes with a few weights
- Four classes of linear codes from cyclotomic cosets
- Several classes of \(p\)-ary linear codes with few weights
- A geometric characterization of minimal codes and their asymptotic performance
- A note on the minimal binary linear code
- Strong blocking sets and minimal codes from expander graphs
- A link between combinatorial designs and three-weight linear codes
- Minimal linear codes from weakly regular bent functions
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Weight enumerators of a class of linear codes
- Cyclotomic trace codes
- Boolean functions with six-valued Walsh spectra and their application
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- A construction of several classes of two-weight and three-weight linear codes
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
- New infinite families of near MDS codes holding \(t\)-designs
- A family of linear codes from constant dimension subspace codes
- A class of three-weight and five-weight linear codes
- Vectorial bent functions and linear codes from quadratic forms
- Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
- A survey on the applications of Niho exponents
- Minimal linear codes from Maiorana-McFarland functions
- Minimal linear codes from weakly regular plateaued balanced functions
- Proofs of several conjectures on linear codes from Boolean functions
- On constructions of bent, semi-bent and five valued spectrum functions from old bent functions
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Minimal binary linear codes: a general framework based on bent concatenation
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Constructions of linear codes with two or three weights from vectorial dual-bent functions
- Minimal linear codes constructed from functions
- A construction of binary linear codes from Boolean functions
This page was built for publication: Linear Codes From Some 2-Designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977427)
