On the minimum distance of turbo codes

被引：3
|
作者：
Truhachev, D [1 ]
Lentmaier, M [1 ]
Wintzell, O [1 ]
Zigangirov, KS [1 ]
机构：
[1] Lund Univ, Dept Informat Technol, SE-22100 Lund, Sweden
来源：
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS | 2002年
关键词：
D O I：
10.1109/ISIT.2002.1023356
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A permutor (interleaver) design method is presented to show the existence of turbo codes with minimum distance growing logarithmically with the permutor length N. It is demonstrated, that the method can also be useful for the construction of turbo codes with practical blocklengths.
引用
收藏
页码：84 / 84
页数：1
相关论文
共 50 条
  • [1] Combinatorial analysis of the minimum distance of turbo codes
    Breiling, M
    Huber, JB
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) : 2737 - 2750
  • [2] The Minimum Distance of Turbo-Like Codes
    Bazzi, Louay
    Mahdian, Mohammad
    Spielman, Daniel A.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (01) : 6 - 15
  • [3] Upper bound on the minimum distance of turbo codes
    Breiling, M
    Huber, JB
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2001, 49 (05) : 808 - 815
  • [4] New upper bound on the minimum distance of turbo codes
    Perotti, A
    Benedetto, S
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 313 - 313
  • [5] A new upper bound on the minimum distance of turbo codes
    Perotti, A
    Benedetto, S
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (12) : 2985 - 2997
  • [6] A logarithmic upper bound on the minimum distance of turbo codes
    Breiling, M
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) : 1692 - 1710
  • [7] On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers
    Rosnes, Eirik
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (07) : 4781 - 4795
  • [8] Interleavers for turbo codes that yield a minimum distance growing with blocklength
    Boutros, J
    Zémor, G
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 55 - 55
  • [9] Upper bounds on the minimum distance for turbo codes using CPP interleavers
    Lucian Trifina
    Daniela Tarniceriu
    Jonghoon Ryu
    Ana-Mirela Rotopanescu
    [J]. Telecommunication Systems, 2021, 76 : 423 - 447
  • [10] Two Methods To Increase The Minimum Distance For Turbo Codes With QPP Interleavers
    Trifina, Lucian
    Munteanu, Valeriu
    Tarniceriu, Daniela
    [J]. ISSCS 2009: INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS,, 2009, : 453 - 456
12345