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)- 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
- Three-weight ternary linear codes from a family of power functions
- Optimal quinary negacyclic codes with minimum distance four
- A class of cyclotomic linear codes and their generalized Hamming weights
- Some classes of LCD codes and self-orthogonal codes over finite fields
- Few-weight quaternary codes via simplicial complexes
- A construction of \(p\)-ary linear codes with two or three weights
- Minimal linear codes over finite fields
- 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
- Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\)
- Three classes of linear codes with two or three weights
- Few-weight codes over \(\mathbb{F}_p + u \mathbb{F}_p\) associated with down sets and their distance optimal Gray image
- New classes of binary few weight codes from trace codes over a chain ring
- New dimension-independent upper bounds on linear insdel codes
- Several classes of new projective three-weight or four-weight linear codes and their applications in \(s\)-sum sets
- Quantum codes from trace codes
- A construction of codes with linearity from two linear codes
- Generalized Hamming weights of three classes of linear codes
- Complete weight enumerators of a class of two-weight linear codes
- Three families of self-orthogonal codes and their application in optimal quantum codes
- Two classes of few-Lee weight \(\mathbb{Z}_2 [u]\)-linear codes using simplicial complexes and minimal codes via Gray map
- Difference sets and three-weight linear codes from trinomials
- Two infinite classes of rotation symmetric bent functions with simple representation
- Some subfield codes from MDS codes
- Three-weight minimal linear codes
- LCD codes and almost optimally extendable codes from self-orthogonal codes
- Complete weight enumerators of a class of linear codes
- Complete weight enumerators of a class of linear codes
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- Three combinatorial perspectives on minimal codes
- A class of subfield codes of linear codes and their duals
- Combinatorial \(t\)-designs from special functions
- Recent results and problems on constructions of linear codes from cryptographic functions
- Two families of subfield codes with a few weights
- A family of projective two-weight linear codes
- Binary linear codes with few weights from Boolean functions
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Weight hierarchies of a family of linear codes associated with degenerate quadratic forms
- Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD codes
- Three-weight ternary linear codes from a family of cyclic difference sets
- The punctured codes of two classes of cyclic codes with few weights
- Weight distributions and weight hierarchies of two classes of binary linear codes
- Graphs of vectorial plateaued functions as difference sets
- Complete weight enumerators of a class of three-weight linear codes
- Constructions of symplectic LCD MDS codes
- Two classes of linear codes and their weight distributions
- Few-weight linear codes over \(\mathbb{F}_p\) from \(t\)-to-one mappings
- Linear codes with few weights over finite fields
- Combinatorial \(t\)-designs and strongly regular graphs from projective codes over finite fields
- The subfield codes of several classes of linear codes
- Constructions of projective linear codes by the intersection and difference of sets
- The parameters of minimal linear codes
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)
