CODE VOLUME BOUNDARIES IN THE ADDITIVE CHANNEL

V.K. lLeont'ev; G.L. Movsisyan; Zh.G. Margaryan

doi:10.46991/PYSU:A/2012.46.2.014

CODE VOLUME BOUNDARIES IN THE ADDITIVE CHANNEL

Authors

V.K. lLeont'ev Computer Centre, Russian Academy of Sciences, Moscow, Russia
G.L. Movsisyan BIT Group, Moscow, Russia
Zh.G. Margaryan Chair of Discrete Mathematics and Theoretical Informatics, YSU, Armenia

DOI:

https://doi.org/10.46991/PYSU:A/2012.46.2.014

Keywords:

additive channel, upper and lower bounds, error-correcting

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.

Downloads

Published

2012-05-10

How to Cite

lLeont’ev, V., Movsisyan, G., & Margaryan, Z. (2012). CODE VOLUME BOUNDARIES IN THE ADDITIVE CHANNEL. Proceedings of the YSU A: Physical and Mathematical Sciences, 46(2 (228), 14–21. https://doi.org/10.46991/PYSU:A/2012.46.2.014