List decoding for a multiple access hyperchannel
From MaRDI portal
Publication:2364452
DOI10.1134/S0032946016040025zbMath1369.94600OpenAlexW2571198591MaRDI QIDQ2364452
Publication date: 21 July 2017
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946016040025
Related Items (1)
Cites Work
- Almost disjunctive list-decoding codes
- Symmetric disjunctive list-decoding codes
- Multiple-access hyperchannel
- Bounds on the rate of disjunctive codes
- On generalized separating hash families
- Probabilistic Existence Results for Separable Codes
- New Bounds on Separable Codes for Multimedia Fingerprinting
- Frameproof Codes
- New constructions of superimposed codes
- Collusion-secure fingerprinting for digital data
- Nonrandom binary superimposed codes
- Information Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: List decoding for a multiple access hyperchannel