CODE VOLUME BOUNDARIES IN THE ADDITIVE CHANNEL
DOI:
https://doi.org/10.46991/PYSU:A/2012.46.2.014Keywords:
additive channel, upper and lower bounds, error-correctingAbstract
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
Issue
Section
Mathematics
License
Copyright (c) 2012 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.