On the Construction of Skew Quasi-Cyclic Codes

Creative Commons License

Abualrub T., Ghrayeb A., Aydin N., Siap I.

IEEE TRANSACTIONS ON INFORMATION THEORY, vol.56, no.5, pp.2081-2090, 2010 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 56 Issue: 5
  • Publication Date: 2010
  • Doi Number: 10.1109/tit.2010.2044062
  • Journal Name: IEEE TRANSACTIONS ON INFORMATION THEORY
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.2081-2090
  • Yıldız Technical University Affiliated: Yes

Abstract

In this paper, we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of codes is constructed using a noncommutative ring called the skew polynomial ring F[x; theta]. After a brief description of the skew polynomial ring F[x; theta], it is shown that skew QC codes are left submodules of the ring R(s)(l) = (F[x; theta]/(x(s) - 1))(l). The notions of generator and parity-check polynomials are given. We also introduce the notion of similar polynomials in the ring F[x; theta] and show that parity-check polynomials for skew QC codes are unique up to similarity. Our search results lead to the construction of several new codes with Hamming distances exceeding the Hamming distances of the previously best known linear codes with comparable parameters.