DocumentCode
1523490
Title
Constructions for perfect 2-burst-correcting codes
Author
Etzion, Tuvi
Author_Institution
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
Volume
47
Issue
6
fYear
2001
fDate
9/1/2001 12:00:00 AM
Firstpage
2553
Lastpage
2555
Abstract
In this correspondence, we present two constructions. In the first construction, we show how to generate perfect linear codes of length 2 r-1, r⩾5, and redundancy r, which correct a single burst of length 2. In the second construction, we show how to generate perfect linear codes organized in bytes of length 2r-1, r⩾5, with redundancy divisible by r, which correct a single burst of length 2 within the bytes
Keywords
binary codes; error correction codes; linear codes; redundancy; code construction; perfect 2-burst-correcting codes; perfect linear codes; redundancy; Binary codes; Computer science; Error correction codes; Linear code; Redundancy;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.945267
Filename
945267
Link To Document