|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
On codes with distances $d$ and $n$
P. Boyvalenkova, K. Delcheva, V. A. Zinov'evb, D. V. Zinov'evb a Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
b Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow
Received: 14.11.2022 Revised: 25.11.2022 Accepted: 28.11.2022
Citation:
P. Boyvalenkov, K. Delchev, V. A. Zinov'ev, D. V. Zinov'ev, “On codes with distances $d$ and $n$”, Probl. Peredachi Inf., 58:4 (2022), 62–83
Linking options:
https://www.mathnet.ru/eng/ppi2384 https://www.mathnet.ru/eng/ppi/v58/i4/p62
|
Statistics & downloads: |
Abstract page: | 133 | Full-text PDF : | 1 | References: | 34 | First page: | 22 |
|