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
来源：
FINITE FIELDS AND THEIR APPLICATIONS | 2016年 / 41卷
关键词：
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 条
  • [21] On a sequence of cyclic codes with minimum distance six
    Danev, D
    Olsson, J
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) : 673 - 680
  • [22] Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes
    Zeh, Alexander
    Wachter-Zeh, Antonia
    Gadouleau, Maximilien
    Bezzateev, Sergey
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 126 - +
  • [23] 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 - +
  • [24] Improving the minimum distance bound of Trace Goppa codes
    Byrne, Isabel
    Dodson, Natalie
    Lynch, Ryan
    Pabon-Cancel, Eric
    Pinero-Gonzalez, Fernando
    DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (08) : 2649 - 2663
  • [25] A Lower Bound on Minimum Distance of Convolutional Polar Codes
    Morozov, Ruslan
    Trifonov, Peter
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2104 - 2108
  • [26] New upper bound on the minimum distance of turbo codes
    Perotti, A
    Benedetto, S
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 313 - 313
  • [27] Improving the minimum distance bound of Trace Goppa codes
    Isabel Byrne
    Natalie Dodson
    Ryan Lynch
    Eric Pabón–Cancel
    Fernando Piñero-González
    Designs, Codes and Cryptography, 2023, 91 : 2649 - 2663
  • [28] A logarithmic upper bound on the minimum distance of turbo codes
    Breiling, M
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) : 1692 - 1710
  • [29] A LOWER BOUND ON THE MINIMUM EUCLIDEAN DISTANCE OF TRELLIS CODES
    ROUANNE, M
    COSTELLO, DJ
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 311 : 130 - 140
  • [30] A new upper bound on the minimum distance of turbo codes
    Perotti, A
    Benedetto, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (12) : 2985 - 2997
12345