On the Construction of Skew Quasi-Cyclic Codes

Details On the Construction of Skew Quasi-Cyclic Codes On the Construction of Skew Quasi-Cyclic Codes

2008-09-13

arxiv.org/abs/0809.2315v1

Computer Science

Information Theory

12 pages. submitted

Scientific paper

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;\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.

Affiliated with

Also associated with

No associations

Rating

On the Construction of Skew Quasi-Cyclic Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Construction of Skew Quasi-Cyclic Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Construction of Skew Quasi-Cyclic Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-603641