By Topic

Using codes for error correction and detection (Corresp.)

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)

A linear code C over GF (q) is good for t -error-correction and error detection if P(C,t;\epsilon) \leq P(C,t;(q - 1)/q) for all \epsilon, 0 \leq \epsilon \leq (q - 1)/q , where P(C, t; \epsilon) is the probability of an undetected error after a codeword in C is transmitted over a q -ary symmetric channel with error probability \epsilon and correction is performed for all error patterns with t or fewer errors. A sufficient condition for a code to be good is derived. This sufficient condition is easy to check, and examples to illustrate the method are given.

Published in:

Information Theory, IEEE Transactions on  (Volume:30 ,  Issue: 6 )