By Topic

Constructions for perfect 2-burst-correcting codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Etzion, T. ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

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

Published in:

Information Theory, IEEE Transactions on  (Volume:47 ,  Issue: 6 )