|
Problemy Peredachi Informatsii, 1981, Volume 17, Issue 2, Pages 26–38
(Mi ppi1390)
|
|
|
|
This article is cited in 4 scientific papers (total 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.
Received: 11.04.1979 Revised: 03.04.1980
Citation:
A. G. D'yachkov, V. V. Rykov, “On a Coding Model for a Multiple-Access Adder Channel”, Probl. Peredachi Inf., 17:2 (1981), 26–38; Problems Inform. Transmission, 17:2 (1981), 94–104
Linking options:
https://www.mathnet.ru/eng/ppi1390 https://www.mathnet.ru/eng/ppi/v17/i2/p26
|
Statistics & downloads: |
Abstract page: | 372 | Full-text PDF : | 187 |
|