Decoding Cyclic Codes up to a New Bound on the Minimum Distance

Details Decoding Cyclic Codes up to a New Bound on the Minimum Distance Decoding Cyclic Codes up to a New Bound on the Minimum Distance

2011-05-10

arxiv.org/abs/1105.1894v2

Computer Science

Information Theory

Scientific paper

A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special cases of our bound. For some classes of codes the bound on the minimum distance is refined. Furthermore, a quadratic-time decoding algorithm up to this new bound is developed. The determination of the error locations is based on the Euclidean Algorithm and a modified Chien search. The error evaluation is done by solving a generalization of Forney's formula.

Affiliated with

Also associated with

No associations

Rating

Decoding Cyclic Codes up to a New Bound on the Minimum Distance 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 Decoding Cyclic Codes up to a New Bound on the Minimum Distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding Cyclic Codes up to a New Bound on the Minimum Distance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-279050