Random coding theorems for the general discrete memoryless broadcast channel

DOI10.1109/TIT.1975.1055347MaRDI QIDQ4071152zbMATH OpenFDO

Authors Edward C. van der Meulen

Publication date 1975

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1975.1055347

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Random-coding bounds for some broadcast channels
• An achievable rate region for the broadcast channel
• Capacity of a communication channel with inner random coding
• An outer bound to the capacity region of broadcast channels (Corresp.)
• Capacity results for the discrete memoryless network

Cited in

(15)

• Random-coding bounds for some broadcast channels
• Multiple-user communication
• Capacity region of degraded broadcast channels with feedback
• Capacity of a communication channel with inner random coding
• scientific article; zbMATH DE number 3677726 (Why is no real title available?)
• An achievable rate region for the broadcast channel
• scientific article; zbMATH DE number 3557671 (Why is no real title available?)
• An outer bound to the capacity region of broadcast channels (Corresp.)
• scientific article; zbMATH DE number 575639 (Why is no real title available?)
• Capacity results for the discrete memoryless network
• scientific article; zbMATH DE number 3799555 (Why is no real title available?)
• scientific article; zbMATH DE number 3321830 (Why is no real title available?)
• On the coding theorem and its converse for finite-memory channels
• Capacity region of a new bus communication model
• General theory of information transfer: Updated

This page was built for publication: Random coding theorems for the general discrete memoryless broadcast channel

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