Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators

DOI10.3934/amc.2022047OpenAlexW4285253015MaRDI QIDQ6112180

Claude Carlet

Publication date: 7 July 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2022047

zbMATH Keywords

covering radiuslinear codeweight distributionBoolean functionminimum distanceerror-correcting codealgebraic normal form

Mathematics Subject Classification ID

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

Related Items (1)

Evolutionary strategies for the design of binary linear codes

Cites Work

• Unnamed Item
• Unnamed Item
• A construction of binary linear codes from Boolean functions
• Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
• Bent vectorial functions and linear codes from o-polynomials
• On the nonlinearity of S-boxes and linear codes
• A new construction of highly nonlinear S-boxes
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• A sequence construction of cyclic codes over finite fields
• Binary linear codes from vectorial Boolean functions and their weight distribution
• A class of low-rate nonlinear binary codes
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• The weight distribution of a class of linear codes from perfect nonlinear functions
• The Algebraic Degree of Perfect Binary Codes
• Handling Vectorial Functions by Means of Their Graph Indicators
• Four fundamental parameters of a code and their combinatorial significance
• Bent Vectorial Functions, Codes and Designs
• Boolean Functions for Cryptography and Coding Theory
• Cyclic Codes from Some Monomials and Trinomials
• On Dedekind's Problem: The Number of Monotone Boolean Functions

This page was built for publication: Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators