DocumentCode
3009435
Title
Generalized time sharing for multiple access channels
Author
Rimoldi, Bixio
Author_Institution
Washington Univ., Seattle, WA, USA
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
26
Abstract
A new technique is described that can be used in lieu of time sharing (of codewords) to prove that certain convex combinations of points belonging to the capacity region of an asynchronous multiple-access channel are also achievable. The key aspect of this technique, called generalized time sharing, is that it does not require that transmitters be synchronized
Keywords
channel capacity; codes; decoding; discrete systems; memoryless systems; multi-access systems; time-sharing systems; asynchronous multiple-access channel; capacity region; codewords; convex points combination; decoding; discrete memoryless multiple-access channel; generalized time sharing; scheduling sequence; transmitters; Books; Code standards; Decoding; Time sharing computer systems; Transmitters;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.612941
Filename
612941
Link To Document