Autor(s)

Todor Todorov, Galina Bogdanova

Published at

International Journal of Mathematics and Computer Science, Vol. 17 Issue 2, 2022

Abstract

    In this paper, we study the maximum number of codewords for equidistant codes with additional restriction to be constant-weight and lexicographic. We consider codes that are ternary, quaternary and over the alphabet with five elements. We use both computer and combinatorial methods. These error-correcting codes are used for data security in a specialized scientific project with a specialized information system with security sensitive data.

Keywords

Lexicographic codes; Equidistant codes; Constant-weight codes; Bounds of codes

Acknowledgement

    This research was funded by the National Science Fund of Bulgaria (scientific project Digital Accessibility for People with Special Needs: Methodology, Conceptual Models and Innovative EcoSystems), Grant Number KP-06-N42/4, 08.12.2020.

Links

http://ijmcs.future-in-tech.net/17.2/R-Todorov.pdf

Cite as

Todorov, T.; Bogdanova, G. (2022). On the construction of of q-ary constant-weight lexicodes, International Journal of Mathematics and Computer Science, Vol. 17 Issue 2, ISSN 1814-0432, 2022, pp. 923 - 930

The publication presents research on the project