One Code Fits All: Strong stuck-at codes for versatile memory encoding (2403.19061v1)
Abstract: In this work we consider a generalization of the well-studied problem of coding for stuck-at'' errors, which we refer to asstrong stuck-at'' codes. In the traditional framework of stuck-at codes, the task involves encoding a message into a one-dimensional binary vector. However, a certain number of the bits in this vector are 'frozen', meaning they are fixed at a predetermined value and cannot be altered by the encoder. The decoder, aware of the proportion of frozen bits but not their specific positions, is responsible for deciphering the intended message. We consider a more challenging version of this problem where the decoder does not know also the fraction of frozen bits. We construct explicit and efficient encoding and decoding algorithms that get arbitrarily close to capacity in this scenario. Furthermore, to the best of our knowledge, our construction is the first, fully explicit construction of stuck-at codes that approach capacity.
- Simple constructions of almost k-wise independent random variables. Random Structures & Algorithms, 3(3):289–304, 1992.
- Explicit and efficient wom codes of finite length. IEEE Transactions on Information Theory, 66(5):2669–2682, 2019.
- Invertible zero-error dispersers and defective memory with stuck-at errors. In International Workshop on Approximation Algorithms for Combinatorial Optimization, pages 553–564. Springer, 2012.
- Chris Heegard. Partitioned linear block codes for computer memory with’stuck-at’defects. IEEE Transactions on Information Theory, 29(6):831–842, 1983.
- Chris Heegard. On the capacity of permanent memory. IEEE Transactions on Information Theory, 31(1):34–42, 1985.
- Coding for memory with stuck-at defects. In 2013 IEEE International Conference on Communications (ICC), pages 4347–4352. IEEE, 2013.
- Coding in a memory with defective cells. Problemy peredachi informatsii, 10(2):52–60, 1974.
- Algorithms for memories with stuck cells. In 2010 IEEE International Symposium on Information Theory, pages 968–972. IEEE, 2010.
- Explicit capacity achieving codes for defective memories. In 2015 IEEE International Symposium on Information Theory (ISIT), pages 641–645. IEEE, 2015.
- How to reuse a “write-once” memory. Information and control, 55(1-3):1–19, 1982.
- Amir Shpilka. New constructions of wom codes using the wozencraft ensemble. IEEE Transactions on Information Theory, 59(7):4520–4529, 2013.
- Boris Solomonovich Tsybakov. Defect and error correction. Problemy peredachi informatsii, 11(3):21–30, 1975.
- Codes for partially stuck-at memory cells. IEEE Transactions on Information Theory, 62(2):639–654, 2015.