Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
From MaRDI portal
Publication:2976952
DOI10.1109/TIT.2016.2518678zbMath1359.94738arXiv1507.06148MaRDI QIDQ2976952
Zhengchun Zhou, Nian Li, Yanfeng Qi, Tor Helleseth, Chun-Ming Tang
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.06148
Related Items (84)
Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound ⋮ A construction of linear codes and strongly regular graphs from \(q\)-polynomials ⋮ Three-weight ternary linear codes from a family of power functions ⋮ Minimal linear codes from weakly regular bent functions ⋮ Three-weight codes and near-bent functions from two-weight codes ⋮ A survey on the applications of Niho exponents ⋮ Two classes of linear codes and their weight distributions ⋮ Minimal linear codes constructed from functions ⋮ A construction of several classes of two-weight and three-weight linear codes ⋮ Constructions of projective linear codes by the intersection and difference of sets ⋮ Complete weight enumerators of three classes of linear codes ⋮ Five classes of optimal two-weight linear codes ⋮ The parameters of minimal linear codes ⋮ Linear codes with few weights from cyclotomic classes and weakly regular bent functions ⋮ A construction of \(q\)-ary linear codes with irreducible cyclic codes ⋮ Constructing few-weight linear codes and strongly regular graphs ⋮ Constructions of linear codes with two or three weights from vectorial dual-bent functions ⋮ Complete weight enumerators of a class of linear codes with two weights ⋮ Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights ⋮ Hybrid character sums and near-optimal partial Hadamard codebooks ⋮ Construction of minimal linear codes with few weights from weakly regular plateaued functions ⋮ Three families of self-orthogonal codes and their application in optimal quantum codes ⋮ Several classes of linear codes with few weights over finite fields ⋮ Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD codes ⋮ New results on vectorial dual-bent functions and partial difference sets ⋮ Three new constructions of optimal linear codes with few weights ⋮ Vectorial bent functions and linear codes from quadratic forms ⋮ Two-weight and three-weight linear codes based on Weil sums ⋮ Minimal linear codes from Maiorana-McFarland functions ⋮ Infinite families of \(t\)-designs and strongly regular graphs from punctured codes ⋮ The punctured codes of two classes of cyclic codes with few weights ⋮ Generalized Hamming weights of linear codes from cryptographic functions ⋮ Some shortened codes from linear codes constructed by defining sets ⋮ Connection of \(p\)-ary \(t\)-weight linear codes to Ramanujan Cayley graphs with \(t+1\) eigenvalues ⋮ Several classes of \(p\)-ary linear codes with few weights ⋮ Binary linear codes with two or three weights from Niho exponents ⋮ Some 3-designs and shortened codes from binary cyclic codes with three zeros ⋮ Some subfield codes from MDS codes ⋮ Several classes of permutation polynomials based on the AGW criterion over the finite field \(\mathbb{F}_{2^{2m}}\) ⋮ Constructions of strongly regular Cayley graphs derived from weakly regular bent functions ⋮ Further projective binary linear codes derived from two-to-one functions and their duals ⋮ A note on the minimal binary linear code ⋮ On generalized hyper-bent functions ⋮ A family of distance-optimal minimal linear codes with flexible parameters ⋮ Four decades of research on bent functions ⋮ Two new classes of projective two-weight linear codes ⋮ Type IV-II codes over Z4 constructed from generalized bent functions ⋮ Some two-weight and three-weight linear codes ⋮ Minimal linear codes from weakly regular plateaued balanced functions ⋮ Linear codes from weakly regular plateaued functions and their secret sharing schemes ⋮ Linear codes with few weights from weakly regular plateaued functions ⋮ Complete weight enumerators for several classes of two-weight and three-weight linear codes ⋮ A link between combinatorial designs and three-weight linear codes ⋮ Projective binary linear codes from special Boolean functions ⋮ More constructions of 3-weight linear codes ⋮ 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 ⋮ Three classes of binary linear codes with good parameters ⋮ Linear codes from quadratic forms ⋮ Weight enumerators of a class of linear codes ⋮ A class of hyper-bent functions and Kloosterman sums ⋮ Linear codes from vectorial Boolean power functions ⋮ Linear codes with few weights from inhomogeneous quadratic functions ⋮ Evaluation of the Hamming weights of a class of linear codes based on Gauss sums ⋮ 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 ⋮ Construction of minimal linear codes from multi-variable functions ⋮ Two classes of near-optimal codebooks with respect to the Welch bound ⋮ Several infinite families of \(p\)-ary weakly regular bent functions ⋮ Unnamed Item ⋮ Wide minimal binary linear codes from the general Maiorana-Mcfarland class ⋮ Recent results and problems on constructions of linear codes from cryptographic functions ⋮ Two families of subfield codes with a few weights ⋮ Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions ⋮ Ramanujan graphs and expander families constructed from \(p\)-ary bent functions ⋮ Complete weight enumerators of a class of linear codes ⋮ A family of projective two-weight linear codes ⋮ Binary linear codes with few weights from Boolean functions ⋮ Characterization of \(p\)-ary functions in terms of association schemes and its applications ⋮ Complete weight enumerators of a class of linear codes with two or three weights ⋮ Infinite families of optimal linear codes and their applications to distributed storage systems
This page was built for publication: Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
