Linear codes with two or three weights from quadratic bent functions
From MaRDI portal
Publication:306341
DOI10.1007/S10623-015-0144-9zbMATH Open1405.94116arXiv1506.06830OpenAlexW1933802677MaRDI QIDQ306341FDOQ306341
Cui Ling Fan, Nian Li, Zhengchun Zhou, Tor Helleseth
Publication date: 31 August 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Abstract: Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of -ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field , where is an odd prime. They include some earlier linear codes as special cases. The weight distributions of these linear codes are also determined.
Full work available at URL: https://arxiv.org/abs/1506.06830
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Highly nonlinear mappings
- Planes of order \(n\) with collineation groups of order \(n^ 2\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Planar functions and planes of Lenz-Barlotti class II
- A family of skew Hadamard difference sets
- Perfect nonlinear binomials and their semifields
- Secret sharing schemes from three classes of linear codes
- Generalized bent functions and their properties
- On ``bent functions
- A new characterization of semi-bent and bent functions on finite fields
- Monomial and quadratic bent functions over the finite fields of odd characteristic
- Cross-correlations of quadratic form sequences in odd characteristic
- Title not available (Why is that?)
- A coding theory construction of new systematic authentication codes
- Linear Codes From Some 2-Designs
- Codes projectifs à deux ou trois poids associes aux hyperquadriques d'une géométrie finie
- Cross-correlations of geometric sequences in characteristic two
- The weight hierarchies of the projective codes from nondegenerate quadrics
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- New Constructions of Quadratic Bent Functions in Polynomial Form
- Prime-phase sequences with periodic correlation properties better than binary sequences
- New Family of<tex>$p$</tex>-ary Sequences With Optimal Correlation Property and Large Linear Span
- A New Family of Nonbinary Sequences With Three-Level Correlation Property and Large Linear Span
- Nonbinary Kasami sequences over GF(p)
- New nonbinary sequences with ideal two-level autocorrelation
- Some new results for ternary linear codes of dimension 5 and 6
Cited In (89)
- Several classes of linear codes with few weights over finite fields
- More constructions of 3-weight linear codes
- Projective binary linear codes from special Boolean functions
- Some two-weight and three-weight linear codes
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- A construction of \(q\)-ary linear codes with two weights
- Linear codes from vectorial Boolean power functions
- Binary Linear Codes with Near-Extremal Maximum Distance
- 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
- Vectorial bent functions and linear codes from quadratic forms
- A construction of several classes of two-weight and three-weight linear codes
- Constant composition codes as subcodes of linear codes
- A class of three-weight and five-weight linear codes
- A family of linear codes from constant dimension subspace codes
- A survey on the applications of Niho exponents
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Three-weight ternary linear codes from a family of power functions
- A class of cyclotomic linear codes and their generalized Hamming weights
- Three-weight codes and near-bent functions from two-weight codes
- A construction of \(p\)-ary linear codes with two or three weights
- Two classes of near-optimal codebooks with respect to the Welch bound
- A construction of codes with linearity from two 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\)
- Recent results and problems on constructions of linear codes from cryptographic functions
- A family of projective two-weight linear codes
- 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
- Weight distributions and weight hierarchies of two classes of binary linear codes
- Weight distributions and weight hierarchies of a family of \(p\)-ary linear codes
- Complete weight enumerators of three classes of linear codes
- Five classes of optimal two-weight linear codes
- Complete weight enumerators of a class of three-weight linear codes
- Two classes of linear codes and their weight distributions
- The parameters of minimal linear codes
- 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
- A class of linear codes and their complete weight enumerators
- Complete weight enumerators of two classes of linear codes with a few weights
- Several infinite families of \(p\)-ary weakly regular bent functions
- Complete weight enumerators of a class of linear codes with two weights
- A family of distance-optimal minimal linear codes with flexible parameters
- Two-weight codes: upper bounds and new optimal constructions
- Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes
- A class of linear codes with a few weights
- Complete weight enumerators of some linear codes from quadratic forms
- Two classes of \(p\)-ary bent functions and linear codes with three or four weights
- Three classes of binary linear codes with good parameters
- Binary linear codes with two or three weights from Niho exponents
- A new class of optimal linear codes with flexible parameters
- Several classes of linear codes and their weight distributions
- Linear codes with few weights from inhomogeneous quadratic functions
- Several classes of binary linear codes and their weight enumerators
- 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
- Two new classes of projective two-weight linear codes
- Two-weight or three-weight binary linear codes from cyclotomic mappings
- Infinite families of optimal linear codes and their applications to distributed storage systems
- Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- Constructions for several classes of few-weight linear codes and their applications
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- 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
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- Minimal linear codes constructed from functions
- Several classes of new projective three-weight or four-weight linear codes and their applications in \(s\)-sum sets
- A construction of \(q\)-ary linear codes with irreducible cyclic codes
- Constructing few-weight linear codes and strongly regular graphs
- Characterization of weakly regular \(p\)-ary bent functions of \(\ell \)-form
- The punctured codes of two classes of cyclic codes with few weights
- Three new constructions of optimal linear codes with few weights
- Linear codes with few weights over finite fields
- Combinatorial \(t\)-designs and strongly regular graphs from projective codes over finite fields
- Generic construction of Boolean functions with a few Walsh transform values of any possible algebraic degree
- Constructions of projective linear codes by the intersection and difference of sets
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
- A class of three-weight linear codes over finite fields of odd characteristic
- Minimal linear codes constructed from hierarchical posets with two levels
- Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique
- Three-weight and five-weight linear codes over finite fields
- Linear codes from planar functions and related covering codes
- Further projective binary linear codes derived from two-to-one functions and their duals
- Infinite families of \(t\)-designs and strongly regular graphs from punctured codes
- Some shortened codes from linear codes constructed by defining sets
This page was built for publication: Linear codes with two or three weights from quadratic bent functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306341)
