Decoding complement-closed codes with coordinate-disjoint decomposition
- 1 January 1992
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings I Communications, Speech and Vision
- Vol. 139 (5) , 488-494
- https://doi.org/10.1049/ip-i-2.1992.0065
Abstract
This paper 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 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 (2r – 1, 2r – r – 1) and extended Hamming (2r, 2r – r – 1) codes, Golay (24, 12)ode, as well as quadratic residue (32, 16) code are illustrated, together with their corresponding decoder structures.Keywords
This publication has 1 reference indexed in Scilit:
- Analog decoding using neural networksAIP Conference Proceedings, 1986