Autor:	Zeh, Alexander, Ling, San
Rok vydání:	2015
Předmět:	Computer Science - Information Theory Computer Science - Cryptography and Security Computer Science - Discrete Mathematics Mathematics - Combinatorics Mathematics - Number Theory
Druh dokumentu:	Working Paper
Popis:	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. Comment: 10th International ITG Conference on Systems, Communications and Coding (SCC), Feb 2015, Hamburg, Germany
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1501.06543 Zobrazit plný text záznamu View this record from Arxiv