Robust coding for multiple-access channels

DOI10.1109/TIT.1986.1057196zbMATH Open0607.94005MaRDI QIDQ3748191FDOQ3748191

Authors: Evaggelos Geraniotis 

Publication date: 1986

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

Recommendations

• Coding for a multiple-access channel
• scientific article; zbMATH DE number 3793938
• Orthogonal Codes for Robust Low-Cost Communication
• Coding in an asynchronous multiple-access channel
• Publication:4886144

zbMATH Keywords

uncertaintyblock codeschannel capacitytree codesChoquet capacitiescutoff rate regionsmaximum-likelihood decoding ruleminimax robust coding

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Cited In (6)

• On the p-point uncertainty class (Corresp.)
• Multiple-Access Channel With Partial and Controlled Cribbing Encoders
• Multiple-Access Network Information-Flow and Correction Codes
• Coding for a multiple access OR channel: A survey
• Joint Source and Channel Coding for MIMO Systems: Is it Better to be Robust or Quick?
• Orthogonal Codes for Robust Low-Cost Communication

This page was built for publication: Robust coding for multiple-access channels

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