Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Algorithms for majority-logic check equations of maximal-length codes

Algorithms for majority-logic check equations of maximal-length codes

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

Further properties of maximal-length codes are briefly descnbed. These are shown to be of value in deriving the majority-logic check equations. Examples illustrating the effectiveness of the algorithms are given for (15, 4) and (31, 5) maximal-length codes.

Inspec keywords: majority logic; codes; subroutines

Subjects: Data handling techniques; Circuits and devices

References

    1. 1)
      • J.L. Massey . (1963) , Threshold decoding.
    2. 2)
      • W.W. Peterson , E.J. Weldon . (1972) , Error-correcting codes.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19690434
Loading

Related content

content/journals/10.1049/el_19690434
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address