Linear codes for masking memory defects (Corresp.)

DOI10.1109/TIT.1985.1056992MaRDI QIDQ3220483zbMATH OpenOpenAlexFDO

Authors

Publication date 1985

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.1985.1056992

zbMATH Keywords

binary linear codes for masking computer memory defectsmultiple random errors

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Partitioned linear block codes for computer memory with 'stuck-at' defects
• On coding for 'stuck-at' defects (Corresp.)
• Asymptotically optimal codes correcting memory defects of fixed multiplicity
• Defect-correcting codes
• Byte-Oriented Error-Correcting Codes for Semiconductor Memory Systems

Cited in

(5)

• Partitioned linear block codes for computer memory with 'stuck-at' defects
• Linear binary code for write-once memories (Corresp.)
• On coding for 'stuck-at' defects (Corresp.)
• Isomorphism between linear codes and arithmetic codes for safe data processing in embedded software systems
• Coding and bounds for partially defective memory cells

This page was built for publication: Linear codes for masking memory defects (Corresp.)

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