Evolutionary strategies for the design of binary linear codes

DOI10.1007/978-3-031-30035-6_8arXiv2211.11551OpenAlexW4361798394MaRDI QIDQ6149095

Luca Manzoni, Luca Mariot, Stjepan Picek, Claude Carlet

Publication date: 12 January 2024

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.11551

zbMATH Keywords

Boolean functionserror-correcting codesevolutionary strategiesalgebraic normal formvariation operators

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Exploring semi-bent Boolean functions arising from cellular automata
• Handbook of Finite Fields
• Fundamentals of Error-Correcting Codes
• Coding for Errors and Erasures in Random Network Coding
• Reducibility among Combinatorial Problems
• Boolean Functions for Cryptography and Coding Theory
• Evolutionary Computation in Combinatorial Optimization
• The design of (almost) disjunct matrices by evolutionary algorithms
• Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators

This page was built for publication: Evolutionary strategies for the design of binary linear codes