most citedHigh Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes

1 citations · 2 across the 8 of their papers we have counts for

collaborators
Showing cs.ITShow all

8 papers · 1 filter

cs.IT2024

Performance Analysis and Code Design for Resistive Random-Access Memory Using Channel Decomposition Approach

Guanghui Song, Meiru Gao, Ying Li +2

A novel framework for performance analysis and code design is proposed to address the sneak path (SP) problem in resistive random-access memory (ReRAM) arrays. The main idea is to…

cs.IT2024

Constrained Coding and Deep Learning Aided Threshold Detection for Resistive Memories

Xingwei Zhong, Kui Cai, Guanghui Song +2

Resistive random access memory (ReRAM) is a promising emerging non-volatile memory (NVM) technology that shows high potential for both data storage and computing. However, its cros…

cs.IT2024★ 1 cited

High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes

Yi Ding, Xuan He, Tuan Thanh Nguyen +6

DNA-based data storage has been attracting significant attention due to its extremely high data storage density, low power consumption, and long duration compared to conventional d…

cs.IT2024

Deep Transfer Learning-based Detection for Flash Memory Channels

Zhen Mei, Kui Cai, Long Shi +3

The NAND flash memory channel is corrupted by different types of noises, such as the data retention noise and the wear-out noise, which lead to unknown channel offset and make the…

cs.IT2024

Deep-Learning-Based Adaptive Error-Correction Decoding for Spin-Torque Transfer Magnetic Random Access Memory (STT-MRAM)

Xingwei Zhong, Kui Cai, Peng Kang +2

Spin-torque transfer magnetic random access memory (STT-MRAM) is a promising emerging non-volatile memory (NVM) technology with wide applications. However, the data recovery of STT…

cs.IT2024

New Construction of -ary Codes Correcting a Burst of at most Deletions

Wentu Song, Kui Cai, Tony Q. S. Quek

In this paper, for any fixed positive integers and , we construct -ary codes correcting a burst of at most deletions with redundancy $\log n+8\log\log n+o(\log\log…

cs.IT2023

Outer Channel of DNA-Based Data Storage: Capacity and Efficient Coding Schemes

Xuan He, Yi Ding, Kui Cai +3

In this paper, we consider the outer channel for DNA-based data storage. When transmitting over the outer channel, each DNA string is treated as a unit/symbol that would be either…

cs.IT2023★ 1 cited

A New Version of q-ary Varshamov-Tenengolts Codes with More Efficient Encoders: The Differential VT Codes and The Differential Shifted VT Codes

Tuan Thanh Nguyen, Kui Cai, Paul H. Siegel

The problem of correcting deletions and insertions has recently received significantly increased attention due to the DNA-based data storage technology, which suffers from deletion…