Linear Codes From Some 2-Designs
From MaRDI portal
Publication:2977427
DOI10.1109/TIT.2015.2420118zbMATH Open1359.94685arXiv1503.06511OpenAlexW2101226255MaRDI QIDQ2977427FDOQ2977427
Authors: Cunsheng Ding 
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1503.06511
Cited In (only showing first 100 items - show all)
- Several classes of linear codes with few weights over finite fields
- Some two-weight and three-weight linear codes
- Generalized Hamming weights of linear codes from cryptographic functions
- Multi-point codes from the GGS curves
- Two classes of optimal \(p\)-ary few-weight codes from down-sets
- On binary linear codes supporting t-designs
- The subfield codes of hyperoval and conic codes
- Constructions of several classes of linear codes with a few weights
- A geometric characterization of minimal codes and their asymptotic performance
- Four classes of linear codes from cyclotomic cosets
- A note on the minimal binary linear code
- Minimal linear codes from weakly regular bent functions
- Weight enumerators of a class of linear codes
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- Vectorial bent functions and linear codes from quadratic forms
- A construction of several classes of two-weight and three-weight linear codes
- A class of three-weight and five-weight linear codes
- A family of linear codes from constant dimension subspace codes
- 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
- Three-weight ternary linear codes from a family of power functions
- A construction of binary linear codes from Boolean functions
- A class of cyclotomic linear codes and their generalized Hamming weights
- Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\)
- Minimal linear codes over finite fields
- 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
- 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
- Generalized Hamming weights of three classes of linear codes
- A construction of codes with linearity from two linear codes
- Two infinite classes of rotation symmetric bent functions with simple representation
- Complete weight enumerators of a class of linear codes
- Complete weight enumerators of a class of linear codes
- Three-weight ternary linear codes from a family of cyclic difference sets
- Weight distributions and weight hierarchies of two classes of binary linear codes
- Complete weight enumerators of a class of three-weight linear codes
- Two classes of linear codes and their weight distributions
- The subfield codes of several classes of linear codes
- Three-weight cyclic codes and their weight distributions
- A class of two or three weights linear codes and their complete weight enumerators
- Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums
- Complete weight enumerators of a new class of linear codes
- Construction of minimal linear codes with few weights from weakly regular plateaued functions
- Complete weight enumerators of some classes of linear codes with a few weights
- Complete weight enumerators of a class of linear codes over finite fields
- Complete weight enumerators of a class of linear codes with two or three weights
- Several infinite families of \(p\)-ary weakly regular bent functions
- Complete weight enumerators of a class of linear codes with two weights
- Designs from subcode supports of linear codes
- 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
- Complete weight enumerators of a family of three-weight linear codes
- A construction of linear codes and their complete weight enumerators
- Two classes of two-weight linear codes
- Complete weight enumerator for a class of linear codes from defining sets and their applications
- A kind of three-weight linear codes
- Several classes of linear codes and their weight distributions
- Linear codes with few weights from inhomogeneous quadratic functions
- On the weight distribution of some minimal codes
- Linear codes from quadratic forms
- 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
- The extended codes of projective two-weight codes
- More constructions of 3-weight linear codes
- Projective binary linear codes from special Boolean functions
- Two new classes of projective two-weight linear codes
- 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
- Binary and ternary leading-systematic LCD codes from special functions
- Several classes of \(p\)-ary linear codes with few weights
- Strong blocking sets and minimal codes from expander graphs
- A link between combinatorial designs and three-weight linear codes
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Cyclotomic trace codes
- Boolean functions with six-valued Walsh spectra and their application
- New infinite families of near MDS codes holding \(t\)-designs
- 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
- A survey on the applications of Niho exponents
- Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
- Minimal linear codes from Maiorana-McFarland functions
- Minimal linear codes from weakly regular plateaued balanced functions
- Constructions of linear codes with two or three weights from vectorial dual-bent functions
- 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\)
- Minimal linear codes constructed from functions
- Optimal quinary negacyclic codes with minimum distance four
- 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
- New dimension-independent upper bounds on linear insdel 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)
