On the Construction of Skew Quasi-Cyclic Codes

From MaRDI portal
Publication:5281479

DOI10.1109/TIT.2010.2044062zbMATH Open1366.94632arXiv0809.2315OpenAlexW2105512769WikidataQ58473751 ScholiaQ58473751MaRDI QIDQ5281479FDOQ5281479


Authors: Ali Ghrayeb, Nuh Aydin, Irfan Siap, Taher Abualrub Edit this on Wikidata


Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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 non-commutative ring called the skew polynomial rings F[x;heta]. After a brief description of the skew polynomial ring F[x;heta] it is shown that skew QC codes are left submodules of the ring Rsl=(F[x;heta]/(xsβˆ’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;heta] 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.


Full work available at URL: https://arxiv.org/abs/0809.2315







Cited In (35)





This page was built for publication: On the Construction of Skew Quasi-Cyclic Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281479)