Linear codes from functions

MaRDI QIDQ5013042zbMATH OpenFDO

Authors Sihem Mesnager

Publication date 26 November 2021

zbMATH Keywords

AB (almost bent) functionAPN (almost perfect nonlinear) functionbent functionconstruction from functions and polynomials over finite fieldshighly nonlinear functionslinear codes with good parametersplateaued functionPN (perfect nonlinear) function

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Linear codes (general theory) (94B05) Boolean functions (94D10)

Recommendations

• Recent results and problems on constructions of linear codes from cryptographic functions
• Construction of binary linear codes via rational function fields
• Function-field codes
• Minimal linear codes constructed from functions
• New Linear Codes and Algebraic Function Fields Over Finite Fields

Cited in

(17)

• Codes, graphs, and schemes from nonlinear functions
• Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
• Weight distributions for projective binary linear codes from Weil sums
• Minimal binary linear codes: a general framework based on bent concatenation
• Survey on recent trends towards generalized differential and boomerang uniformities
• Minimal linear codes constructed from functions
• Two classes of linear codes based on perfect nonlinear functions
• Construction of global function fields from linear codes and vice versa
• scientific article; zbMATH DE number 2085195 (Why is no real title available?)
• Construction of minimal linear codes with few weights from weakly regular plateaued functions
• Construction of binary linear codes via rational function fields
• Constructions of linear codes with two or three weights from vectorial dual-bent functions
• Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights
• Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings
• Dual and Hull code in the first two generic constructions and relationship with the Walsh transform of cryptographic functions
• Constructing infinite families of cyclic codes utilizing cryptographic functions over finite fields
• Constructions of binary self-orthogonal singly-even wide minimal linear codes with few weights

This page was built for publication: Linear codes from functions

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