The following pages link to Coding for write-efficient memory (Q1123626):
Displaying 16 items.
- Write-isolated memories (WIMs) (Q685662) (← links)
- On the minimum average distance of binary constant weight codes (Q932637) (← links)
- Models of multi-user write-efficient memories and general diametric theorems (Q1363782) (← links)
- On the variance of average distance of subsets in the Hamming space (Q1765526) (← links)
- Coding for write-unidirectional memories and conflict resolution (Q1823916) (← links)
- Geometric WOM codes and coding strategies for multilevel flash memories (Q2436569) (← links)
- Coding for Secure Write-Efficient Memories (Q2989646) (← links)
- Codes for Write-Once Memories (Q2989793) (← links)
- AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES (Q3063606) (← links)
- Report on models of write–efficient memories with localized errors and defects (Q3439246) (← links)
- Coding for a Write-Once Memory (Q3702517) (← links)
- Linear binary code for write-once memories (Corresp.) (Q3757825) (← links)
- Coding for a degraded memory under a partial modification of records (Q3990784) (← links)
- On multiuser write-efficient memories (Q4838622) (← links)
- Report on Models of Write–Efficient Memories with Localized Errors and Defects (Q5504215) (← links)
- On the minimum average distance of binary codes: Linear programming approach (Q5939230) (← links)
