Constructions of protocol sequences for multiple access collision channel without feedback

Constructions of protocol sequences for multiple access collision channel without feedback

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 b...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 1993-09, Vol.39 (5), p.1762-1765
Hauptverfasser: Gyorfi, L., Vajda, I.
Format: Artikel
Sprache:eng
Schlagworte:
Access protocols
Applied sciences
Block codes
Coding, codes
Communication channels
Exact sciences and technology
Feedback
Galois fields
Hamming distance
Information theory
Information, signal and communications theory
Reed-Solomon codes
Road accidents
Signal and communications theory
Telecommunications and information theory
Traffic control
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.< >
ISSN:0018-9448
1557-9654
DOI:10.1109/18.259673