DocumentCode
936753
Title
Trellis coding for a multiple-access channel (Corresp.)
Author
Sorace, Ron
Volume
29
Issue
4
fYear
1983
fDate
7/1/1983 12:00:00 AM
Firstpage
606
Lastpage
611
Abstract
A general trellis coding scheme has been described previously for error control of 
simultaneous users of a discrete memoryless multiple-access channel. A new random coding performance bound for this trellis coding is given in an algebraic form. Since this bound lacks ease of computation, a transfer function bound is derived as a more tractable alternative.
simultaneous users of a discrete memoryless multiple-access channel. A new random coding performance bound for this trellis coding is given in an algebraic form. Since this bound lacks ease of computation, a transfer function bound is derived as a more tractable alternative.Keywords
Multiaccess communication; Trellis coding; Convolutional codes; Degradation; Error correction; Frequency shift keying; Information theory; Interference channels; Multiple access interference; Notice of Violation; Reliability theory; Time sharing computer systems;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1983.1056698
Filename
1056698
Link To Document