English
Related papers

Related papers: Using Short Synchronous WOM Codes to Make WOM Code…

200 papers

Non-orthogonal multiple access (NOMA) is a candidate multiple access scheme in 5G systems for the simultaneous access of tremendous number of wireless nodes. On the other hand, RF-enabled wireless energy harvesting is a promising technology…

Information Theory · Computer Science 2018-06-08 Jie Gong , Xiang Chen

An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…

Information Theory · Computer Science 2009-08-07 H. Gluesing-Luerssen , U. Helmke , J. I. Iglesias Curto

Polar codes have been gaining a lot of interest due to it being the first coding scheme to provably achieve the symmetric capacity of a binary memoryless channel with an explicit construction. However, the main drawback of polar codes is…

Information Theory · Computer Science 2019-11-11 Heshani Gamage , Vismika Ranasinghe , Nandana Rajatheva , Matti Latva-aho

In this work, we study a new model of defect memory cells, called partially stuck-at memory cells, which is motivated by the behavior of multi-level cells in non-volatile memories such as flash memories and phase change memories. If a cell…

Information Theory · Computer Science 2015-05-14 Antonia Wachter-Zeh , Eitan Yaakobi

This paper considers coding for so-called partially stuck memory cells. Such memory cells can only store partial information as some of their levels cannot be used due to, e.g., wear out. First, we present a new code construction for…

Information Theory · Computer Science 2021-03-18 Haider Al Kim , Sven Puchinger , Antonia Wachter-Zeh

Error-correcting codes are a method for representing data, so that one can recover the original information even if some parts of it were corrupted. The basic idea, which dates back to the revolutionary work of Shannon and Hamming about a…

Information Theory · Computer Science 2026-03-05 Mrinal Kumar , Noga Ron-Zewi

In this work, we study a recently proposed direct shaping code for flash memory. This rate-1 code is designed to reduce the wear for SLC (one bit per cell) flash by minimizing the average fraction of programmed cells when storing structured…

Information Theory · Computer Science 2020-07-14 Yi Liu , Paul H. Siegel

We study codes that are list-decodable under insertions and deletions. Specifically, we consider the setting where a codeword over some finite alphabet of size $q$ may suffer from $\delta$ fraction of adversarial deletions and $\gamma$…

Information Theory · Computer Science 2018-02-26 Bernhard Haeupler , Amirbehshad Shahrasbi , Madhu Sudan

Multi-kernel polar codes have recently been proposed to construct polar codes of lengths different from powers of two. Decoder implementations for multi-kernel polar codes need to account for this feature, that becomes critical in memory…

Information Theory · Computer Science 2018-09-26 Valerio Bioglio , Carlo Condo , Ingmar Land

The subblock energy-constrained codes (SECCs) and sliding window-constrained codes (SWCCs) have recently attracted attention due to various applications in communcation systems such as simultaneous energy and information transfer. In a…

Information Theory · Computer Science 2020-09-22 Tuan Thanh Nguyen , Kui Cai , Kees A. Schouhamer Immink

Concatenating the state-of-the-art codes at moderate rates with repetition codes has emerged as a practical solution deployed in various standards for ultra-low-power devices such as in Internet-of-Things (IoT) networks. In this paper, we…

Information Theory · Computer Science 2022-03-24 Fariba Abbasi , Hessam Mahdavifar , Emanuele Viterbo

A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity $I(W)$ of any given binary-input discrete memoryless channel (B-DMC) $W$. The symmetric capacity is the highest rate…

Information Theory · Computer Science 2016-11-18 Erdal Arikan

Complex orthogonal designs (CODs) play a crucial role in the construction of space-time block codes. Their real analog, real orthogonal designs (or equivalently, sum of squares composition formula) have a long history. Adams et al. (2011)…

Information Theory · Computer Science 2023-07-10 Yiwen Gao , Yuan Li , Haibin Kan

In this paper, we propose an efficient reliability based segmentation-discarding decoding (SDD) algorithm for short block-length codes. A novel segmentation-discarding technique is proposed along with the stopping rule to significantly…

Information Theory · Computer Science 2019-01-23 Chentao Yue , Mahyar Shirvanimoghaddam , Yonghui Li , Branka Vucetic

The growing demand for higher data rates necessitates continuous innovations in wireless communication systems, particularly with the emergence of 6G. Channel coding plays a crucial role in this evolution. In 5G systems, rate-adaptive…

SC-LDPC codes with sub-block locality can be decoded locally at the level of sub-blocks that are much smaller than the full code block, thus providing fast access to the coded information. The same code can also be decoded globally using…

Information Theory · Computer Science 2020-05-28 Homa Esfahanizadeh , Eshed Ram , Yuval Cassuto , Lara Dolecek

Deep polar codes are pre-transformed polar codes that employ a multi-layered polar kernel transformation strategy to enhance code performance in short blocklength regimes. However, like conventional polar codes, their block length is…

Information Theory · Computer Science 2025-05-13 Geon Choi , Namyoon Lee

Variable length coding for Non-Volatile Memory (NVM) technologies is a promising method to improve memory capacity and system performance through compressing memory blocks. However, compression techniques used to improve capacity or…

Emerging Technologies · Computer Science 2017-10-26 Seyed Mohammad Seyedzadeh , Alex K. Jones , Rami Melhem

We give a scheme for loss tolerantly building a linear optical quantum memory which itself is tolerant to qubit loss. We use the encoding recently introduced in [Phys. Rev. Lett. 97, 120501, (2006)] and give a method for efficiently…

Quantum Physics · Physics 2007-09-12 Michael Varnava , Daniel Browne , Terry Rudolph

This paper proposes a polar code construction scheme that reduces constituent-code supplemented decoding latency. Constituent codes are the sub-codewords with specific patterns. They are used to accelerate the successive cancellation…

Information Theory · Computer Science 2017-09-22 Tiben Che , Gwan Choi