On the construction of skew quasi-cyclic codes

Taher Abualrub, Ali Ghrayeb, Nuh Aydin, Irfan Siap

Research output: Contribution to journalArticle

21 Citations (Scopus)

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;θ]. After a brief description of the skew polynomial ring F[x;θ], it is shown that skew QC codes are left submodules of the ring Rs l= (F[x;θ]/(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;θ] 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.

Original languageEnglish
Article number4
Pages (from-to)2081-2090
Number of pages10
JournalIEEE Transactions on Information Theory
Volume56
Issue number5
DOIs
Publication statusPublished - May 2010
Externally publishedYes

Fingerprint

Polynomials
Hamming distance

Keywords

  • New codes
  • Quasi-cyclic codes
  • Skew fields

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

On the construction of skew quasi-cyclic codes. / Abualrub, Taher; Ghrayeb, Ali; Aydin, Nuh; Siap, Irfan.

In: IEEE Transactions on Information Theory, Vol. 56, No. 5, 4, 05.2010, p. 2081-2090.

Research output: Contribution to journalArticle

Abualrub, Taher ; Ghrayeb, Ali ; Aydin, Nuh ; Siap, Irfan. / On the construction of skew quasi-cyclic codes. In: IEEE Transactions on Information Theory. 2010 ; Vol. 56, No. 5. pp. 2081-2090.
@article{d8403c2897234ad597e6b714fcd6d3cc,
title = "On the construction of skew quasi-cyclic codes",
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;θ]. After a brief description of the skew polynomial ring F[x;θ], it is shown that skew QC codes are left submodules of the ring Rs l= (F[x;θ]/(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;θ] 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.",
keywords = "New codes, Quasi-cyclic codes, Skew fields",
author = "Taher Abualrub and Ali Ghrayeb and Nuh Aydin and Irfan Siap",
year = "2010",
month = "5",
doi = "10.1109/TIT.2010.2044062",
language = "English",
volume = "56",
pages = "2081--2090",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - On the construction of skew quasi-cyclic codes

AU - Abualrub, Taher

AU - Ghrayeb, Ali

AU - Aydin, Nuh

AU - Siap, Irfan

PY - 2010/5

Y1 - 2010/5

N2 - 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;θ]. After a brief description of the skew polynomial ring F[x;θ], it is shown that skew QC codes are left submodules of the ring Rs l= (F[x;θ]/(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;θ] 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.

AB - 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;θ]. After a brief description of the skew polynomial ring F[x;θ], it is shown that skew QC codes are left submodules of the ring Rs l= (F[x;θ]/(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;θ] 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.

KW - New codes

KW - Quasi-cyclic codes

KW - Skew fields

UR - http://www.scopus.com/inward/record.url?scp=77951538807&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951538807&partnerID=8YFLogxK

U2 - 10.1109/TIT.2010.2044062

DO - 10.1109/TIT.2010.2044062

M3 - Article

AN - SCOPUS:77951538807

VL - 56

SP - 2081

EP - 2090

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

M1 - 4

ER -