|
|
Problemy Peredachi Informatsii, 1983, Volume 19, Issue 3, Pages 12–21
(Mi ppi1184)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Information Theory and Coding Theory
Coding in an Asynchronous Multiple-Access Channel
G. Sh. Poltyrev
Abstract:
The capacity region for a discrete memoryless channel with asynchronous multiple access is determined. An upper bound is established for the decoding-error probability for lattice codes in the case of Viterbi-algorithm decoding in discrete memoryless channels with synchronous and asynchronous multiple access.
Received: 01.07.1981
Citation:
G. Sh. Poltyrev, “Coding in an Asynchronous Multiple-Access Channel”, Probl. Peredachi Inf., 19:3 (1983), 12–21; Problems Inform. Transmission, 19:3 (1983), 184–191
Linking options:
https://www.mathnet.ru/eng/ppi1184 https://www.mathnet.ru/eng/ppi/v19/i3/p12
|
|