Constructive Bounds on the Capacity of Parallel Asynchronous Skew-Free Channels With Glitches

DOI10.1109/TIT.2019.2956540MaRDI QIDQ5124413zbMATH OpenOpenAlexFDO

Authors Shlomo Engelberg, Osnat Keren

Publication date 29 September 2020

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

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

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• A Note on Parallel Asynchronous Channels With Arbitrary Skews
• Capacity bounds for a channel with synchronization errors
• Reliable Communications Across Parallel Asynchronous Channels With Arbitrary Skews
• On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels
• On the Capacity of Channels With Timing Synchronization Errors
• Bounds on the Capacity of Discrete Memoryless Channels Corrupted by Synchronization and Substitution Errors
• On capacity regions of discrete asynchronous multiple access channels
• Asymptotics of Input-Constrained Erasure Channel Capacity
• Asymptotics of input-constrained binary symmetric channel capacity
• Minimum probability of error for asynchronous Gaussian multiple-access channels

Cited in

(2)

• Upper bounds and constructions of complete asynchronous channel hopping systems
• A Note on Parallel Asynchronous Channels With Arbitrary Skews

This page was built for publication: Constructive Bounds on the Capacity of Parallel Asynchronous Skew-Free Channels With Glitches

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