Autor(s)

Galina Bogdanova, Todor Todorov

Published at

Mathematics, 2022

Abstract

    Problems of search and enumeration of binary and ternary equidistant codes are considered in the paper. We investigate some combinatorial algorithms and develop specialized computer packages to find non-equivalent optimal binary and ternary equidistant codes for 3 ≤ d ≤ n ≤ 9.

Keywords

Optimal Codes; Equidistant Codes; Enumeration of Codes

Links

https://doi.org/10.3390/math10050740

Cite as

Bogdanova, G.; Todorov, T.; (2022).Enumeration of Optimal Equidistant Codes. Mathematics. 2022, 10(5):740. Mathematics, An Open Access Journal from MDPI., 2022, DOI: https://doi.org/10.3390/math10050740

The publication presents research on the project

The publication is part of stage 1 of the project