|
Problemy Peredachi Informatsii, 2004, Volume 40, Issue 3, Pages 13–20
(Mi ppi139)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Coding Theory
On the Optimality of Trivial $(w,r)$ Cover-Free Codes
H. K. Kima, V. S. Lebedevb a Pohang University of Science and Technology
b Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
A $(w,r)$-cover-free code is the incidence matrix of a family of sets where no intersection of $w$ members of the family is covered by the union of $r$ others. We obtain a new condition in view of which $(w,r)$-cover-free codes with a simple structure are optimal. We also introduce $(w,r)$-cover-free codes with a constraint set.
Received: 23.12.2003 Revised: 24.05.2004
Citation:
H. K. Kim, V. S. Lebedev, “On the Optimality of Trivial $(w,r)$ Cover-Free Codes”, Probl. Peredachi Inf., 40:3 (2004), 13–20; Problems Inform. Transmission, 40:3 (2004), 195–201
Linking options:
https://www.mathnet.ru/eng/ppi139 https://www.mathnet.ru/eng/ppi/v40/i3/p13
|
Statistics & downloads: |
Abstract page: | 355 | Full-text PDF : | 144 | References: | 62 |
|