Quasi-Cyclic Subcodes of Cyclic Codes

We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent to enumeration of certain vector subspaces in finite fields. In particular, we present enumeration results for quasi-cyclic subcodes of the simplex code and duals of certain BCH codes. Our results are based on the trace representation of cyclic codes.

[1]  Wolfgang Willems,et al.  Self-Dual Doubly Even $2$-Quasi-Cyclic Transitive Codes Are Asymptotically Good , 2007, IEEE Transactions on Information Theory.

[2]  John J. Cannon,et al.  The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[3]  Cem Güneri.  Artin-Schreier curves and weights of two-dimensional cyclic codes , 2004, Finite Fields Their Appl..

[4]  Cem Güneri,et al.  Supersingular curves over finite fields and weight divisibility of codes , 2014, J. Comput. Appl. Math..

[5]  Rumen N. Daskalov,et al.  New binary one-generator quasi-cyclic codes , 2003, IEEE Trans. Inf. Theory.

[6]  Eric Zhi Chen.  New Quasi-Cyclic Codes From Simplex Codes , 2007, IEEE Transactions on Information Theory.

[7]  Bikash Kumar Dey.  On existence of good self-dual quasicyclic codes , 2004, IEEE Transactions on Information Theory.

[8]  Patrick Solé,et al.  Good self-dual quasi-cyclic codes exist , 2003, IEEE Trans. Inf. Theory.

[9]  Jacques Wolfmann,et al.  New bounds on cyclic codes from algebraic curves , 1988, Coding Theory and Applications.