DocumentCode
1018294
Title
Constructions of protocol sequences for multiple access collision channel without feedback
Author
Gyorfi, Laszlo ; Vajda, Istvan
Author_Institution
Tech. Univ. Budapest, Hungary
Volume
39
Issue
5
fYear
1993
fDate
9/1/1993 12:00:00 AM
Firstpage
1762
Lastpage
1765
Abstract
Constructions of protocol sequences for multiple-access collision channel without feedback are given. These constructions are the extensions of those described by A, Gyorfi, and Massey (see ibid., vol.38, p. 940, May 1992). If the basic code in their constructions, a Reed-Solomon code, is replaced by a BCH code then the resulting protocol sequences have the feature that, for a given sum rate, the ratio of the total user population to the block length becomes much larger
Keywords
BCH codes; Reed-Solomon codes; multi-access systems; protocols; telecommunication channels; BCH code; Reed-Solomon code; block length; multiple access collision channel; protocol sequences; ratio; sum rate; total user population; Access protocols; Block codes; Communication channels; Feedback; Galois fields; Hamming distance; Information theory; Reed-Solomon codes; Road accidents; Traffic control;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.259673
Filename
259673
Link To Document