A construction of binary linear codes from Boolean functions

From MaRDI portal
Publication:297928

DOI10.1016/j.disc.2016.03.029zbMath1408.94979arXiv1511.00321OpenAlexW2963169017MaRDI QIDQ297928

Cunsheng Ding

Publication date: 20 June 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.00321




Related Items (70)

Several classes of minimal binary linear codes violating the Ashikhmin-Barg boundA construction of linear codes and strongly regular graphs from \(q\)-polynomialsMinimal linear codes from weakly regular bent functionsProofs of several conjectures on linear codes from Boolean functionsMinimal binary linear codes: a general framework based on bent concatenationFour families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)A survey on the applications of Niho exponentsTwo classes of linear codes and their weight distributionsMinimal linear codes constructed from functionsConstructions of projective linear codes by the intersection and difference of setsBinary linear codes from vectorial Boolean functions and their weight distributionThe parameters of minimal linear codesSeveral new classes of self-dual bent functions derived from involutionsLinear codes with few weights from cyclotomic classes and weakly regular bent functionsConstructing few-weight linear codes and strongly regular graphsConstructions of linear codes with two or three weights from vectorial dual-bent functionsSeveral classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weightsConstruction of minimal linear codes with few weights from weakly regular plateaued functionsVectorial bent functions and linear codes from quadratic formsHyperovals and bent functionsMinimal linear codes from Maiorana-McFarland functionsExpressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicatorsMöbius transformations and characterizations of hyper-bent functions from Dillon-like exponents with coefficients in extension fieldsGeneralized Hamming weights of linear codes from cryptographic functionsSome shortened codes from linear codes constructed by defining setsSeveral classes of \(p\)-ary linear codes with few weightsCodes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)Binary linear codes with two or three weights from Niho exponentsDifference sets and three-weight linear codes from trinomialsSome 3-designs and shortened codes from binary cyclic codes with three zerosTwo classes of 2-weight and 3-weight linear codes in terms of Kloosterman sumsSome subfield codes from MDS codesBounds for the sum of distances of spherical sets of small sizeConstructions of strongly regular Cayley graphs derived from weakly regular bent functionsFurther projective binary linear codes derived from two-to-one functions and their dualsA note on the minimal binary linear codeOptimal minimal linear codes from posetsMinimal linear codes from weakly regular plateaued balanced functionsLinear codes from weakly regular plateaued functions and their secret sharing schemesSeveral classes of permutation trinomials over \(\mathbb {F}_{5^{n}}\) from Niho exponentsSeveral classes of linear codes and their weight distributionsA link between combinatorial designs and three-weight linear codesProjective binary linear codes from special Boolean functionsBent functions linear on elements of some classical spreads and presemifields spreadsA class of linear codes with a few weightsTwo classes of \(p\)-ary bent functions and linear codes with three or four weightsFour classes of linear codes from cyclotomic cosetsLinear codes from vectorial Boolean power functionsLinear codes with few weights from inhomogeneous quadratic functionsEvaluation of the Hamming weights of a class of linear codes based on Gauss sumsAt most three-weight binary linear codes from generalized Moisio's exponential sumsCyclotomic trace codesConstructions of several classes of linear codes with a few weightsA class of two or three weights linear codes and their complete weight enumeratorsA construction of \(p\)-ary linear codes with two or three weightsConstruction of minimal linear codes from multi-variable functionsTwo classes of near-optimal codebooks with respect to the Welch boundWide minimal binary linear codes from the general Maiorana-Mcfarland classEquivalence classes of Niho bent functionsRecent results and problems on constructions of linear codes from cryptographic functionsCombinatorial \(t\)-designs from special functionsThe subfield codes of several classes of linear codesTwo families of subfield codes with a few weightsA class of subfield codes of linear codes and their dualsBinary linear codes with few weights from Boolean functionsNew linear codes with few weights derived from Kloosterman sumsWeight distributions and weight hierarchies of a family of \(p\)-ary linear codesCharacterization of \(p\)-ary functions in terms of association schemes and its applicationsTwo-weight or three-weight binary linear codes from cyclotomic mappingsCharacterizations and constructions of \(n\)-to-1 mappings over finite fields



Cites Work


This page was built for publication: A construction of binary linear codes from Boolean functions