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.
Problems of Information Transmission – Springer Journals
Published: Oct 27, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud