Name
Abstract | ||
|---|---|---|
Write-unidirectional memories (WUMs) have been introduced recently. They are binary storage devices having a close relationship to write-once memories (WOMs). When updating the information stored by a WUM the encoder can write 1's to some positions of the WUM or 0's to some positions of the WUM but it is not allowed to do both at the same time. Wolf, Wyner, Ziv and Körner investigated WOMs in the four cases arising if the encoder and/or the decoder is informed/uniformed about the previous state of the memory. We investigate the WUMs under these circumstances. We mostly deal with the two cases when the encoder is uninformed, and give bounds and conjectures on the best achievable rates. In the last part, we discuss a related combinatorial problem: conflict resolution on a multiple access channel. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1016/0166-218X(92)90276-G | DISCRETE APPLIED MATHEMATICS |
Keywords | Field | DocType |
conflict resolution | Computer science,Conflict resolution,Communication channel,Coding (social sciences),Theoretical computer science,Encoder,Binary number | Journal |
Volume | Issue | ISSN |
24 | 1-3 | 0166-218X |
Citations | PageRank | References |
4 | 0.57 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gérard Cohen | 1 | 877 | 176.34 |
| Gábor Simonyi | 2 | 249 | 29.78 |