On the constructions of multiple-burst error-correcting codes

1992/01/01 by Chen Zhi, Fan Pingzhi, Fan Ping-zhi +1 · 3 citations
Computer Science · #Coding theory and cryptography #Advanced Data Storage Technologies #Error Correcting Code Techniques

paper · doi:10.1109/18.108273

Abstract

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by

• Construction of Multiple-Burst-Correction Codes in Transform Domain and Its Relation to LDPC Codes
• Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
• Coding Bounds for Multiple Phased-Burst Correction and Single Burst Correction Codes

Related

• Optimal codes for correcting a single (wrap-around) burst of errors
• Majority-logic Decoding with Subspace Designs
• Redundancy bounds for multipleburst error-correcting codes
• Coding Bounds for Multiple Phased-Burst Correction and Single Burst Correction Codes
• Phased burst error-correcting array codes