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 条

[41] UPPER-BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES
CALDERBANK, AR
MAZO, JE
SHAPIRO, HM
BELL SYSTEM TECHNICAL JOURNAL, 1983, 62 (08): : 2617 - 2646
[42] Decoding of Quasi-Cyclic Codes up to A New Lower Bound on the Minimum Distance
Zeh, Alexander
Ling, San
2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2584 - 2588
[43] Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes
Frolov, A. A.
PROBLEMS OF INFORMATION TRANSMISSION, 2016, 52 (01) : 6 - 13
[44] Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes
A. A. Frolov
Problems of Information Transmission, 2016, 52 : 6 - 13
[45] Bound on the minimum distance of double circulant cubic residue codes
Shi, Minjia
Bian, Xinpeng
Ozbudak, Ferruh
Sole, Patrick
FINITE FIELDS AND THEIR APPLICATIONS, 2025, 105
[46] A minimum distance bound for quasi-nD-cyclic codes
Ozbudak, Ferruh
Ozkaya, Buket
FINITE FIELDS AND THEIR APPLICATIONS, 2016, 41 : 193 - 222
[47] Some results on the binary minimum distance of Reed-Solomon codes and block turbo codes
Le Bidan, Raphael
Pyndiah, Ramesh
Adde, Patrick
2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 990 - 994
[48] A Simplified Lower Bound on Minimum Distance of Convolutional Polar Codes
Morozov, Ruslan
2019 XVI INTERNATIONAL SYMPOSIUM PROBLEMS OF REDUNDANCY IN INFORMATION AND CONTROL SYSTEMS (REDUNDANCY), 2019, : 7 - 11
[49] GENERALIZATION OF MINIMUM DISTANCE BOUND ON GENERALIZED GOPPA CODES AND THEIR DECODING
冯贵良
K.K.TZENG
ScienceinChina,SerA., 1983, Ser.A.1983 (10) : 1096 - 1106
[50] A bound on the minimum distance of generalized quasi-twisted codes
Hou, Xiaotong
Gao, Jian
FINITE FIELDS AND THEIR APPLICATIONS, 2020, 67

← 1 2 3 4 5 →