CODE VOLUME BOUNDARIES IN THE ADDITIVE CHANNEL

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Submitted: 2025-02-19; Published: 2025-02-19

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

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.