Partitioned linear block codes for computer memory with 'stuck-at' defects

DOI10.1109/TIT.1983.1056763MaRDI QIDQ3342455zbMATH OpenFDO

Authors Chris Heegard

Publication date 1983

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

Full work available at URL https://doi.org/10.1109/TIT.1983.1056763

zbMATH Keywords

generation of stuck-at cellsLinear block codesrandom errorsreliability of message storage in computer memorystuck-at defects

Mathematics Subject Classification ID

Theory of software (68N99) Information theory (general) (94A15) Linear codes (general theory) (94B05) Cyclic codes (94B15) Decoding (94B35)

Recommendations

• On coding for 'stuck-at' defects (Corresp.)
• Linear codes for masking memory defects (Corresp.)
• On the capacity of computer memory with defects
• scientific article; zbMATH DE number 3487351
• Asymptotically optimal codes correcting memory defects of fixed multiplicity

Cited in

(5)

• Linear codes for masking memory defects (Corresp.)
• On coding for 'stuck-at' defects (Corresp.)
• scientific article; zbMATH DE number 3487351 (Why is no real title available?)
• Coding and bounds for partially defective memory cells
• Applications of coding theory to communication combinatorial problems

This page was built for publication: Partitioned linear block codes for computer memory with 'stuck-at' defects

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