By Topic

The undetected error probability threshold of m-out-of-n codes

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

3 Author(s)
Fang-Wei Fu ; Dept. of Math., Nankai Univ., Tianjin, China ; Klove, T. ; Shu-Tao Xia

The well-known m-out-of-n code Ωnm consists of all binary vectors of length n and weight m. It is known that it is good for error detection (in the technical sense, that is, the probability of undetected error Pudn m,p)⩽Pudnm,1/2) for all p, 0⩽p⩽1/2) only for a few small values of m and n. It is therefore of interest to determine (bounds for) the threshold in general, that is, find the range of bit-error probabilities p for which Pudnm,p)⩽Pudnm,1/2). In this article such bounds are given

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 4 )