|
Coding Theory
Improved upper bounds for the rate of separating and completely separating codes
I. V. Vorob'eva, V. S. Lebedevb a Skolkovo Institute of Science and Technology
b Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow
Received: 14.04.2022 Revised: 28.07.2022 Accepted: 30.07.2022
Citation:
I. V. Vorob'ev, V. S. Lebedev, “Improved upper bounds for the rate of separating and completely separating codes”, Probl. Peredachi Inf., 58:3 (2022), 45–57
Linking options:
https://www.mathnet.ru/eng/ppi2374 https://www.mathnet.ru/eng/ppi/v58/i3/p45
|
Statistics & downloads: |
Abstract page: | 68 | Full-text PDF : | 1 | References: | 14 | First page: | 13 |
|