Constructions of Protocol Sequences for Multiple-access Collision Channel Without Feedback

Gyorfi, L [Györfi, László (Matematika), szerző]; Vajda, I [Vajda, István (Kriptográfia), szerző]

Angol nyelvű Tudományos Szakcikk (Folyóiratcikk)
Megjelent: IEEE TRANSACTIONS ON INFORMATION THEORY 0018-9448 39 (5) pp. 1762-1765 1993
    Azonosítók
    Szakterületek:
      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. 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.
      Hivatkozás stílusok: IEEEACMAPAChicagoHarvardCSL
      2020-03-28 09:52