Complexity of decoders--I: Classes of decoding rules

Several classes of decoding rules are considered here including block decoding rules, tree decoding rules, and bounded-distance and minimum-distance decoding rules for binary parity-check codes. Under the assumption that these rules are implemented with combinational circuits and sequential machines...

Full description

Bibliographic Details

Published in:	IEEE transactions on information theory Vol. 15; no. 6; pp. 689 - 695
Main Author:	Savage, J.
Format:	Journal Article
Language:	English
Published:	IEEE 01.11.1969
Subjects:	Circuits Codes Combinational circuits Complexity theory Decoding Inverters Logic Logic gates Parity check codes Wires
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!