Efficient Algorithms for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes

Details Efficient Algorithms for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes Efficient Algorithms for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes

2011-01-27

arxiv.org/abs/1101.5411v1

Computer Science

Discrete Mathematics

Scientific paper

In a previous work it was shown that the best measure for the efficiency of a single burst-correcting code is obtained using the Gallager bound as opposed to the Reiger bound. In this paper, an efficient algorithm that searches for the best (shortened) cyclic burst-correcting codes is presented. Using this algorithm, extensive tables that either tie existing constructions or improve them are obtained for burst lengths up to b=10.

Affiliated with

Also associated with

No associations

Rating

Efficient Algorithms for Searching Optimal Shortened Cyclic Single-Burst-Correcting 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 Efficient Algorithms for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Algorithms for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-550255