Constructions of Protocol Sequences for Multiple Access Collision Channel without Feedback

L. Györfi, Istvaá Vajda

Research output: Article

43 Citations (Scopus)

Abstract

Constructions of protocol sequences for multiple-access collision channel without feedback are given. These constructions are the extensions of those described by A, Györfi, 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.

Original languageEnglish
Pages (from-to)1762-1765
Number of pages4
JournalIEEE Transactions on Information Theory
Volume39
Issue number5
DOIs
Publication statusPublished - 1993

Fingerprint

Feedback
Network protocols
Reed-Solomon codes

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Library and Information Sciences
  • Electrical and Electronic Engineering

Cite this

@article{6fd801e892a148a7b7264a11321a4a22,
title = "Constructions of Protocol Sequences for Multiple Access Collision Channel without Feedback",
abstract = "Constructions of protocol sequences for multiple-access collision channel without feedback are given. These constructions are the extensions of those described by A, Gy{\"o}rfi, 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.",
keywords = "BCH codes, collision channel, constant-weight codes, cyclically permutable codes, protocol sequences",
author = "L. Gy{\"o}rfi and Istva{\'a} Vajda",
year = "1993",
doi = "10.1109/18.259673",
language = "English",
volume = "39",
pages = "1762--1765",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Constructions of Protocol Sequences for Multiple Access Collision Channel without Feedback

AU - Györfi, L.

AU - Vajda, Istvaá

PY - 1993

Y1 - 1993

N2 - Constructions of protocol sequences for multiple-access collision channel without feedback are given. These constructions are the extensions of those described by A, Györfi, 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.

AB - Constructions of protocol sequences for multiple-access collision channel without feedback are given. These constructions are the extensions of those described by A, Györfi, 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.

KW - BCH codes

KW - collision channel

KW - constant-weight codes

KW - cyclically permutable codes

KW - protocol sequences

UR - http://www.scopus.com/inward/record.url?scp=0027662964&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027662964&partnerID=8YFLogxK

U2 - 10.1109/18.259673

DO - 10.1109/18.259673

M3 - Article

VL - 39

SP - 1762

EP - 1765

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

ER -