RUS  ENG
Full version
JOURNALS // Proceedings of the Yerevan State University, series Physical and Mathematical Sciences // Archive

Proceedings of the YSU, Physical and Mathematical Sciences, 2012 Issue 2, Pages 14–21 (Mi uzeru131)

Mathematics

Code volume boundaries in the additive channel

V. K. Leont'eva, G. L. Movsisyanb, Zh. G. Margaryanc

a Computer Centre, Russian Academy of Sciences, Moscow, Russia
b BIT Group, Moscow, Russia
c Chair of Discrete Mathematics and Theoretical Informatics YSU, Armenia

Abstract: One of the problems in the theory of coding is the code building of a maximum volume for the proposed additive channel. In this paper we have found and consequently presented the upper and the lower bounds for the code volume, which corrects the errors of the additive channel.

Keywords: additive channel, upper and lower bounds, error-correcting.

Received: 05.04.2012
Accepted: 05.06.2012

Language: English



© Steklov Math. Inst. of RAS, 2024