Hide/Show Apps

A minimum distance bound for quasi-nD-cyclic codes

2016-09-01
Özbudak, Ferruh
Ozkaya, Buket
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.