Notes on quasi-cyclic codes with cyclic constituent codes

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Quasi-cyclic codes are generalizations of the familiar linear cyclic codes. By using the results of [4], the authors in [2, 3] showed that a quasi-cyclic code C over Fq of length ℓm and index ℓ with m being pairwise coprime to ℓ and the characteristic of Fq is equivalent to a cyclic code if the constituent codes of C are cyclic, where q is a prime power and the equivalence is given in [3]. In this paper, we apply an algebraic method to prove that a quasi-cyclic code with cyclic constituent codes is equivalent to a cyclic code. Moreover, the main result (see Theorem 4) includes Proposition 9 in [3] as a special case.

Cite

CITATION STYLE

APA

Shi, M., Zhang, Y., & Solé, P. (2017). Notes on quasi-cyclic codes with cyclic constituent codes. In Springer Proceedings in Mathematics and Statistics (Vol. 190, pp. 193–206). Springer New York LLC. https://doi.org/10.1007/978-3-319-46310-0_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free