Minimal codes derived from plateaued functions over F₅

DOI10.1007/S40840-025-02015-ZMaRDI QIDQ6868372zbMATH OpenFDO

Authors Ahmet Sınak

Publication date 26 January 2026

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40840-025-02015-Z

zbMATH Keywords

Hamming weightminimal codeweakly regular bent functionweakly regular plateaued functionweight distribution

Mathematics Subject Classification ID

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

Cites work

• A geometric characterization of minimal codes and their asymptotic performance
• Explicit Criteria for Construction of Plateaued Functions
• Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
• Fundamentals of Error-Correcting Codes
• scientific article; zbMATH DE number 2040937 (Why is no real title available?)
• scientific article; zbMATH DE number 1424197 (Why is no real title available?)
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Linear codes from simplicial complexes
• Linear codes from weakly regular plateaued functions and their secret sharing schemes
• Linear codes with few weights from weakly regular bent functions based on a generic construction
• Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
• Minimal Binary Linear Codes
• Minimal linear codes arising from blocking sets
• Minimal Linear Codes From Characteristic Functions
• Minimal linear codes from Maiorana-McFarland functions
• Minimal linear codes from weakly regular bent functions
• Minimal linear codes in odd characteristic
• Minimal linear codes over finite fields
• Minimal vectors in linear codes
• Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
• Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic
• Towards secure two-party computation from the wire-tap channel

This page was built for publication: Minimal codes derived from plateaued functions over \(\mathbb{F}_5\)

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