Coding for write-unidirectional memories and conflict resolution

DOI10.1016/0166-218X(92)90276-GzbMath0681.94013OpenAlexW2053787445MaRDI QIDQ1823916

Gérard D. Cohen, Gábor Simonyi

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90276-g

zbMATH Keywords

decoderconflict resolutionmultiple access channelencoderwrite-once memories (WOMs)Write-unidirectional memories (WUMs)

Mathematics Subject Classification ID

Communication, information (94A99) Theory of computing (68Q99)

Related Items (2)

Applications of coding theory to communication combinatorial problems ⋮ Write-isolated memories (WIMs)

Cites Work

• Unnamed Item
• Unnamed Item
• Union-free hypergraphs and probability theory
• Families of finite sets in which no set is covered by the union of two others
• Families of \(k\)-independent sets
• On storage media with aftereffects
• How to reuse a “write-once≓ memory
• On the capacity of computer memory with defects
• Coding for a Write-Once Memory
• Linear binary code for write-once memories (Corresp.)
• On write-unidirectional memory codes
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels

This page was built for publication: Coding for write-unidirectional memories and conflict resolution