By Topic

Three-dimensional cluster error-correcting array 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
$33 $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)
I. M. Boyarinov ; Inst. for Syst. Anal., Acad. of Sci., Moscow, Russia

We present linear binary three-dimensional array codes that can correct three-dimensional clusters (or bursts) of errors. Constructions of the codes are based on the three-dimensional interleaving schemes and direct-sum augmentation technique.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: