On Quasi-Cyclic Codes as a Generalization of Cyclic Codes

Details On Quasi-Cyclic Codes as a Generalization of Cyclic Codes On Quasi-Cyclic Codes as a Generalization of Cyclic Codes

2011-08-18

arxiv.org/abs/1108.3754v1

Computer Science

Information Theory

Scientific paper

In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length m and ideals of M_l(Fq)[X]/(X^m -1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study the parameters of such codes and propose a decoding algorithm up to half the designed minimum distance. We even found one new quasi-cyclic code with better parameters than known [189, 11, 125]_F4 and 48 derivated codes beating the known bounds as well.

Affiliated with

Also associated with

No associations

Rating

On Quasi-Cyclic Codes as a Generalization of 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 Quasi-Cyclic Codes as a Generalization of Cyclic Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Quasi-Cyclic Codes as a Generalization of Cyclic Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-181397