✦ LIBER ✦

Permutation fixed points with application to estimation of minimum distance of turbo codes

✍ Scribed by Daneshgaran, F.; Mondin, M.

Book ID: 114541734
Publisher: IEEE
Year: 2000
Tongue: English
Weight: 286 KB
Volume: 46
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.887848

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Estimating the minimum distance of turbo

Estimating the minimum distance of turbo-codes using double and triple impulse methods

✍ Crozier, S.; Guinand, P.; Hunt, A. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 372 KB

Estimating the minimum distance of large

Estimating the minimum distance of large-block turbo codes using iterative multiple-impulse methods

✍ Crozier, Stewart ;Guinand, Paul ;Hunt, Andrew 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 2 views

## Abstract A difficult problem for turbo codes is the efficient and accurate determination of the distance spectrum, or even just the minimum distance, for specific interleavers. This is especially true for large blocks, with many thousands of data bits, if the distance is high. This paper compare

A Fast Algorithm to Estimate the Distanc

A Fast Algorithm to Estimate the Distance Spectrum of Turbo Codes and Tail-Biting Turbo Codes

✍ Sandro Scalise; Harald Ernst; Young-Jik Ko Bae 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 492 KB

On the High Density Behavior of Hamming

On the High Density Behavior of Hamming Codes with Fixed Minimum Distance

✍ Giorgio Parisi; Francesco Zamponi 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 514 KB

Computing the free distance of turbo cod

Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications

✍ Garello, R.; Pierleoni, P.; Benedetto, S. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 274 KB

On the minimum distance of low-density p

On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices

✍ A. Sridharan; M. Lentmaier; D. V. Truhachev; D. J. Costello; K. Sh. Zigangirov 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 186 KB