A construction of binary linear codes from Boolean functions
From MaRDI portal
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.
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; zbMATH DE number 5862915
- Recent results and problems on constructions of linear codes from cryptographic functions
Cites work
- scientific article; zbMATH DE number 5862915 (Why is no real title available?)
- scientific article; zbMATH DE number 3143242 (Why is no real title available?)
- scientific article; zbMATH DE number 3842614 (Why is no real title available?)
- scientific article; zbMATH DE number 3871188 (Why is no real title available?)
- scientific article; zbMATH DE number 4028269 (Why is no real title available?)
- scientific article; zbMATH DE number 4062030 (Why is no real title available?)
- scientific article; zbMATH DE number 3175751 (Why is no real title available?)
- scientific article; zbMATH DE number 1024089 (Why is no real title available?)
- scientific article; zbMATH DE number 4114556 (Why is no real title available?)
- A Note on the Proof of Niho's Conjecture
- A class of low-rate nonlinear binary codes
- A class of three-weight cyclic codes
- A coding theory construction of new systematic authentication codes
- A condition for the existence of ovals in PG(2,q), q even
- A new class of monomial bent functions
- A proof of the Welch and Niho conjectures on cross-correlations of binary \(m\)-sequences
- Bent functions from spreads
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Cyclotomic Linear Codes of Order $3$
- Flocks and ovals
- Further Results on Niho Bent Functions
- Further crosscorrelation properties of sequences with the decimation factor \({d=\frac{p^n+1}{p+1}-\frac{p^n-1}{2}}\)
- Hamming Weights of the Duals of Cyclic Codes With Two Zeros
- How to build robust shared control systems
- Hyperovals in Desarguesian planes: An update
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear Codes From Some 2-Designs
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- New classes of almost bent and almost perfect nonlinear polynomials
- New cyclic difference sets with Singer parameters
- New pairs of \(m\)-sequences with 4-level cross-correlation.
- Niho type cross-correlation functions via dickson polynomials and Kloosterman sums
- On Dillon's class \(H\) of bent functions, Niho bent functions and o-polynomials
- On Semibent Boolean Functions
- On ``bent functions
- On constructions of semi-bent functions from bent functions
- On semi-bent functions and related plateaued functions over the Galois field \(\mathbb{F}_{2^n}\)
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- On the Walsh spectrum of a family of quadratic APN functions with five terms
- On triple-sum-sets and two or three weights codes
- One-to-one highly nonlinear power functions on \(\mathrm{GF}(2^n)\)
- Ovali ed altre curve nei piani di Galois di caratteristica due
- Period-Different $m$-Sequences With at Most Four-Valued Cross Correlation
- Secret sharing schemes from three classes of linear codes
- Semi-bent functions from oval polynomials
- Semibent Functions From Dillon and Niho Exponents, Kloosterman Sums, and Dickson Polynomials
- Several New Infinite Families of Bent Functions and Their Duals
- Some new three-valued crosscorrelation functions for binary m-sequences
- Some results about the cross-correlation function between two maximal linear sequences
- The Automorphism Groups of the Kerdock Codes
- The Geometry of Two-Weight Codes
- The Walsh transform of a class of monomial functions and cyclic codes
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- Value Distributions of Exponential Sums From Perfect Nonlinear Functions and Their Applications
- Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
Cited in
(81)- Some subfield codes from MDS codes
- Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique
- 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
- 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
- A class of three-weight linear codes over finite fields of odd characteristic
- New dimension-independent upper bounds on linear insdel codes
- Minimal linear codes constructed from hierarchical posets with two levels
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
- Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)
- On the size of maximal binary codes with 2, 3, and 4 distances
- Some 3-designs and shortened codes from binary cyclic codes with three zeros
- New results on \(n\)-to-1 mappings over finite fields
- Additive codes with few weights
- Few-weight linear codes over \(\mathbb{F}_p\) from \(t\)-to-one mappings
- Further projective binary linear codes derived from two-to-one functions and their duals
- Constructing few-weight linear codes and strongly regular graphs
- scientific article; zbMATH DE number 2208728 (Why is no real title available?)
- Constructions of projective linear codes by the intersection and difference of sets
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- New linear codes with few weights derived from Kloosterman sums
- Construction of linear codes having prescribed primal-dual minimum distance with applications in cryptography
- 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
- Cyclotomic trace codes
- Binary linear codes with two or three weights from Niho exponents
- Proofs of several conjectures on linear codes from Boolean functions
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
- Construction of minimal linear codes with few weights from weakly regular plateaued functions
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- Linear codes from vectorial Boolean power functions
- The parameters of minimal linear codes
- Equivalence classes of Niho bent functions
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Projective binary linear codes from special Boolean functions
- Several classes of permutation trinomials over \(\mathbb {F}_{5^{n}}\) from Niho exponents
- A survey on the applications of Niho exponents
- 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
- Four classes of linear codes from cyclotomic cosets
- Several classes of linear codes and their weight distributions
- A note on the minimal binary linear code
- A class of two or three weights linear codes and their complete weight enumerators
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Hyperovals and bent functions
- Minimal linear codes from Maiorana-McFarland functions
- Weight distributions and weight hierarchies of a family of \(p\)-ary linear codes
- Bounds for the sum of distances of spherical sets of small size
- Vectorial bent functions and linear codes from quadratic forms
- Difference sets and three-weight linear codes from trinomials
- Two-weight or three-weight binary linear codes from cyclotomic mappings
- Minimal binary linear codes: a general framework based on bent concatenation
- Several classes of \(p\)-ary linear codes with few weights
- Constructions of several classes of linear codes with a few weights
- Linear codes with few weights from inhomogeneous quadratic functions
- Two classes of linear codes and their weight distributions
- Generalized Hamming weights of linear codes from cryptographic functions
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- 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
- Optimal minimal linear codes from posets
- Minimal linear codes from weakly regular bent functions
- Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums
- A link between combinatorial designs and three-weight linear codes
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Minimal linear codes from weakly regular plateaued balanced functions
- Several new classes of self-dual bent functions derived from involutions
- Minimal linear codes constructed from functions
- Characterizations and constructions of \(n\)-to-1 mappings over finite fields
- The subfield codes of several classes of linear 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)
