The Minimum Distance of Turbo-Like Codes

Worst-case upper bounds are derived on the minimum distance of parallel concatenated turbo codes, serially concatenated convolutional codes, repeat-accumulate codes, repeat-convolute codes, and generalizations of these codes obtained by allowing nonlinear and large-memory constituent codes. It is sh...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2009-01, Vol.55 (1), p.6-15
Hauptverfasser:	Bazzi, L., Mahdian, M., Spielman, D.A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Accumulators Applied sciences Asymptotic growth Asymptotic methods Asymptotic properties Automata Coders Codes Coding, codes Computer science Concatenated codes Convolutional codes Encoders Exact sciences and technology Information theory Information, signal and communications theory Mathematics minimum distance Permutations Random number generation repeat-accumulate-accumulate (RAA) codes Signal and communications theory Telecommunications and information theory Turbo codes Upper bound Upper bounds
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!