Abstract
Error detection is a crucial process in an information transmission protocol like TCP for attaining reliable communications over unreliable channels. The most important performance measure for an error detection scheme is its undetected error probability, which is the probability corresponding to the event such that an erroneous received word passes the detection test. The paper reviews the author's results on an analysis of the undetected error probability of ensembles of m × n binary matrices. The ensemble of binary sparse matrices called the Bernoulli ensemble whose members are considered as matrices generated from i.i.d. Bernoulli source is mainly discussed here. The error exponent of the average undetected error probability and closed form expressions for the variance of the undetected error probability will be presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
