A minimum distance bound for quasi-nD-cyclic codes

被引:6
|
作者
Ozbudak, Ferruh [1 ,2 ]
Ozkaya, Buket [3 ]
机构
[1] Middle East Tech Univ, Dept Math, Inonu Bulvari, TR-06531 Ankara, Turkey
[2] Middle East Tech Univ, Inst Appl Math, Inonu Bulvari, TR-06531 Ankara, Turkey
[3] Sabanci Univ, FENS, TR-34956 Istanbul, Turkey
关键词
Quasi-cyclic code; Multidimensional quasi-cyclic code; Multidimensional cyclic code; Trace representation; Multidimensional convolutional code; CONVOLUTIONAL-CODES; ALGEBRAIC STRUCTURE; FINITE-FIELDS; RATE; 1/P; CONSTRUCTION;
D O I
10.1016/j.ffa.2016.06.004
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We provide a new concatenated structure for multidimensional quasi-cyclic (QnDC) codes over F-q and we give a trace representation for their codewords, which extends the known representations of QC and nD cyclic codes. Based on these results, we obtain a minimum distance bound for QnDC dyclic codes. Since QnDC codes are naturally related to nD convolutional codes, this bound also applies to a special class of 1-generator 2D convolutional codes. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:193 / 222
页数:30
相关论文
共 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] 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
  • [3] A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
    Zeh, Alexander
    Bezzateev, Sergey
    DESIGNS CODES AND CRYPTOGRAPHY, 2014, 71 (02) : 229 - 246
  • [4] A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
    Alexander Zeh
    Sergey Bezzateev
    Designs, Codes and Cryptography, 2014, 71 : 229 - 246
  • [5] 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
  • [6] A bound on the minimum distance of generalized quasi-twisted codes
    Hou, Xiaotong
    Gao, Jian
    FINITE FIELDS AND THEIR APPLICATIONS, 2020, 67
  • [7] 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
  • [8] ON THE MINIMUM DISTANCE OF CYCLIC CODES
    VANLINT, JH
    WILSON, RM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (01) : 23 - 40
  • [9] A SQUARE ROOT BOUND ON THE MINIMUM WEIGHT IN QUASI-CYCLIC CODES
    CALDERBANK, R
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) : 332 - 337
  • [10] 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