Minimum Distance Bounds for Expander Codes

被引：0
|
作者：
Skachek, Vitaly [1 ]
机构：
[1] Univ Coll Dublin, Claude Shannon Inst, Dublin 4, Ireland
来源：
2008 INFORMATION THEORY AND APPLICATIONS WORKSHOP | 2008年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Several expander code constructions and their parameters are surveyed. New generalized expander codes are introduced and their properties are compared with the properties of the existing constructions. Finally, some possible directions to extend the current research on expander codes are discussed.
引用
收藏
页码：409 / 413
页数：5
相关论文
共 50 条
  • [1] Upper and Lower Bounds on the Minimum Distance of Expander Codes
    Frolov, Alexey
    Zyablov, Victor
    [J]. 2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1397 - 1401
  • [2] Bounds on the minimum distance of Goppa codes
    Maharaj, Hiren
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (07) : 3256 - 3259
  • [3] BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES
    BURNASHEV, M
    BIGLIERI, EM
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (03) : 659 - 662
  • [4] Generalized minimum distance iterative decoding of expander codes
    Skachek, V
    Roth, RM
    [J]. 2003 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, 2003, : 245 - 248
  • [5] Upper bounds on the minimum distance of spherical codes
    Boyvalenkov, PG
    Danev, DP
    Bumova, SP
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) : 1576 - 1581
  • [6] Bounds on the minimum distance of the duals of BCH codes
    Augot, D
    LevyditVehel, F
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (04) : 1257 - 1260
  • [7] Bounds on the Rate and Minimum Distance of Codes with Availability
    Balaji, S. B.
    Kumar, P. Vijay
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017,
  • [8] MINIMUM-DISTANCE BOUNDS FOR BINARY LINEAR CODES
    HELGERT, HJ
    STINAFF, RD
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (03) : 344 - 356
  • [9] MINIMUM DISTANCE BOUNDS FOR CYCLIC CODES AND DELIGNES THEOREM
    MORENO, O
    KUMAR, PV
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (05) : 1524 - 1534
  • [10] Minimum distance bounds for s-regular codes
    Martin, WJ
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2000, 21 (1-3) : 181 - 187
12345