|
|||||
|
|
Improved Upper Bounds for the Rate of Separating and Completely Separating Codes |
|
| Authors: | Vorob’ev I. V. Lebedev V. S. |
| Affiliation: | 1.Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russia ;2.Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia ; |
| Abstract: | Problems of Information Transmission - A binary code is said to be an $$(s,ell)$$ -separating code if for any two disjoint sets of its codewords of cardinalities at most $$s$$ and $$ell$$... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |