Lattice-based WOM codebooks that allow two writes

@article{Kurkoski2012LatticebasedWC,
  title={Lattice-based WOM codebooks that allow two writes},
  author={Brian M. Kurkoski},
  journal={2012 International Symposium on Information Theory and its Applications},
  year={2012},
  pages={101-105}
}
The continuous approximation is a technique to separate the shaping gain and coding gain of a channel code. In this paper, this technique is applied to codes for write-once memories (WOM codes) based upon lattices. For a lattice of arbitrary dimension n, a hyperbolic shaping region is optimal in the sense of maximizing the sum rate in the worst case, when there are two writes. Then, asymptotic results are obtained when the rates for two writes are equal. Under this condition, the sum rate… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Asymptotic rates for lattice-based WOM codes.

  • B. M. Kurkoski
  • Presented at Non-Volatile Memories Workshop
  • 2012
1 Excerpt

Notes on a lattice-based WOM construction that guarantees two writes,

  • B. Kurkoski
  • Proceedings of the 34th Symposium on Information…
  • 2011
1 Excerpt

Convex Optimization

  • S. Boyd, L. Vandenberghe
  • Cambridge University Press
  • 2004

Similar Papers

Loading similar papers…