Linear codes from vectorial Boolean power functions
From MaRDI portal
Publication:1994938
DOI10.1016/j.ffa.2020.101726zbMath1465.94104OpenAlexW3045580795MaRDI QIDQ1994938
Yuan Chen, Benchang Xiao, Xiangyong Zeng, Li Zhang
Publication date: 18 February 2021
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2020.101726
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Trigonometric and exponential sums (general theory) (11L03)
Cites Work
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Linear codes with two or three weights from quadratic bent functions
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- A class of linear codes with a few weights
- Linear codes with few weights from inhomogeneous quadratic functions
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- Note on cubics over \(GF(2^n)\) and \(GF(3^n)\)
- One-to-one highly nonlinear power functions on \(\mathrm{GF}(2^n)\)
- Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\)
- A class of three-weight and five-weight linear codes
- Several classes of complete permutation polynomials
- Two classes of two-weight linear codes
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Linear Codes From Some 2-Designs
- A Construction of Linear Codes Over ${\mathbb {F}}_{2^t}$ From Boolean Functions
- Monomial bent functions
- Cyclotomic Linear Codes of Order $3$
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- Fundamentals of Error-Correcting Codes
- On the solution of algebraic equations over finite fields
This page was built for publication: Linear codes from vectorial Boolean power functions
