Suboptimal decoding of linear codes: Partition technique.

Gespeichert in:
Bibliographische Detailangaben
Titel: Suboptimal decoding of linear codes: Partition technique.
Autoren: Dumer, Ilya
Quelle: IEEE Transactions on Information Theory; Nov96, Vol. 42 Issue 6, p1971, 15p, 2 Graphs
Schlagwörter: CIPHERS
Abstract: Discusses the near-maximum-likelihood decoding of general symmetric channels. Definition of a class of suboptimal decoding algorithms based on an incomplete search through the code trellis; Bounds for concatenated codes; Complexity below the lower bounds on trellis complexity at a negligible expense in terms of decoding error probability.
Datenbank: Complementary Index
Beschreibung
Abstract:Discusses the near-maximum-likelihood decoding of general symmetric channels. Definition of a class of suboptimal decoding algorithms based on an incomplete search through the code trellis; Bounds for concatenated codes; Complexity below the lower bounds on trellis complexity at a negligible expense in terms of decoding error probability.
ISSN:00189448
DOI:10.1109/18.556688