Coding with Noiseless Feedback over the Z-channel

DOI10.1007/978-3-030-58150-3_8arXiv2007.04026MaRDI QIDQ6344666FDOQ6344666

Authors: Christian Deppe, Vladimir Lebedev, Georg Maringer, Nikita Polyanskii 

Publication date: 8 July 2020

Abstract: In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the combinatorial setting where the maximum number of errors inflicted by an adversary is proportional to the number of transmissions, which goes to infinity. Without feedback, it is known that the rate of optimal asymmetric-error-correcting codes for the error fraction $auge1/4$ vanishes as the blocklength grows. In this paper, we give an efficient feedback encoding scheme with $n$ transmissions that achieves a positive rate for any fraction of errors $au<1$ and $noinfty$. Additionally, we state an upper bound on the rate of asymptotically long feedback asymmetric error-correcting codes.

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

This page was built for publication: Coding with Noiseless Feedback over the Z-channel

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