A Note on Parallel Asynchronous Channels With Arbitrary Skews

DOI10.1109/TIT.2017.2747559MaRDI QIDQ4566562zbMATH OpenOpenAlexFDO

Authors Mladen Kovačević

Publication date 27 June 2018

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

Full work available at URL https://arxiv.org/abs/1710.09575

Mathematics Subject Classification ID

Communication theory (94A05)

Abstract: A zero-error coding scheme of asymptotic rate $lo{g}_2(1+sqrt5)-1$ was recently described for a communication channel composed of parallel asynchronous lines satisfying the so-called no switch assumption. We prove that this is in fact the highest rate attainable, i.e., the zero-error capacity of this channel.

Recommendations

• Reliable Communications Across Parallel Asynchronous Channels With Arbitrary Skews
• Constructive Bounds on the Capacity of Parallel Asynchronous Skew-Free Channels With Glitches
• Coding for tolerance and detection of skew in parallel asynchronous communications
• Coding in an asynchronous multiple-access channel
• An Overview of Capacity Results for Synchronization Channels
• Reliable communication across parallel asynchronous channels with glitches
• scientific article; zbMATH DE number 3693146
• On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels
• Signaling Over Arbitrarily Permuted Parallel Channels
• Making Asynchronous Distributed Computations Robust to Channel Noise

Cited in

(1)

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

This page was built for publication: A Note on Parallel Asynchronous Channels With Arbitrary Skews

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