This article is cited in 4 papers

Coding Theory

On the Optimality of Trivial $(w,r)$ Cover-Free Codes

H. K. Kim^a, V. S. Lebedev<sup>b

a</sup> 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.

UDC: 621.391.15

Received: 23.12.2003
Revised: 24.05.2004

 English version: Problems of Information Transmission, 2004, 40:3, 195–201

Bibliographic databases:

• 
•