Linear Codes From Some 2-Designs
From MaRDI portal
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)- Designs from subcode supports of linear codes
- Proofs of several conjectures on linear codes from Boolean functions
- A class of cyclotomic linear codes and their generalized Hamming weights
- Two infinite classes of rotation symmetric bent functions with simple representation
- Two classes of linear codes and their weight distributions
- Complete weight enumerators of a class of three-weight linear codes
- Complete weight enumerators of a class of linear codes with two weights
- Some two-weight and three-weight linear codes
- The subfield codes of hyperoval and conic codes
- A link between combinatorial designs and three-weight linear codes
- Four classes of linear codes from cyclotomic cosets
- Complete weight enumerators of a new class of linear codes
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Several infinite families of \(p\)-ary weakly regular bent functions
- Three-weight ternary linear codes from a family of cyclic difference sets
- Minimal linear codes over finite fields
- Projective binary linear codes from special Boolean functions
- More constructions of 3-weight linear codes
- Linear codes from vectorial Boolean power functions
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Cyclotomic trace codes
- Constructions of several classes of linear codes with a few weights
- A class of two or three weights linear codes and their complete weight enumerators
- A construction of p-ary linear codes with two or three weights
- Complete weight enumerators of a class of linear codes over finite fields
- Weight distributions and weight hierarchies of two classes of binary linear codes
- Recent results and problems on constructions of linear codes from cryptographic functions
- Combinatorial \(t\)-designs from special functions
- The subfield codes of several classes of linear codes
- Two families of subfield codes with a few weights
- A class of subfield codes of linear codes and their duals
- A family of projective two-weight linear codes
- Binary linear codes with few weights from Boolean functions
- Constructions of symplectic LCD MDS codes
- Weight hierarchies of a family of linear codes associated with degenerate quadratic forms
- A family of linear codes from constant dimension subspace codes
- Characterization of \(p\)-ary functions in terms of association schemes and its applications
- A geometric characterization of minimal codes and their asymptotic performance
- Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
- Boolean functions with six-valued Walsh spectra and their application
- An inductive construction of minimal 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
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- Minimal linear codes from weakly regular bent functions
- Minimal binary linear codes: a general framework based on bent concatenation
- Few-weight quaternary codes via simplicial complexes
- New classes of binary few weight codes from trace codes over a chain ring
- Three-weight minimal linear codes
- Minimal linear codes constructed from functions
- Constructions of projective linear codes by the intersection and difference of sets
- Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
- Multi-point codes from the GGS curves
- A new lower bound on the second-order nonlinearity of a class of monomial bent functions
- Minimal linear codes from Maiorana-McFarland functions
- Few-weight codes over \(\mathbb{F}_p + u \mathbb{F}_p\) associated with down sets and their distance optimal Gray image
- A note on the minimal binary linear code
- On generalized hyper-bent functions
- A family of distance-optimal minimal linear codes with flexible parameters
- Minimal linear codes from weakly regular plateaued balanced functions
- Several classes of linear codes with few weights from the closed butterfly structure
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- New linear codes with few weights derived from Kloosterman sums
- Complete weight enumerators of a class of two-weight linear codes
- Complete weight enumerators of a class of linear codes with two or three weights
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- Three-weight ternary linear codes from a family of power functions
- Generalized Hamming weights of three classes of linear codes
- A construction of several classes of two-weight and three-weight linear codes
- 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
- A construction of q-ary linear codes with two weights
- A construction of linear codes and their complete weight enumerators
- A class of three-weight and five-weight linear codes
- Some classes of LCD codes and self-orthogonal codes over finite fields
- Trace codes over \(\mathbb {Z}_4,\) and Boolean functions
- Complete weight enumerator for a class of linear codes from defining sets and their applications
- Three classes of linear codes with two or three weights
- Several classes of binary linear codes and their weight enumerators
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- A survey on the applications of Niho exponents
- Two classes of two-weight linear codes
- On the weight distribution of some minimal codes
- Graphs of vectorial plateaued functions as difference sets
- The parameters of minimal linear codes
- Further projective binary linear codes derived from two-to-one functions and their duals
- Two new classes of projective two-weight linear codes
- A construction of binary linear codes from Boolean functions
- Linear codes from a generic construction
- Complete weight enumerators of some linear codes and their applications
- Linear codes with two or three weights from quadratic bent functions
- On binary linear codes supporting t-designs
- Complete weight enumerators of some classes of linear codes with a few weights
- Bent functions linear on elements of some classical spreads and presemifields spreads
- A construction of codes with linearity from two linear codes
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- A class of linear codes with a few weights
- Two classes of p-ary bent functions and linear codes with three or four weights
- A class of three-weight linear codes and their complete weight enumerators
- Complete weight enumerators of some linear codes from quadratic forms
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)
