Redundancy allocation in finite-length nested codes for nonvolatile memories

@article{Kim2018RedundancyAI,
  title={Redundancy allocation in finite-length nested codes for nonvolatile memories},
  author={Yongjune Kim and B. V. K. Vijaya Kumar},
  journal={Journal of Communications and Networks},
  year={2018},
  volume={20},
  pages={354-365}
}
  • Yongjune Kim, B. Kumar
  • Published 28 February 2018
  • Computer Science, Mathematics
  • Journal of Communications and Networks
In this paper, we investigate the optimum way to allocate redundancy of finite-length nested codes for modern nonvolatile memories suffering from both permanent defects and transient errors (erasures or random errors). A nested coding approach such as partitioned codes can handle both permanent defects and transient errors by using two parts of redundancy: 1) Redundancy to deal with permanent defects and 2) redundancy for transient errors. We consider two different channel models of the binary… Expand

References

SHOWING 1-10 OF 23 REFERENCES
Redundancy allocation of partitioned linear block codes
  • Yongjune Kim, B. Kumar
  • Mathematics, Computer Science
  • 2013 IEEE International Symposium on Information Theory
  • 2013
TLDR
The optimal redundancy allocation will be investigated using simulations and the simulation results show that the PLBC can significantly reduce the probability of decoding failure in memory with defects. Expand
Partitioned linear block codes for computer memory with 'stuck-at' defects
  • C. Heegard
  • Computer Science
  • IEEE Trans. Inf. Theory
  • 1983
TLDR
It is shown that partitioned linear block codes achieve the Shannon capacity for a computer memory with symmetric defects and errors. Expand
Explicit capacity achieving codes for defective memories
TLDR
It is shown how the state of the art capacity achieving codes, in combination with a coset coding and another error correcting code, can be used in order to asymptotically achieve the capacity of the binary defective memory. Expand
Duality between erasures and defects
  • Yongjune Kim, B. Kumar
  • Computer Science, Mathematics
  • 2016 Information Theory and Applications Workshop (ITA)
  • 2016
TLDR
Inspired by the duality between the BEC and the BDC, locally rewritable codes (LWC) for resistive memories are introduced, which are the counterparts of locally repairable code (LRC) for distributed storage systems. Expand
Iterative Cross-Entropy Encoding for Memory Systems with Stuck-At Errors
TLDR
Simulation results show that the cross-entropy based coding scheme provides an improved block error rate (BLER) performance, or alternatively, a higher overall storage capacity. Expand
Nested linear/Lattice codes for structured multiterminal binning
TLDR
Nested codes are proposed, or more specifically, nested parity-check codes for the binary case and nested lattices in the continuous case, which connect network information theory with the rich areas of linear codes and lattice codes, and have strong potential for practical applications. Expand
Coding for Multilevel Heterogeneous Memories
TLDR
It is shown that the heterogeneous memory problem can be formulated in terms of the information-theoretic `Channel Coding with Side-Information at Transmitter' (CSIT) paradigm, and a binary decomposition of the problem is presented, which allows for simple binary code constructions. Expand
Algorithms for memories with stuck cells
TLDR
A class of algorithms for encoding data in memories with stuck cells based on earlier code constructions termed cyclic Partitioned Linear Block Codes, which has complexity O((u logq n)2) Fq operations, which it will be shown compares favorably to a generic approach based on Gaussian elimination. Expand
Coding for memory with stuck-at defects
  • Yongjune Kim, B. Kumar
  • Computer Science, Mathematics
  • 2013 IEEE International Conference on Communications (ICC)
  • 2013
TLDR
An encoding scheme for partitioned linear block codes (PLBC) which mask the stuck-at defects in memories is proposed and an upper bound and the estimate of the probability that masking fails are derived. Expand
Locally Rewritable Codes for Resistive Memories
TLDR
It is shown how a small value of rewriting locality can improve write endurance and power consumption by deriving the upper bounds on writing cost and the construction of LWC is investigated. Expand
...
1
2
3
...