Linear codes from vectorial Boolean power functions
Let \(p=2\), \(q=p^m\), for every natural number \(l|m\) defining the trace function \(\text{Tr}_l^{m}(x)=\sum_{i=0}^{(\frac{m}l-1)l}{x^{p^i}}\) consider the linear code \[\mathcal{C}_D=\{c_u=(\text{Tr}_1^m(ud_1),\ldots,\text{Tr}_1^m(ud_n)\mid u\in \mathbb{F}_{2^m}\},\] for the defining set \(D=\{d_1,\ldots,d_n\}\subseteq \mathbb{F}_{2^m}\). The authors use the preimage of the trace \(\text{Tr}_l^{m}\) of some vectorial Boolean power functions as the defining sets where \(f(x)\) are power functions. For \(m = 3l\), a class of three-weight linear codes is constructed by taking the inverse function \(f(x)=x^{-1}\). The weight distribution is completely determined by using known facts about trace functions. Further, when \(l\) and 3 are coprime, by considering \(f(x) = x^{2^k}+1,\) it is shown that a class of four-weight linear codes and a class of two-weight codes can be constructed for \(m\) odd and \(\gcd(k, m)=1\) and for \(m\) even and \(k=\frac{m}{2}.\) At the end of the paper, it is shown that a class of simplex codes and a class of first-order Reed-Muller codes can also be obtained from this construction by choosing particular functions and defining sets.
- Several classes of linear codes and their weight distributions
- A class of linear codes with two weights or three weights from some planar functions
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Binary linear codes with few weights from Boolean functions
- A construction of several classes of two-weight and three-weight linear codes
- A class of linear codes with a few weights
- A class of three-weight and five-weight linear codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A construction of binary linear codes from Boolean functions
- A Construction of Linear Codes Over ${\mathbb {F}}_{2^t}$ From Boolean Functions
- Cyclotomic Linear Codes of Order 3
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Linear Codes From Some 2-Designs
- Linear codes with few weights from inhomogeneous quadratic functions
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Linear codes with two or three weights from quadratic bent functions
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Monomial bent functions
- Note on cubics over GF(2ⁿ) and GF(3ⁿ)
- On the solution of algebraic equations over finite fields
- One-to-one highly nonlinear power functions on \(\mathrm{GF}(2^n)\)
- Several classes of complete permutation polynomials
- Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\)
- Two classes of two-weight linear codes
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- Proofs of several conjectures on linear codes from Boolean functions
- Linear codes from simplicial complexes
- Binary linear codes with few weights from Boolean functions
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Trace codes over \(\mathbb {Z}_4,\) and Boolean functions
- Linear codes from vectorial Boolean functions in the context of algebraic attacks
- Vectorial bent functions and linear codes from quadratic forms
This page was built for publication: Linear codes from vectorial Boolean power functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994938)
