The minimum distance of turbo-like codes

Authors:
Louay Bazzi;Mohammad Mahdian;Daniel A. Spielman
Affiliations:
Department of Electrical and Computer Engineering, American University of Beirut, Beirut, Lebanon;Yahoo! Research, Santa Clara, CA;Department of Computer Science, Yale University, New Haven, CT
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 5
Cited 3

Turbo codes: principles and applications

Turbo codes: principles and applications
Determinism versus nondeterminism for linear time RAMs with memory restrictions

Journal of Computer and System Sciences - STOC 1999
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding

IEEE Transactions on Information Theory
The serial concatenation of rate-1 codes through uniform random interleavers

IEEE Transactions on Information Theory
A logarithmic upper bound on the minimum distance of turbo codes

IEEE Transactions on Information Theory

Decoding turbo-like codes via linear programming

Journal of Computer and System Sciences - Special issue on FOCS 2002
Spectra and minimum distances of repeat multiple-accumulate codes

IEEE Transactions on Information Theory
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	754.90

Visualization

Abstract

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 shown that parallel-concatenated turbo codes and repeat-convolute codes with sub-linear memory are asymptotically bad. It is also shown that depth-two serially concatenated codes with constant-memory outer codes and sublinear-memory inner codes are asymptotically bad. Most of these upper bounds hold even when the convolutional encoders are replaced by general finite-state automata encoders. In contrast, it is proven that depth-three serially concatenated codes obtained by concatenating a repetition code with two accumulator codes through random permutations can be asymptotically good.