By Topic

Average Stopping Set Weight Distributions of Redundant Random Ensembles

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

1 Author(s)
Tadashi Wadayama ; Nagoya Inst. of Technol., Nagoya

In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binary matrices with linearly dependent rows. These linearly dependent rows significantly reduce the number of stopping sets (SS) of small size. Upper and lower bounds on the average SS weight distribution of the redundant random ensembles are proved based on a combinatorial argument. Asymptotic forms of these bounds reveal asymptotic behavior of the average SS weight distributions. From these bounds, a tradeoff between the number of redundant rows (corresponding to decoding complexity of belief propagation on binary erasure channel) and the average SS weight distribution (corresponding to decoding performance) can be derived.

Published in:

IEEE Transactions on Information Theory  (Volume:54 ,  Issue: 11 )