The Concatenated Structure of Quasi-Cyclic Codes and an Improvement of Jensen's Bound


Guneri C., ÖZBUDAK F.

IEEE TRANSACTIONS ON INFORMATION THEORY, vol.59, no.2, pp.979-985, 2013 (Peer-Reviewed Journal) identifier identifier

  • Publication Type: Article / Article
  • Volume: 59 Issue: 2
  • Publication Date: 2013
  • Doi Number: 10.1109/tit.2012.2225823
  • Journal Name: IEEE TRANSACTIONS ON INFORMATION THEORY
  • Journal Indexes: Science Citation Index Expanded, Scopus
  • Page Numbers: pp.979-985
  • Keywords: Concatenation, constituents, Jensen's bound, multidimensional cyclic code, quasi-cyclic (QC) code

Abstract

Following Jensen's work from 1985, a quasi-cyclic code can be written as a direct sum of concatenated codes, where the inner codes are minimal cyclic codes and the outer codes are linear codes. We observe that the outer codes are nothing but the constituents of the quasi-cyclic code in the sense of Ling-Sole. This concatenated structure enables us to recover some earlier results on quasi-cyclic codes in a simple way, including one of our recent results which says that a quasi-cyclic code with cyclic constituent codes are 2-D cyclic codes. In fact, we obtain a generalization of this result to multidimensional cyclic codes. The concatenated structure also yields a lower bound on the minimum distance of quasi-cyclic codes, as noted by Jensen, which we call Jensen's bound. We show that a recent lower bound on the minimum distance of quasi-cyclic codes that we obtained is in general better than Jensen's lower bound.