By Topic

Constructions of protocol sequences for multiple access collision channel without feedback

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
L. Gyorfi ; Tech. Univ. Budapest, Hungary ; I. Vajda

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

Published in:

IEEE Transactions on Information Theory  (Volume:39 ,  Issue: 5 )