New distance bounds for quasi-cyclic codes

被引：0
|
作者：
Ozbudak, Ferruh [1 ]
Ozkaya, Buket [2 ]
机构：
[1] Sabanci Univ, Dept Math, FENS, Istanbul, Turkiye
[2] Middle East Tech Univ, Inst Appl Math, Ankara, Turkiye
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2024年 / 92卷 / 12期
关键词：
Quasi-cyclic codes; Minimum distance bounds; Concatenated structure; MINIMUM DISTANCE;
D O I：
10.1007/s10623-024-01464-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the minimum weight of codewords in a quasi-cyclic code and characterize the estimate in its most general setup using their concatenated structure. The new bound we derive generalizes the Jensen and G & uuml;neri-& Ouml;zbudak bounds and it holds for the more general class of multilevel concatenated codes.
引用
收藏
页码：3981 / 4009
页数：29
相关论文
共 50 条
  • [1] 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
  • [2] Lower Bounds for Quasi-Cyclic Codes and New Binary Quantum Codes
    Liu, Yiting
    Guan, Chaofeng
    Du, Chao
    Ma, Zhi
    SYMMETRY-BASEL, 2023, 15 (03):
  • [3] New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds
    Eric Zhi Chen
    Designs, Codes and Cryptography, 2016, 80 : 1 - 10
  • [4] New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds
    Chen, Eric Zhi
    DESIGNS CODES AND CRYPTOGRAPHY, 2016, 80 (01) : 1 - 10
  • [5] A BOUND ON THE MINIMUM DISTANCE OF QUASI-CYCLIC CODES
    Guneri, Cem
    Ozbudak, Ferruh
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (04) : 1781 - 1796
  • [6] New quasi-cyclic codes from simplex codes
    Chen, Eric Z.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (03) : 1193 - 1196
  • [7] On quasi-cyclic codes
    Heijnen, P
    van Tilborg, H
    Weijs, S
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 65 - 65
  • [8] New codes from chains of quasi-cyclic codes
    Grassl, M
    White, G
    2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 2095 - 2099
  • [9] Bounds on quasi-cyclic codes over finite chain rings
    Gao J.
    Shen L.
    Fu F.-W.
    Gao, Jian (jiangao@mail.nankai.edu.cn), 1600, Springer Verlag (50): : 577 - 587
  • [10] 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
12345