By Topic

Constructing Proper Codes for Error Detection

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)
Klove, T. ; Dept. of Inf., Univ. of Bergen, Bergen, Norway

It is shown that for any alphabet size q and any code size M, there exist proper codes for error detection on a q-ary symmetric channel for all sufficiently large lengths. The stronger condition zero-strong proper code is defined. It is shown that such codes can only exist for q dividing M, and if this is the case they are shown to exist for sufficiently large lengths. The existence proofs are constructive.

Published in:

Information Theory, IEEE Transactions on  (Volume:55 ,  Issue: 8 )