pith. sign in

arxiv: 1501.06543 · v1 · pith:XYN25NSUnew · submitted 2015-01-26 · 💻 cs.IT · cs.CR· cs.DM· math.CO· math.IT· math.NT

Construction of Quasi-Cyclic Product Codes

classification 💻 cs.IT cs.CRcs.DMmath.COmath.ITmath.NT
keywords quasi-cycliccodeproductbasisbnercodescomponentgenerating
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.