New Families of Triple Error Correcting Codes with BCH Parameters

Details New Families of Triple Error Correcting Codes with BCH Parameters New Families of Triple Error Correcting Codes with BCH Parameters

2008-03-25

arxiv.org/abs/0803.3553v1

Computer Science

Information Theory

11 pages. Submitted to IEEE Transactions on information Theory

Scientific paper

Discovered by Bose, Chaudhuri and Hocquenghem, the BCH family of error correcting codes are one of the most studied families in coding theory. They are also among the best performing codes, particularly when the number of errors being corrected is small relative to the code length. In this article we consider binary codes with minimum distance of 7. We construct new families of codes with these BCH parameters via a generalisation of the Kasami-Welch Theorem.

Affiliated with

Also associated with

No associations

Rating

New Families of Triple Error Correcting Codes with BCH Parameters 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 New Families of Triple Error Correcting Codes with BCH Parameters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Families of Triple Error Correcting Codes with BCH Parameters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-349200