Decoding of Quasi-Cyclic Codes up to A New Lower Bound on the Minimum Distance

被引：0
|
作者：
Zeh, Alexander [1 ]
Ling, San [1 ]
机构：
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
来源：
2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2014年
关键词：
Bound on the minimum distance; efficient decoding; quasi-cyclic code; spectral analysis; SHIFT-REGISTER SYNTHESIS; ALGEBRAIC STRUCTURE; ALGORITHM;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov-Trifonov bound in a similar way as the Hartmann-Tzeng bound extends the BCH approach for cyclic codes. Furthermore, a syndrome-based algebraic decoding algorithm is given.
引用
收藏
页码：2584 / 2588
页数：5
相关论文
共 50 条
  • [1] A BOUND ON THE MINIMUM DISTANCE OF QUASI-CYCLIC CODES
    Guneri, Cem
    Ozbudak, Ferruh
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (04) : 1781 - 1796
  • [2] Decoding Cyclic Codes up to a New Bound on the Minimum Distance
    Zeh, Alexander
    Wachter-Zeh, Antonia
    Bezzateev, Sergey V.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) : 3951 - 3960
  • [3] A minimum distance bound for 1-Generator quasi-cyclic codes
    Woungang, Isaac
    Misra, Sudip
    Sadeahian, Alireza
    Ferworn, Alexander
    2007 10TH CANADIAN WORKSHOP ON INFORMATION THEORY, 2007, : 156 - 159
  • [4] A lower bound on the minimum distance of a 1-generator quasi-cyclic code
    Woungang, Isaac
    Misra, Sudip
    Sadeghian, Alireza
    2006 23RD BIENNIAL SYMPOSIUM ON COMMUNICATIONS, 2006, : 63 - +
  • [5] New distance bounds for quasi-cyclic codes
    Ozbudak, Ferruh
    Ozkaya, Buket
    DESIGNS CODES AND CRYPTOGRAPHY, 2024, 92 (12) : 3981 - 4009
  • [6] A SQUARE ROOT BOUND ON THE MINIMUM WEIGHT IN QUASI-CYCLIC CODES
    CALDERBANK, R
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) : 332 - 337
  • [7] Bounds on the Minimum Distance of Punctured Quasi-Cyclic LDPC Codes
    Butler, Brian K.
    Siegel, Paul H.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (07) : 4584 - 4597
  • [8] New and efficient decoding architecture for Quasi-Cyclic LDPC codes
    Fan, Zhiming
    Wu, Zhanji
    Che, Hui
    Zhou, Xiaoping
    2014 9TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA (CHINACOM), 2014, : 246 - 251
  • [9] Construction of quasi-cyclic GF(q)-LDPC codes achieving the upper bound on the minimum hamming distance
    Hu, S.-K. (hushukai@sohu.com), 1600, Beijing University of Posts and Telecommunications (35):
  • [10] A NEW PROCEDURE FOR DECODING CYCLIC AND BCH CODES UP TO ACTUAL MINIMUM DISTANCE
    FENG, GL
    TZENG, KK
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (05) : 1364 - 1374
12345