Codes for Error Detection
Modern Coding Theory
Efficient encoding of low-density parity-check codes
IEEE Transactions on Information Theory
On ensembles of low-density parity-check codes: asymptotic distance distributions
IEEE Transactions on Information Theory
Distance distributions in ensembles of irregular low-density parity-check codes
IEEE Transactions on Information Theory
Asymptotic enumeration methods for analyzing LDPC codes
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
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.