An Efficient Feedback Coding Scheme With Low Error Probability for Discrete Memoryless Channels

DOI10.1109/TIT.2015.2428234zbMATH Open1359.94427arXiv1311.0100OpenAlexW1975231568MaRDI QIDQ2977397

Author name not available (Why is that?)

Publication date: 28 April 2017

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

Abstract: Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk--Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are difficult to analyze (posterior matching). This paper introduces a new fixed-length feedback coding scheme which achieves the capacity for all discrete memoryless channels, has an error exponent that approaches the sphere packing bound as the rate approaches the capacity, and has $O(nlogn)$ coding complexity. These benefits are achieved by judiciously combining features from previous schemes with new randomization technique and encoding/decoding rule. These new features make the analysis of the error probability for the new scheme easier than for posterior matching.

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

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05) Source coding (94A29)

Related Items (4)

A note on tailbiting codes and their feedback encoders ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Fast iterative coding techniques for feedback channels

This page was built for publication: An Efficient Feedback Coding Scheme With Low Error Probability for Discrete Memoryless Channels

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