CODE VOLUME BOUNDARIES IN THE ADDITIVE CHANNEL

Zh.G. Margaryan

Received N/A; revised N/A; accepted N/A

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

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.

Author(s)

Related Articles

ON UNIQUENESS OF HOLOMORPHIC AND BOUNDED OUTSIDE THE CLOSED LOGARITHMIC SECTOR FUNCTIONS REPRESENTABLE BY LACUNARY POWER SERIES

COMPUTER DETECTING AND PROCESSING OF THE SIGNALS OF A FLAT-COIL ABSOLUTE-POSITION SENSOR BASED SEISMIC DETECTOR

ON q-LATTICES AND q-ALGEBRAS

ON INCREASING HAZARD RATE OF WAITING TIME IN THE ||1|∞MG MODEL

ON DISTRIBUTION’S CONSTANT SLOWLY VARYING COMPONENT

CODE VOLUME BOUNDARIES IN THE ADDITIVE CHANNEL

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter