A new upper bound on the minimum distance of turbo codes

被引：17

作者：

Perotti, A ^{[1
]}

Benedetto, S ^{[1
]}

机构：

[1] Politecn Torino, CERCOM, I-10129 Turin, Italy

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2004年 / 50卷 / 12期

关键词：

minimum distance; performance bounds; permutations; turbo codes;

D O I：

10.1109/TIT.2004.838358

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, a new upper bound on the minimum distance of turbo codes is derived. The new bound is obtained by construction of an undirected graph which reflects the characteristics of the constituent codes and the interleaver. The resulting expression shows that the minimum distance of a turbo code grows approximately with the base-3 logarithm of the information word length. The new bound is easy to compute, applies to rate k(o)/n(o) constituent encoders, and often improves over existing results.

引用

页码：2985 / 2997

页数：13

共 50 条

[21] An upper bound on the minimum distance in locally recoverable codes with multiple localities and availability
Kazemi, Anahita
Ghiyasvand, Mehdi
PHYSICAL COMMUNICATION, 2023, 60
[22] The Upper Bound of Minimum Distance in (r, δ)-local t-LRC Codes
Kazemi, Anahita
Ghiyasvand, Mehdi
2021 52ND ANNUAL IRANIAN MATHEMATICS CONFERENCE (AIMC), 2021, : 65 - 67
[23] An upper bound on turbo code free distance
Blackert, WJ
Hall, EK
Wilson, SG
1996 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - CONVERGING TECHNOLOGIES FOR TOMORROW'S APPLICATIONS, VOLS. 1-3, 1996, : 957 - 961
[24] Upper bounds on the minimum distance of spherical codes
Boyvalenkov, PG
Danev, DP
Bumova, SP
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) : 1576 - 1581
[25] Interleavers for turbo codes that yield a minimum distance growing with blocklength
Boutros, J
Zémor, G
2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 55 - 55
[26] On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers
Rosnes, Eirik
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (07) : 4781 - 4795
[27] A NEW UPPER BOUND ON THE MINIMAL DISTANCE OF SELF-DUAL CODES
CONWAY, JH
SLOANE, NJA
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) : 1319 - 1333
[28] AN UPPER BOUND ON THE MINIMUM DISTANCE OF A CONVOLUTIONAL CODE
ROBINSON, JP
IEEE TRANSACTIONS ON INFORMATION THEORY, 1965, 11 (04) : 567 - 571
[29] An improved upper bound on the minimum distance of doubly-even self-dual codes
Krasikov, I
Litsyn, S
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (01) : 274 - 278
[30] An Upper Bound on the Minimum Distance of Array Low-Density Parity-Check Codes
Rosnes, Eirik
Ambroze, Marcel Adrian
Tomlinson, Martin
2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 3155 - 3159

← 1 2 3 4 5 →