@inproceedings{a83b9e899640453ab4034ce15793eed3,
title = "LDPC Codes with Local and Global Decoding",
abstract = "This paper presents a theoretical study of a new type of LDPC codes that is highly motivated by practical storage applications. LDPCL codes (suffix L represents locality) are LDPC codes that can be decoded either as usual over the full code block, or locally when a smaller sub-block is accessed (to reduce latency). LDPCL codes are designed to maximize the error-correction performance vs. rate in the usual (global) mode, while at the same time providing a certain performance in the local mode. We develop a theoretical framework for the design of LDPCL codes over the binary erasure channel. Our results include generalizing the density-evolution analysis to two dimensions, proving the existence of a decoding threshold and showing how to compute it, and constructing capacity-achieving sequences for any pair of local and global thresholds. Proofs and more results are made available at the arXiv (http://arxiv.org/abs/1801.03951).",
keywords = "Density evolution, Iterative decoding, Low-density parity-check codes, Multi-block coding",
author = "Eshed Ram and Yuval Cassuto",
note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 2018 IEEE International Symposium on Information Theory, ISIT 2018 ; Conference date: 17-06-2018 Through 22-06-2018",
year = "2018",
month = aug,
day = "15",
doi = "10.1109/ISIT.2018.8437736",
language = "الإنجليزيّة",
isbn = "9781538647806",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "1151--1155",
booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",
}