Abstract

The greedy loop transversal algorithm is used to construct linear codes in a binary channel for the correction of error bursts. The dimensions of the codes constructed are compared with the dimensions of the corresponding white noise greedy loop transversal codes, and with the dimensions of the few previously best-known codes for the burst-error patterns. The dimensions of the greedy loop transversal codes for burst-error correction match or exceed the dimensions of these previously known codes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call