Almost disjunctive list-decoding codes
From MaRDI portal
Publication:259899
DOI10.1134/S0032946015020039zbMath1339.94085arXiv1407.2482OpenAlexW1600887176MaRDI QIDQ259899
I. V. Vorob'ev, Arkadii G. D'yachkov, V. Yu. Shchukin, Nikita Polyanskii
Publication date: 18 March 2016
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.2482
Related Items
List decoding for a multiple access hyperchannel ⋮ Almost cover-free codes ⋮ Symmetric 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
- New bounds for union-free families of sets
- Error probability bounds for two models of randomized design of elimination experiments
- Bounds for error probability for a symmetrical model in designing screening experiments
- Families of finite sets in which no set is covered by the union of two others
- The separating property of random matrices
- Multiple-access hyperchannel
- Bounds on the rate of disjunctive codes
- On a Design Problem for Screening Experiments
- New constructions of superimposed codes
- Nonrandom binary superimposed codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Almost disjunctive list-decoding codes