Repeated Burst Error Correcting Linear Codes Over GF(q); q = 3

DOI10.1007/978-981-13-0023-3_4MaRDI QIDQ5114853zbMATH OpenOpenAlexFDO

Authors Vinod Tyagi, Subodh Kumar

Publication date 29 June 2020

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-13-0023-3_4

zbMATH Keywords

burst errorparity check digitsrepeated bursterror patterns and syndromeopen loop and closed loop bursts

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Synchronization error-correcting codes (94B50)

Recommendations

• \((1, 3)\) solid burst-correcting optimal linear codes over \(\mathrm{GF}(5)\)
• Construction of \(m\)-repeated burst error correcting binary linear code
• On repeated low-density burst error detecting linear codes
• REPEATED BURST ERROR CORRECTING LINEAR CODES
• scientific article; zbMATH DE number 6756636
• On the existence of optimum cyclic burst correcting codes over GF(q)
• On repeated burst error detecting and correcting codes
• Blockwise repeated low-density burst error correcting linear codes
• Bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocks
• scientific article; zbMATH DE number 6403720

Cites work

• scientific article; zbMATH DE number 3397423 (Why is no real title available?)
• Burst Distance and Multiple-Burst Correction*
• Construction of \(m\)-repeated burst error correcting binary linear code
• Error detecting and error correcting codes
• Low-density-burst-correcting codes (Corresp.)
• On codes derivable from the tensor product of check matrices
• REPEATED BURST ERROR CORRECTING LINEAR CODES
• Simultaneous Error-Correction and Burst-Error Detection Using Binary Linear Cyclic Codes

Cited in

(4)

• Construction of \(m\)-repeated burst error correcting binary linear code
• Repetition error correcting sets: explicit constructions and prefixing methods
• Linear codes correcting repeated bursts equipped with homogeneous distance
• A new burst error correcting method for Reed-Solomon codes based on composite parity-check matrices

This page was built for publication: Repeated Burst Error Correcting Linear Codes Over GF(q); q = 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114853)