By Topic

An upper bound on the distribution of computation of a sequential decoder for multiple-access channels

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
$31 $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

1 Author(s)
Balakirsky, V.B. ; Dept. of Inf. Theory, Lund Univ., Sweden

The computational distribution of sequential decoding for discrete memoryless multiple-access channels is examined. It is shown that all possible collections of incorrect paths in the code tree may be described by bipartite graphs. Using this fact and a new decoding metric it is proved that the number of computations in the first incorrect subtree is a Paretean random variable, and that the parameter of the Pareto distribution is estimated similarly to the parameter for systems of information transmission with one source

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 2 )