By Topic

On binary majority-logic decodable codes (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

2 Author(s)
S. Shiva ; Univ. of Ottawa, Ottawa, Ont., Canada ; S. Tavares

Let V\prime be a binary (n,k) majority-logic decodable code with g\prime (X) as its generator polynomial and odd minimum distance d . Let V be the (n, k - 1) subset code generated by g\prime (X)(1 + X ). This correspondence shows that V is majority-logic deeodable with d + 1 orthogonal estimates. This fact is useful in the simultaneous correction of random errors and erasures.

Published in:

IEEE Transactions on Information Theory  (Volume:20 ,  Issue: 1 )