A construction of binary linear codes from Boolean functions
From MaRDI portal
Publication:297928
DOI10.1016/J.DISC.2016.03.029zbMATH Open1408.94979arXiv1511.00321OpenAlexW2963169017MaRDI QIDQ297928FDOQ297928
Authors: Cunsheng Ding 
Publication date: 20 June 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of progress on the study of applications of Boolean functions in coding theory has been made. Two generic constructions of binary linear codes with Boolean functions have been well investigated in the literature. The objective of this paper is twofold. The first is to provide a survey on recent results, and the other is to propose open problems on one of the two generic constructions of binary linear codes with Boolean functions. These open problems are expected to stimulate further research on binary linear codes from Boolean functions.
Full work available at URL: https://arxiv.org/abs/1511.00321
Recommendations
- Binary linear codes with few weights from Boolean functions
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Projective binary linear codes from special Boolean functions
- scientific article
- Recent results and problems on constructions of linear codes from cryptographic functions
Association schemes, strongly regular graphs (05E30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Boolean functions (94D10)
Cites Work
- Title not available (Why is that?)
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Value Distributions of Exponential Sums From Perfect Nonlinear Functions and Their Applications
- The Geometry of Two-Weight Codes
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Secret sharing schemes from three classes of linear codes
- On ``bent functions
- Some results about the cross-correlation function between two maximal linear sequences
- A new class of monomial bent functions
- Several New Infinite Families of Bent Functions and Their Duals
- Further Results on Niho Bent Functions
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- A proof of the Welch and Niho conjectures on cross-correlations of binary \(m\)-sequences
- New cyclic difference sets with Singer parameters
- On Dillon's class \(H\) of bent functions, Niho bent functions and o-polynomials
- One-to-one highly nonlinear power functions on \(\mathrm{GF}(2^n)\)
- Hyperovals in Desarguesian planes: An update
- A class of three-weight cyclic codes
- Hamming Weights of the Duals of Cyclic Codes With Two Zeros
- Title not available (Why is that?)
- New classes of almost bent and almost perfect nonlinear polynomials
- Title not available (Why is that?)
- How to build robust shared control systems
- A coding theory construction of new systematic authentication codes
- A condition for the existence of ovals in PG(2,q), q even
- Flocks and ovals
- Semi-bent Functions from Oval Polynomials
- Linear Codes From Some 2-Designs
- Bent functions from spreads
- A class of low-rate nonlinear binary codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Niho type cross-correlation functions via dickson polynomials and Kloosterman sums
- Cyclotomic Linear Codes of Order $3$
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Automorphism Groups of the Kerdock Codes
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Title not available (Why is that?)
- A Note on the Proof of Niho's Conjecture
- Title not available (Why is that?)
- Some new three-valued crosscorrelation functions for binary m-sequences
- Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences
- Period-Different $m$-Sequences With at Most Four-Valued Cross Correlation
- On Semi-bent Functions and Related Plateaued Functions Over the Galois Field 𝔽 2 n $$\mathbb{F}_{2^{n}}$$
- On Semibent Boolean Functions
- Semibent Functions From Dillon and Niho Exponents, Kloosterman Sums, and Dickson Polynomials
- Ovali ed altre curve nei piani di Galois di caratteristica due
- Further crosscorrelation properties of sequences with the decimation factor \({d=\frac{p^n+1}{p+1}-\frac{p^n-1}{2}}\)
- On triple-sum-sets and two or three weights codes
- The Walsh transform of a class of monomial functions and cyclic codes
- On the Walsh spectrum of a family of quadratic APN functions with five terms
- New pairs of \(m\)-sequences with 4-level cross-correlation.
Cited In (81)
- Projective binary linear codes from special Boolean functions
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Two-weight or three-weight binary linear codes from cyclotomic mappings
- Generalized Hamming weights of linear codes from cryptographic functions
- Linear codes from vectorial Boolean power functions
- Several classes of \(p\)-ary linear codes with few weights
- Constructions of several classes of linear codes with a few weights
- Four classes of linear codes from cyclotomic cosets
- A note on the minimal binary linear code
- Minimal linear codes from weakly regular bent functions
- A link between combinatorial designs and three-weight linear codes
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Construction of linear codes having prescribed primal-dual minimum distance with applications in cryptography
- Cyclotomic trace codes
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- Vectorial bent functions and linear codes from quadratic forms
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- A survey on the applications of Niho exponents
- Minimal linear codes from Maiorana-McFarland functions
- Optimal minimal linear codes from posets
- Minimal linear codes from weakly regular plateaued balanced functions
- Proofs of several conjectures on linear codes from Boolean functions
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Minimal binary linear codes: a general framework based on bent concatenation
- Minimal linear codes constructed from functions
- 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
- Difference sets and three-weight linear codes from trinomials
- Characterizations and constructions of \(n\)-to-1 mappings over finite fields
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- 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
- Binary linear codes with few weights from Boolean functions
- Hyperovals and bent functions
- Weight distributions and weight hierarchies of a family of \(p\)-ary linear codes
- Several classes of permutation trinomials over \(\mathbb {F}_{5^{n}}\) from Niho exponents
- Two classes of linear codes and their weight distributions
- 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
- Bounds for the sum of distances of spherical sets of small size
- 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
- 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 with a few weights
- Bent functions linear on elements of some classical spreads and presemifields spreads
- Two classes of \(p\)-ary bent functions and linear codes with three or four weights
- Binary linear codes with two or three weights from Niho exponents
- Several classes of linear codes and their weight distributions
- Linear codes with few weights from inhomogeneous quadratic functions
- Several new classes of self-dual bent functions derived from involutions
- New linear codes with few weights derived from Kloosterman sums
- Equivalence classes of Niho bent functions
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)
- Some 3-designs and shortened codes from binary cyclic codes with three zeros
- Constructions of linear codes with two or three weights from vectorial dual-bent functions
- Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- New results on \(n\)-to-1 mappings over finite fields
- New dimension-independent upper bounds on linear insdel codes
- Some subfield codes from MDS codes
- On the size of maximal binary codes with 2, 3, and 4 distances
- Constructing few-weight linear codes and strongly regular graphs
- Few-weight linear codes over \(\mathbb{F}_p\) from \(t\)-to-one mappings
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
- Additive codes with few weights
- A class of three-weight linear codes over finite fields of odd characteristic
- Minimal linear codes constructed from hierarchical posets with two levels
- Title not available (Why is that?)
- Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique
- Further projective binary linear codes derived from two-to-one functions and their duals
- Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators
- Möbius transformations and characterizations of hyper-bent functions from Dillon-like exponents with coefficients in extension fields
- Some shortened codes from linear codes constructed by defining sets
- Dual transform and projective self-dual codes
This page was built for publication: A construction of binary linear codes from Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297928)
