WOM-codes construits à partir des codes de Hamming (Q1092007): Difference between revisions

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.