Close category search window
 

Decoding complement-closed codes with coordinate-disjoint decomposition

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 $31
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

4 Author(s)
Ma, S. ; Dept. of Electr. Eng., Akron Univ., OH, USA ; Zhou, H. ; Chen, C.S. ; Yuan, J.

Presents a multilayer neural net decoder for a group of linear block codes with complement-closedness (CC) property. Many well known linear block codes such as Hamming and Golay all fall into this group. A method called coordinate-disjoint decomposition (CDD) is introduced, and it is shown that this method leads to a minimised decoder structure. Coordinate-disjoint decomposition of Hamming (2 r-1, 2 r-r-1) and extended Hamming (2 r, 2 r-r-1) codes, Golay (24, 12) code, as well as quadratic residue (32, 16) code are illustrated, together with their corresponding decoder structures.<>

Published in:
Communications, Speech and Vision, IEE Proceedings I  (Volume:139 ,  Issue: 5 )

Date of Publication: Oct. 1992

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.