List decoding for a multiple access hyperchannel
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3831842 (Why is no real title available?)
- scientific article; zbMATH DE number 4135867 (Why is no real title available?)
- scientific article; zbMATH DE number 4106771 (Why is no real title available?)
- scientific article; zbMATH DE number 1421000 (Why is no real title available?)
- Almost disjunctive list-decoding codes
- Binary representations of underdetermined data and superimposed codes
- Bounds on the rate of disjunctive codes
- Collusion-secure fingerprinting for digital data
- Frameproof Codes
- Information theory. Coding theorems for discrete memoryless systems
- Multiple-access hyperchannel
- New Bounds on Separable Codes for Multimedia Fingerprinting
- New constructions of superimposed codes
- Nonrandom binary superimposed codes
- On generalized separating hash families
- Probabilistic Existence Results for Separable Codes
- Symmetric disjunctive list-decoding codes
Cited in
(6)- Symmetric disjunctive list-decoding codes
- A coding theorem for multiple access channels using a maximum likelihood list decoding scheme
- List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability
- List-Decoding for the Arbitrarily Varying Channel Under State Constraints
- Seminoisy deterministic multiple-access channels: coding theorems for list codes and codes with feedback
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
This page was built for publication: List decoding for a multiple access hyperchannel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364452)