Linear codes with few weights from cyclotomic classes and weakly regular bent functions

DOI10.1007/s10623-020-00744-9zbMath1448.94277OpenAlexW3010483868MaRDI QIDQ2182084

Nian Li, Yanan Wu, Xiangyong Zeng

Publication date: 21 May 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-020-00744-9

zbMATH Keywords

linear codeweight distributioncyclotomic classweakly regular bent function

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Boolean functions (94D10)

Related Items (10)

Estimations on some hybrid exponential sums related to Kloosterman sums ⋮ Constructing few-weight linear codes and strongly regular graphs ⋮ Constructions of linear codes with two or three weights from vectorial dual-bent functions ⋮ Construction of minimal linear codes with few weights from weakly regular plateaued functions ⋮ Generalized Hamming weights of linear codes from cryptographic functions ⋮ Constructions of strongly regular Cayley graphs derived from weakly regular bent functions ⋮ Minimal linear codes from weakly regular plateaued balanced functions ⋮ Linear codes with few weights from weakly regular plateaued functions ⋮ Recent results and problems on constructions of linear codes from cryptographic functions ⋮ Binary linear codes with few weights from Boolean functions

Uses Software

• Code Tables

Cites Work

• Unnamed Item
• Unnamed Item
• A construction of binary linear codes from Boolean functions
• A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
• Planar functions and planes of Lenz-Barlotti class II
• Generalized bent functions and their properties
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Linear codes from weakly regular plateaued functions and their secret sharing schemes
• A coding theory construction of new systematic authentication codes
• A construction of several classes of two-weight and three-weight linear codes
• Two-weight and three-weight linear codes based on Weil sums
• A new characterization of semi-bent and bent functions on finite fields
• Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
• New Constructions of Quadratic Bent Functions in Polynomial Form
• The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials
• Several New Classes of Bent Functions From Dillon Exponents
• A Class of Binomial Bent Functions Over the Finite Fields of Odd Characteristic
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Monomial and quadratic bent functions over the finite fields of odd characteristic
• The weight distribution of a class of linear codes from perfect nonlinear functions
• Secret sharing schemes from three classes of linear codes
• Cyclotomic Linear Codes of Order $3$
• Fundamentals of Error-Correcting Codes
• The Geometry of Two-Weight Codes
• Period polynomials and Gauss sums for finite fields
• Designs from Linear Codes
• Proofs of Two Conjectures on Ternary Weakly Regular Bent Functions
• New Binomial Bent Functions Over the Finite Fields of Odd Characteristic
• Algebraically punctured cyclic codes
• A Bound for Error-Correcting Codes

This page was built for publication: Linear codes with few weights from cyclotomic classes and weakly regular bent functions