Binary linear codes with few weights from Boolean functions
From MaRDI portal
Publication:2043421
DOI10.1007/s10623-021-00898-0OpenAlexW3166175210MaRDI QIDQ2043421
Yan Zhang, Dabin Zheng, Xiaoqiang Wang
Publication date: 2 August 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.09591
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Yet another variation on minimal linear codes
- A construction of binary linear codes from Boolean functions
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- New cyclic difference sets with Singer parameters
- Several classes of linear codes and their weight distributions
- Projective two-weight codes with small parameters and their corresponding graphs
- On ``bent functions
- How to build robust shared control systems
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
- Binary linear codes with two or three weights from Niho exponents
- Four classes of linear codes from cyclotomic cosets
- A coding theory construction of new systematic authentication codes
- The number of rational points of a class of Artin-Schreier curves.
- A construction of bent functions from plateaued functions
- Projective binary linear codes from special Boolean functions
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- Solving \(x+x^{2^l}+\ldots +x^{2^{ml}}=a\) over \(\mathbb{F}_{2^n} \)
- The weight distributions of two classes of binary cyclic codes
- Three-weight ternary linear codes from a family of power functions
- A construction of several classes of two-weight and three-weight linear codes
- Binary linear codes from vectorial Boolean functions and their weight distribution
- A class of three-weight and five-weight linear codes
- Two-weight and three-weight linear codes based on Weil sums
- 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
- The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Secret sharing schemes from three classes of linear codes
- Cyclotomic Linear Codes of Order $3$
- Value Distributions of Exponential Sums From Perfect Nonlinear Functions and Their Applications
- On the Weight Distributions of Two Classes of Cyclic Codes
- The Geometry of Two-Weight Codes
- Some new three-valued crosscorrelation functions for binary m-sequences
- Semibent Functions From Dillon and Niho Exponents, Kloosterman Sums, and Dickson Polynomials
- 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
This page was built for publication: Binary linear codes with few weights from Boolean functions
