Write-isolated memories (WIMs) (Q685662): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding for write-efficient memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good coverings of Hamming spaces with spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding for write-unidirectional memories and conflict resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Robinson's coding problem (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to reuse a “write-once≓ memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymmetric error-correcting ternary code (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding for a Write-Once Memory / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)90359-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018101183 / rank
 
Normal rank

Latest revision as of 10:14, 30 July 2024

scientific article
Language Label Description Also known as
English
Write-isolated memories (WIMs)
scientific article

    Statements

    Write-isolated memories (WIMs) (English)
    0 references
    24 October 1993
    0 references
    A write-isolated memory (WIM) is a binary storage medium on which no change of two consecutive positions is allowed when updating the information stored. We prove that the optimal rate for writing on a WIM is \(\log_ 2(1+\sqrt 5)/2=0.69\). We give asymptotic constructions achieving 0.6.
    0 references
    packing
    0 references
    coverings
    0 references
    constrained memories
    0 references
    combinatorial group theory
    0 references
    0 references
    0 references

    Identifiers