A class of composite codes with minimum distance 8

DOI10.1023/A:1013827518409MaRDI QIDQ1812395zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 19 June 2003

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1013827518409

zbMATH Keywords

error correctionlinear codesGolay codealgebraic decoding algorithmburst correctioncombinational-circuit decoding complexitycomposite codes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Burst-correcting codes (94B20) Decoding (94B35)

Recommendations

• Decoding the Golay codes
• scientific article; zbMATH DE number 4132090
• Fast algorithms for decoding the (23, 12) binary Golay code with four-error-correcting capability
• scientific article; zbMATH DE number 3458474
• On high-speed decoding of the (23,12,7) Golay code

Cited in

(1)

• scientific article; zbMATH DE number 2154110 (Why is no real title available?)

This page was built for publication: A class of composite codes with minimum distance 8

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