Capacity of a communication channel with inner random coding

MaRDI QIDQ1310721zbMATH OpenFDO

Authors V. I. Korzhik, V. A. Yakovlev

Publication date 8 March 1994

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

capacityextended channel

Mathematics Subject Classification ID

Communication theory (94A05)

Recommendations

• The capacity of binary channels that use linear codes and decoders
• Random coding theorems for the general discrete memoryless broadcast channel
• Bounds on E-capacity of a channel with a random parameter
• Capacity of dimension-limited channels
• On the method of random coding

Cited in

(3)

• Capacity-Achieving Guessing Random Additive Noise Decoding
• The capacity of coded systems
• Random coding theorems for the general discrete memoryless broadcast channel

This page was built for publication: Capacity of a communication channel with inner random coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310721)