Fülöp, Dániel and Hannusch, Carolin (2019) Algorithm for the generation of complement-free sets. Annales Mathematicae et Informaticae, 50. pp. 89-92. ISSN 1787-5021 (Print), 1787-6117 (Online)
|
Text
AMI_50_from89to92.pdf - Published Version Download (694kB) | Preview |
Abstract
We introduce an algorithm for the generation of complement-free sets of binary m-tuples, where m is even. We also provide an implementation for this algorithm for m = 12. Such complement-free sets are needed for the generation of a new class of error-correcting codes, which were introduced by Hannusch and Lakatos. These codes build the fundamental improvement in the cryptographic system of Dömösi, Hannusch and Horváth. Therefore the generation of complement-free sets will be important for cryptographic applications. In the end of the paper we give some interesting facts about complement-free sets as combinatorial objects.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | algorithmic computation, discrete sets |
Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
Depositing User: | Tibor Gál |
Date Deposited: | 20 Dec 2019 11:14 |
Last Modified: | 03 Apr 2023 06:41 |
URI: | http://real.mtak.hu/id/eprint/104753 |
Actions (login required)
Edit Item |