Bounds on the rate of disjunctive codes
From MaRDI portal
Publication:2262991
DOI10.1134/S0032946014010037zbMath1321.94124arXiv1401.0050OpenAlexW3101529480MaRDI QIDQ2262991
V. Yu. Shchukin, Nikita Polyanskii, Arkadii G. D'yachkov, I. V. Vorob'ev
Publication date: 17 March 2015
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.0050
Related Items (17)
List decoding for a multiple access hyperchannel ⋮ Almost cover-free codes ⋮ Almost Optimal Cover-Free Families ⋮ Lower bounds for cover-free families ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Unnamed Item ⋮ Strict group testing and the set basis problem ⋮ Cover-free codes and separating system codes ⋮ Symmetric disjunctive list-decoding codes ⋮ Almost cover-free codes and designs ⋮ Almost separable matrices ⋮ Bounds on the rate of separating codes ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Separable collusion-secure multimedia codes ⋮ Sampling schemes and recovery algorithms for functions of few coordinate variables ⋮ Almost disjunctive list-decoding codes
Cites Work
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- On the construction of \((w,r)\) cover-free codes
- Nonadaptive algorithms for threshold group testing
- Key storage in secure networks
- New bounds for union-free families of sets
- Bounds on the average error probability for a code ensemble with fixed composition
- Some new bounds for cover-free families
- Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
- Interval Packing and Covering in the Boolean Lattice
- On optimal superimposed codes
- New constructions of superimposed codes
- Superimposed Codes and Threshold Group Testing
- Nonrandom binary superimposed codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds on the rate of disjunctive codes
