Embedding in MDS codes and Latin cubes Научная публикация
| Журнал |
Journal of Combinatorial Designs
ISSN: 1063-8539 |
||
|---|---|---|---|
| Вых. Данные | Год: 2022, Том: 30, Номер: 9, Страницы: 626-633 Страниц : 8 DOI: 10.1002/jcd.21849 | ||
| Ключевые слова | embedding; Latin cube; Latin square; MDS code; MOLS | ||
| Авторы |
|
||
| Организации |
|
Информация о финансировании (1)
| 1 | Институт математики им. С.Л. Соболева СО РАН | 0314-2019-0017 |
Реферат:
An embedding of a code is a mapping that preserves distances between codewords. We prove that any code with code distance (Formula presented.) and length (Formula presented.) can be embedded into an maximum distance separable (MDS) code with the same code distance and length but under a larger alphabet. As a corollary we obtain embeddings of systems of partial mutually orthogonal Latin cubes and (Formula presented.) -ary quasigroups. © 2022 Wiley Periodicals LLC.
Библиографическая ссылка:
Potapov V.N.
Embedding in MDS codes and Latin cubes
Journal of Combinatorial Designs. 2022. V.30. N9. P.626-633. DOI: 10.1002/jcd.21849 WOS Scopus РИНЦ OpenAlex
Embedding in MDS codes and Latin cubes
Journal of Combinatorial Designs. 2022. V.30. N9. P.626-633. DOI: 10.1002/jcd.21849 WOS Scopus РИНЦ OpenAlex
Идентификаторы БД:
| Web of science: | WOS:000812922000001 |
| Scopus: | 2-s2.0-85132157946 |
| РИНЦ: | 49149483 |
| OpenAlex: | W3202734945 |