Duality between erasures and defects

We investigate the duality of the binary erasure channel (BEC) and the binary defect channel (BDC). This duality holds for channel capacities, capacity achieving schemes, minimum distances, and upper bounds on the probability of failure to retrieve the original message. In addition, the relations between BEC, BDC, binary erasure quantization (BEQ), and write-once memory (WOM) are described. From these relations we claim that the capacity of the BDC can be achieved by Reed-Muller (RM) codes under maximum a posterior (MAP) decoding. Also, polar codes with a successive cancellation encoder achieve the capacity of the BDC. Inspired by the duality between the BEC and the BDC, we introduce locally rewritable codes (LWC) for resistive memories, which are the counterparts of locally repairable codes (LRC) for distributed storage systems. The proposed LWC can improve endurance limit and power efficiency of resistive memories.

[1]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[2]  Santhosh Kumar,et al.  Reed–Muller Codes Achieve Capacity on Erasure Channels , 2015, IEEE Transactions on Information Theory.

[3]  Chris Heegard,et al.  On the capacity of permanent memory , 1985, IEEE Trans. Inf. Theory.

[4]  Minghua Chen,et al.  Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[5]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[6]  Sriram Vishwanath,et al.  Optimal locally repairable codes via rank-metric codes , 2013, 2013 IEEE International Symposium on Information Theory.

[7]  B. V. K. Vijaya Kumar,et al.  On the Duality of Erasures and Defects , 2014, ArXiv.

[8]  Itzhak Tamo,et al.  A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.

[9]  Aaron D. Wyner,et al.  Recent results in the Shannon theory , 1974, IEEE Trans. Inf. Theory.

[10]  Ashish Jagmohan,et al.  Coding for Multilevel Heterogeneous Memories , 2010, 2010 IEEE International Conference on Communications.

[11]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[12]  M. H. Lee,et al.  Optimization of programming current on endurance of phase change memory , 2012, Proceedings of Technical Program of 2012 VLSI Technology, System and Application.

[13]  B. V. K. Vijaya Kumar,et al.  Coding for memory with stuck-at defects , 2013, 2013 IEEE International Conference on Communications (ICC).

[14]  Shimeng Yu,et al.  Metal–Oxide RRAM , 2012, Proceedings of the IEEE.

[15]  Adi Shamir,et al.  How to Reuse a "Write-Once" Memory , 1982, Inf. Control..

[16]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[17]  Chris Heegard.  Partitioned linear block codes for computer memory with 'stuck-at' defects , 1983, IEEE Trans. Inf. Theory.

[18]  Dimitris S. Papailiopoulos,et al.  Optimal locally repairable codes and connections to matroid theory , 2013, 2013 IEEE International Symposium on Information Theory.

[19]  B. V. K. Vijaya Kumar,et al.  Writing on dirty flash memory , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[20]  Wentao Huang,et al.  Rewriting flash memories by message passing , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[21]  J. Bain,et al.  Electronic Instabilities Leading to Electroformation of Binary Metal Oxide‐based Resistive Switches , 2014 .

[22]  A. J. Han Vinck,et al.  On the general defective channel with informed encoder and capacities of some constrained memories , 1994, IEEE Trans. Inf. Theory.

[23]  Paul H. Siegel,et al.  Codes for Write-Once Memories , 2012, IEEE Transactions on Information Theory.

[24]  B. V. K. Vijaya Kumar,et al.  Iterative Cross-Entropy Encoding for Memory Systems with Stuck-At Errors , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[25]  A. Robert Calderbank,et al.  Coset coding to extend the lifetime of memory , 2013, 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA).

[26]  Emin Martinian,et al.  Iterative Quantization Using Codes On Graphs , 2004, ArXiv.

[27]  Rüdiger L. Urbanke,et al.  Polar Codes are Optimal for Lossy Source Coding , 2009, IEEE Transactions on Information Theory.

[28]  David Burshtein,et al.  Polar write once memory codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[29]  Anxiao Jiang.  On The Generalization of Error-Correcting WOM Codes , 2007, 2007 IEEE International Symposium on Information Theory.

[30]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[31]  Paul H. Siegel,et al.  Cyclic linear binary locally repairable codes , 2015, 2015 IEEE Information Theory Workshop (ITW).

[32]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[33]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[34]  Cheng Huang,et al.  On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.

[35]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[36]  A. Robert Calderbank,et al.  Cyclic LRC codes and their subfield subcodes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[37]  B. V. K. Vijaya Kumar,et al.  Coding scheme for 3D vertical flash memory , 2014, 2015 IEEE International Conference on Communications (ICC).

[38]  Ashish Jagmohan,et al.  Algorithms for memories with stuck cells , 2010, 2010 IEEE International Symposium on Information Theory.

[39]  M. Breitwisch.  Phase Change Memory , 2008, 2008 International Interconnect Technology Conference.

[40]  B. V. K. Vijaya Kumar,et al.  Locally rewritable codes for resistive memories , 2016, 2016 IEEE International Conference on Communications (ICC).

[41]  Alexander Vardy,et al.  Explicit capacity achieving codes for defective memories , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[42]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[43]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.