Construction of Quasi-Cyclic Product Codes
Information Theory
2015-01-27 v1 Cryptography and Security
Discrete Mathematics
Combinatorics
math.IT
Number Theory
Abstract
Linear quasi-cyclic product codes over finite fields are investigated. Given the generating set in the form of a reduced Gr{\"o}bner basis of a quasi-cyclic component code and the generator polynomial of a second cyclic component code, an explicit expression of the basis of the generating set of the quasi-cyclic product code is given. Furthermore, the reduced Gr{\"o}bner basis of a one-level quasi-cyclic product code is derived.
Keywords
Cite
@article{arxiv.1501.06543,
title = {Construction of Quasi-Cyclic Product Codes},
author = {Alexander Zeh and San Ling},
journal= {arXiv preprint arXiv:1501.06543},
year = {2015}
}
Comments
10th International ITG Conference on Systems, Communications and Coding (SCC), Feb 2015, Hamburg, Germany