By Topic

Combinatorial aspects of orthogonal parity checks (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
$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

2 Author(s)

The notion of supplementary difference sets is used to construct codes which are one-step majority logic decodable using orthogonal parity checks. An infinite family of single and double error-correcting codes is constructed. Strong evidence is given which suggests that there exists an analogous infinite family of triple error-correcting codes.

Published in:

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