Abstract
In this paper we give several new constructions of WOM codes. The novelty in our constructions is the use of the so called Wozencraft ensemble of linear codes. Specifically, we obtain the following results.
We give an explicit construction of a two-write Write-Once-Memory (WOM for short) code that approaches capacity, over the binary alphabet. More formally, for every ε > 0, 0 < p < 1 and n = (1/ε)O(1/pε) we give a construction of a two-write WOM code of length n and capacity H(p) + 1 − p − ε. Since the capacity of a two-write WOM code is max p (H(p) + 1 − p), we get a code that is ε-close to capacity. Furthermore, encoding and decoding can be done in time O(n 2·poly(logn)) and time O(n·poly(logn)), respectively, and in logarithmic space.
We highlight a connection to linear seeded extractors for bit-fixing sources. In particular we show that obtaining such an extractor with seed length O(logn) can lead to improved parameters for 2-write WOM codes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rivest, R.L., Shamir, A.: How to reuse a “write-once” memory. Information and Control 55(1-3), 1–19 (1982)
Yaakobi, E., Kayser, S., Siegel, P.H., Vardy, A., Wolf, J.K.: Efficient two-write wom-codes. In: Proceedings of IEEE Information Theory Workshop, Dublin, Ireland (2010)
Heegard, C.: On the capacity of permanent memory. IEEE Transactions on Information Theory 31(1), 34–41 (1985)
Fu, F., Vinck, A.J.H.: On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph. IEEE Transactions on Information Theory 45(1), 308–313 (1999)
Shpilka, A.: New constructions of WOM codes using the Wozencraft ensemble. CoRR abs/1110.6590 (2011)
Kayser, S., Yaakobi, E., Siegel, P.H., Vardy, A., Wolf, J.K.: Multiple-write wom-codes. In: Proceedings of the 48th Annual Allerton Conference on Communication, Control and Computing (2010)
Cohen, G., Godlewski, P., Merkx, F.: Linear binary code for writeonce memories. IEEE Transactions on Information Theory 32(5), 697–700 (1986)
Wu, Y.: Low complexity codes for writing a write-once memory twice. In: Proceedings of IEEE International Symposium on Information Theory, pp. 1928–1932 (2010)
Massey, J.L.: Threshold decoding. Technical Report 410, Massachusetts Institute of Technology, Research Laboratory of Electronics, Cambridge, MA (1963)
Justesen, J.: A class of constructive asymptotically good algebraic codes. IEEE Transactions on Information Theory 18, 652–656 (1972)
Zyablov, V.V.: An estimate of the complexity of constructing binary linear cascade codes. Probl. Peredachi Inf. 7(1), 5–13 (1971)
Rao, A.: Randomness Extractors for Independent Sources and Applications. PhD thesis, U. T. Austin (2007)
Raz, R., Reingold, O., Vadhan, S.P.: Extracting all the randomness and reducing the error in trevisan’s extractors. J. Comput. Syst. Sci. 65(1), 97–128 (2002)
Trevisan, L.: Extractors and pseudorandom generators. J. ACM 48(4), 860–879 (2001)
Rao, A.: Extractors for low-weight affine sources. In: Proceedings of the 24th Annual CCC, pp. 95–101 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shpilka, A. (2012). Capacity Achieving Two-Write WOM Codes. In: Fernández-Baca, D. (eds) LATIN 2012: Theoretical Informatics. LATIN 2012. Lecture Notes in Computer Science, vol 7256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29344-3_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-29344-3_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29343-6
Online ISBN: 978-3-642-29344-3
eBook Packages: Computer ScienceComputer Science (R0)