By Topic

On the Undetected Error Probability of Binary Matrix 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
$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)
Wadayama, T. ; Nagoya Inst. of Technol., Nagoya, Japan

In this paper, an ensemble analysis of the undetected error probability of a standard error detection scheme based on a sparse binary parity check matrix is presented. The Bernoulli ensemble, the members of which are considered to be matrices generated from an i.i.d. Bernoulli source, is primarily considered herein. The main contributions of the present study are (i) the derivation of the error exponent of the average undetected error probability and (ii) closed form expressions for the variance of the undetected error probability. The behavior of the exponent for an ensemble of sparse matrices is shown to be somewhat different from that for an ensemble of dense matrices. Furthermore, as a byproduct of the proof of the variance formula, a simple covariance formula of the weight distribution is derived.

Published in:

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