Title: Some asymptotically optimal burst-correcting codes and their relation to single-error-correcting Reed-Solomon codes
Abstract:A class of asymptotically optimal burst-correcting codes that are closely related to the Fire codes is defined. The codes are quasi-cyclic as defined by Townsend and Weldon. However, decoding can be a...A class of asymptotically optimal burst-correcting codes that are closely related to the Fire codes is defined. The codes are quasi-cyclic as defined by Townsend and Weldon. However, decoding can be accomplished with a very simple algorithm similar to that used for cyclic burst-correcting codes. It is shown that these codes are equivalent to certain Reed-Solomon codes. From this it follows that such Reed-Solomon codes can be easily encoded and decoded without any computations in an extension field.Read More
Publication Year: 1971
Publication Date: 1971-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 16
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot