Multidimensional Quasi-Cyclic and Convolutional Codes

Date

2016-12-01

Author

Guneri, Cem
Özkaya, Buket

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

142
views

0
downloads

Cite This

We introduce multidimensional analogues of quasi-cyclic (QC) codes and study their algebraic structure. We demonstrate a concatenated structure for multidimensional QC codes and use this to prove that this class of codes is asymptotically good. We also relate the new family of codes to convolutional codes. It is known that the minimum distance of QC codes provides a natural lower bound on the free distance of convolutional codes. We show that the same relation also holds between certain rank one 2-D convolutional codes and the related multidimensional QC codes. We provide examples, which show that our bound is sharp in some cases. We also present some optimal 2-D QC codes. Along the way, we provide a condition on the encoders of rank one convolutional codes, which are equivalent to noncatastrophicity for 1-D convolutional codes. In the nD case (n > 1), our condition is sufficient for the noncatastrophicity of the encoder.

Subject Keywords

Quasi-cyclic code, multidimensional quasi-cyclic code, convolutional code, ASYMPTOTICALLY GOOD, FINITE-FIELDS, RATE 1/P, CONSTRUCTIONS, MATRICES, WEIGHTS

URI

https://hdl.handle.net/11511/103385

Collections

Graduate School of Applied Mathematics, Article