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 条

[31] Improving the minimum distance bound of Trace Goppa codes
Byrne, Isabel
Dodson, Natalie
Lynch, Ryan
Pabon-Cancel, Eric
Pinero-Gonzalez, Fernando
DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (08) : 2649 - 2663
[32] A BOUND ON THE MINIMUM DISTANCE OF QUASI-CYCLIC CODES
Guneri, Cem
Ozbudak, Ferruh
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (04) : 1781 - 1796
[33] A Lower Bound on Minimum Distance of Convolutional Polar Codes
Morozov, Ruslan
Trifonov, Peter
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2104 - 2108
[34] Improving the minimum distance bound of Trace Goppa codes
Isabel Byrne
Natalie Dodson
Ryan Lynch
Eric Pabón–Cancel
Fernando Piñero-González
Designs, Codes and Cryptography, 2023, 91 : 2649 - 2663
[35] A LOWER BOUND ON THE MINIMUM EUCLIDEAN DISTANCE OF TRELLIS CODES
ROUANNE, M
COSTELLO, DJ
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 311 : 130 - 140
[36] Minimum Distance Upper Bounds for 3-Dimensional Turbo Codes Using Quadratic Permutation Polynomial Interleavers
Rosnes, Eirik
2008 5TH INTERNATIONAL SYMPOSIUM ON TURBO CODES AND RELATED TOPICS, 2008, : 420 - 425
[37] Two Methods To Increase The Minimum Distance For Turbo Codes With QPP Interleavers
Trifina, Lucian
Munteanu, Valeriu
Tarniceriu, Daniela
ISSCS 2009: INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS,, 2009, : 453 - 456
[38] Permutation fixed points with application to estimation of minimum distance of turbo codes
Daneshgaran, F
Mondin, M
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (07) : 2336 - 2349
[39] UPPER BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES.
Calderbank, A.R.
Mazo, J.E.
Shapiro, H.M.
The Bell System technical journal, 1983, 62 (8 pt 1): : 2617 - 2646
[40] Upper and Lower Bounds on the Minimum Distance of Expander Codes
Frolov, Alexey
Zyablov, Victor
2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1397 - 1401

← 1 2 3 4 5 →