Universal Communication—Part II: Channels With Memory

DOI10.1109/TIT.2014.2321744zbMATH Open1360.94026OpenAlexW2039975316MaRDI QIDQ2986245FDOQ2986245

Authors: Yuval Lomnitz, Meir Feder 

Publication date: 16 May 2017

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

Full work available at URL: https://doi.org/10.1109/tit.2014.2321744

Recommendations

• Universal decoding for channels with memory
• Universal Communication—Part I: Modulo Additive Channels
• Universal Communication Over Arbitrarily Varying Channels
• scientific article; zbMATH DE number 2154512
• Universal decoding for memoryless Gaussian channels with a deterministic interference
• scientific article; zbMATH DE number 3937097
• Relative-redundancy universal coding of memoryless sources
• Models of information \(K\)-channels with memory
• Optimization of Information Rate Upper and Lower Bounds for Channels With Memory
• Simulation-Based Computation of Information Rates for Channels With Memory

Mathematics Subject Classification ID

Communication theory (94A05) Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40)

This page was built for publication: Universal Communication—Part II: Channels With Memory

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