DocumentCode :
915123
Title :
Some asymptotically optimal burst-correcting codes and their relation to single-error-correcting Reed-Solomon codes
Author :
Burton, Herbert O.
Volume :
17
Issue :
1
fYear :
1971
fDate :
1/1/1971 12:00:00 AM
Firstpage :
92
Lastpage :
95
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 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.
Keywords :
Burst-correcting codes; Reed-Solomon codes; Arithmetic; Decoding; Fires; Parity check codes; Reed-Solomon codes; Telephony; Testing; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1971.1054581
Filename :
1054581
Link To Document :
بازگشت