Linear codes with few weights from vectorial dual-bent functions

DOI10.1016/J.FFA.2025.102660MaRDI QIDQ6939586zbMATH OpenFDO

Authors Zhicheng Wang, Shudi Yang, Qiang Wang

Publication date 21 August 2025

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.FFA.2025.102660

zbMATH Keywords

asymmetric quantum codelinear codeself-orthogonal codevectorial dual-bent functionweight distribution

Mathematics Subject Classification ID

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

Cites work

• A construction of binary linear codes from Boolean functions
• A family of projective two-weight linear codes
• Bent and vectorial bent functions, partial difference sets, and strongly regular graphs
• Complete weight enumerators of some linear codes from quadratic forms
• Construction of minimal linear codes with few weights from weakly regular plateaued functions
• Constructions of linear codes with two or three weights from vectorial dual-bent functions
• Cyclotomic Linear Codes of Order 3
• Fundamentals of Error-Correcting Codes
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Linear codes from quadratic forms
• Linear codes from weakly regular plateaued functions and their secret sharing schemes
• Linear codes with few weights from cyclotomic classes and weakly regular bent functions
• Linear codes with few weights from weakly regular bent functions based on a generic construction
• Linear codes with few weights from weakly regular plateaued functions
• Linear codes with two or three weights from quadratic bent functions
• Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
• Minimal linear codes from weakly regular plateaued balanced functions
• New results on vectorial dual-bent functions and partial difference sets
• Pure asymmetric quantum MDS codes from CSS construction: a complete characterization
• Recent results and problems on constructions of linear codes from cryptographic functions
• Self-orthogonal codes from p-divisible codes
• Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
• Three new constructions of optimal linear codes with few weights
• Two classes of p-ary bent functions and linear codes with three or four weights
• Vectorial bent functions and their duals

This page was built for publication: Linear codes with few weights from vectorial dual-bent functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939586)