Capacity of the arbitrarily varying channel under list decoding
From MaRDI portal
Publication:1925350
zbMATH Open0901.94018MaRDI QIDQ1925350FDOQ1925350
Authors: Yanyan Li
Publication date: 19 August 1998
Published in: Problems of Information Transmission (Search for Journal in Brave)
Recommendations
Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40) Theory of error-correcting codes and error-detecting codes (94B99)
Cited In (9)
- The secrecy capacity of the arbitrarily varying wiretap channel under list decoding
- Elimination of correlation in random codes for arbitrarily varying channels
- The smallest list for the arbitrarily varying channel
- List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability
- List-Decoding for the Arbitrarily Varying Channel Under State Constraints
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
- List decoding
- Capacity and decoding rules for classes of arbitrarily varying channels
- Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior
This page was built for publication: Capacity of the arbitrarily varying channel under list decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925350)