An Optimal Algorithm for Q-ary Error-Correcting Feedback Codes with Limited Magnitude
Prof. Vladimir Lebedev
Institute for Information Transmission Problems in Moscow
We consider special q-ary asymmetric error-correcting codes with feedback and give a coding algorithm. We give the capacity-error-function for these channels.
The channels we consider are generalizations of the Z-channel and are special cases of q-ary Varshamov channels. This coding algorithm is also a search algorithm for an extension of the Renyi-Ulam-Berlekamp game.
Vladimir Lebedev received the M.S. in Mathematics degree in mathematics from the Lomonosov State University, Moscow, Russia, in 1987, and the Ph.D. in Mathematics degree from the Moscow Institute of Electronics and Mathematics, Moscow, Russia, in 1996. Since 1996 he is Associate Professor at the Institute for Information Transmission Problems in Moscow. He was co-organizer of severals "Workshop on Algebraic and Combinatorial Coding Theory (ACCT)" in Bulgaria and Russia. His main research activities are the development of non-adaptive group testing theory, the development of coding theory with feedback and the investigations of adaptive and non-adaptive combinatorial search models.