A Class of High Rate Codes for Byte-Oriented Information Systems

DOI10.1109/TCOM.1983.1095829MaRDI QIDQ3677656zbMATHFDO

Authors Gérald E. Séguin, P. E. Allard, Vijay K. Bhargava

Publication date 1983

Published in IEEE Transactions on Communications (Search for Journal in Brave)

zbMATH Keywords

performancedecoding algorithmbinary symmetric channeladditional error protectionASCIIinformation bytesoverall parity byte

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Class of shortened cyclic codes over GF(28) for byte-oriented systems
• Code Constructions for Error Control in Byte Organized Memory Systems
• An extension of the codes introduced by Séguin, Allard and Bhargava
• Memory Package Error Detection and Correction
• Byte protecting perfect burst code

Cited in

(6)

• Byte protecting perfect burst code
• An extension of the codes introduced by Séguin, Allard and Bhargava
• Optimal codes for single-error correction, double-adjacent-error detection
• On double-byte error-correcting codes
• 2-dimensional arithmetic residue check codes
• Minimum-check-density codes for correcting bytes of errors, erasures, or defects

This page was built for publication: A Class of High Rate Codes for Byte-Oriented Information Systems

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