Coding Theory

Correcting a single error in an asymmetric feedback channel

I. V. Vorobyev^a, A. V. Lebedev^b, V. S. Lebedev<sup>b

a</sup> Chair of Theoretical Information Technology, Technical University of Munich, Munich, Germany
^b Kharkevich Institute for Information Transmission Problems of the Russian Academy of Sciences, Moscow, Russia

Abstract: We prove a new lower bound on the size of a code with complete feedback correcting a single error in a binary asymmetric channel. We also present an upper bound on the size of the code, which is close to the new lower bound.

Keywords: asymmetric channel, feedback, code construction.

UDC: 621.391 : 519.725

Received: 28.12.2023
Revised: 03.04.2024
Accepted: 03.04.2024

DOI: 10.31857/S0555292324010042

 English version: Problems of Information Transmission, 2024, 60:1, 21–27