By Topic

On the constructions of multiple-burst error-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

3 Author(s)
Chen Zhi ; Dept. of Comput. Sci. & Eng., Southwest Jiaotong Univ., Sichuan, China ; Pingzhi Fan ; Jin Fan

Disjoint difference sets with regard to the largest elements are used to construct multiple-burst error-correcting codes using majority-logic decoding. Almost all of D.M. Mandelbaum's (1972) codes are improved with shorter lengths. Because they are quasi-cyclic and majority-logic decodable, they are of practical interest

Published in:

Information Theory, IEEE Transactions on  (Volume:38 ,  Issue: 1 )