On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph

DOI10.1109/18.746827MaRDI QIDQ4701277zbMATH OpenOpenAlexFDO

Authors Fangwei Fu, A. J. Han Vinck

Publication date 21 November 1999

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

Full work available at URL https://semanticscholar.org/paper/e84de4f906708537d9c889548acc43e0f3273574

zbMATH Keywords

write-once memory

Mathematics Subject Classification ID

Theory of data (68P99)

Recommendations

• Generalized 'write-once' memories
• On the Capacity of Write-Unidirectional Memories With Nonperiodic Codes
• Coding for a Write-Once Memory
• On the capacity of permanent memory
• How to reuse a “write-once≓ memory

Cited in

(5)

• Models of multi-user write-efficient memories and general diametric theorems
• Guided blocks WOM codes
• Geometric WOM codes and coding strategies for multilevel flash memories
• Concurrent use of write-once memory
• ON/OFF STORAGE SYSTEMS WITH STATE-DEPENDENT INPUT, OUTPUT, AND SWITCHING RATES

This page was built for publication: On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph

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