Simple Coding Techniques for Many-Hop Relaying

DOI10.1109/TIT.2022.3180001MaRDI QIDQ6195751zbMATH OpenOpenAlexFDO

Authors Yan Hao Ling, Jonathan Scarlett

Publication date 14 March 2024

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

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

zbMATH Keywords

relay channelsinformation velocitynetwork information theorymany-hop relaying

Mathematics Subject Classification ID

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

Abstract: In this paper, we study the problem of relaying a single bit of information across a series of binary symmetric channels, and the associated trade-off between the number of hops $m$, the transmission time $n$, and the error probability. We introduce a simple, efficient, and deterministic protocol that attains positive information velocity (i.e., a non-vanishing ratio $fracmn$ and small error probability) and is significantly simpler than existing protocols that do so. In addition, we characterize the optimal low-noise and high-noise scaling laws of the information velocity, and we adapt our 1-bit protocol to transmit $k$ bits over $m$ hops with $O(m+k)$ transmission time.

This page was built for publication: Simple Coding Techniques for Many-Hop Relaying

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