Coding for write-unidirectional memories and conflict resolution
- 31 December 1989
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 24 (1) , 103-114
- https://doi.org/10.1016/0166-218x(92)90276-g
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On write-unidirectional memory codesIEEE Transactions on Information Theory, 1989
- Linear binary code for write-once memories (Corresp.)IEEE Transactions on Information Theory, 1986
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channelsIEEE Transactions on Information Theory, 1985
- Coding for a Write-Once MemoryAT&T Bell Laboratories Technical Journal, 1984
- Union-free Hypergraphs and Probability TheoryEuropean Journal of Combinatorics, 1984
- On the capacity of computer memory with defectsIEEE Transactions on Information Theory, 1983
- On storage media with aftereffectsInformation and Control, 1983
- How to reuse a “write-once≓ memoryInformation and Control, 1982
- Families of finite sets in which no set is covered by the union of two othersJournal of Combinatorial Theory, Series A, 1982
- Families of k-independent setsDiscrete Mathematics, 1973