RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1981 Volume 17, Issue 2, Pages 26–38 (Mi ppi1390)
This article is cited in 4 papers

Information Theory and Coding Theory

On a Coding Model for a Multiple-Access Adder Channel

A. G. D'yachkov, V. V. Rykov


Abstract: Upper and lower bounds are obtained for the length of an optimal code with zero error probability being some coding model for a multiple-access adder channel.

UDC: 621.391.15

Received: 11.04.1979
Revised: 03.04.1980


 English version: Problems of Information Transmission, 1981, 17:2, 94–104

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025