WOM-codes construits à partir des codes de Hamming (Q1092007): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q677137 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Ian F. Blake / rank | |||
Normal rank |
Revision as of 14:58, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | WOM-codes construits à partir des codes de Hamming |
scientific article |
Statements
WOM-codes construits à partir des codes de Hamming (English)
0 references
1987
0 references
The problem of coding for a write-once-memory (WOM) is considered. A \(<\nu >^ t/n\) WOM code allows t successive writings of any message among \(\nu\) on an n bit WOM. It is shown that for \(r\geq 4\) one can write r bit messages \(t=2^{r-2}+2^{r-4}+1\) times on a \((2^ r-1)\) bit WOM. The coding technique uses coset coding and a result on the covering radius of linear codes to prove its properties.
0 references
write-once-memory
0 references
WOM code
0 references
coset coding
0 references
covering radius
0 references