Minimal p-ary codes via the direct sum of functions, non-covering permutations and subspaces of derivatives

DOI10.1109/TIT.2023.3338577MaRDI QIDQ6576619zbMATH OpenFDO

Authors René Rodríguez-Aldama, E. Pasalic, Feng Rong Zhang, Y. Wei

Publication date 23 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2023.3338577

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(4)

• Four classes of wide minimal q-ary linear codes from a general method
• Minimal linear codes from vectorial functions
• Several new classes of p-ary weakly regular plateaued functions and minimal codes with several weights
• Constructions of binary self-orthogonal singly-even wide minimal linear codes with few weights

This page was built for publication: Minimal \(p\)-ary codes via the direct sum of functions, non-covering permutations and subspaces of derivatives

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