Invertible zero-error dispersers and defective memory with stuck-at errors

DOI10.1007/978-3-642-32512-0_47MaRDI QIDQ3167425zbMATH OpenOpenAlexFDO

Authors Ariel Gabizon, Ronen Shaltiel

Publication date 2 November 2012

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32512-0_47

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Increasing the Output Length of Zero-Error Dispersers
• Increasing the output length of zero-error dispersers
• Coding for a Write-Once Memory
• Report on models of write–efficient memories with localized errors and defects
• scientific article; zbMATH DE number 3487351

Cited in

(3)

• Mining circuit lower bound proofs for meta-algorithms
• Increasing the output length of zero-error dispersers
• Increasing the Output Length of Zero-Error Dispersers

This page was built for publication: Invertible zero-error dispersers and defective memory with stuck-at errors

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