On the optimality of trivial \((w,r)\)-cover-free codes

DOI10.1023/B:PRIT.0000044255.42299.4fzbMath1088.94028OpenAlexW2047892428MaRDI QIDQ1776203

Niranjan Chakravarthy

Publication date: 23 May 2005

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:prit.0000044255.42299.4f

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial codes (94B25)

Related Items (2)

Superimposed Codes and Threshold Group Testing ⋮ Some new bounds for cover-free families through biclique covers

This page was built for publication: On the optimality of trivial \((w,r)\)-cover-free codes