activity
20172026
most citedA Combinatorial Methodology for Optimizing Non-Binary Graph-Based Codes: Theoretical Analysis and Applications in Data Storage

22 citations · 164 across the 31 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

cs.IT2021★ 5 cited

Read-and-Run Constrained Coding for Modern Flash Devices

Ahmed Hareedy, Simeng Zheng, Paul Siegel +1

The pivotal storage density win achieved by solid-state devices over magnetic devices in 2015 is a result of multiple innovations in physics, architecture, and signal processing. O…

cs.IT2021

Breaking the Computational Bottleneck: Design of Near-Optimal High-Memory Spatially-Coupled Codes

Siyi Yang, Ahmed Hareedy, Robert Calderbank +1

Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications and data storage sy…

cs.IT2021

Hierarchical Hybrid Error Correction for Time-Sensitive Devices at the Edge

Siyi Yang, Ahmed Hareedy, Robert Calderbank +1

Computational storage, known as a solution to significantly reduce the latency by moving data-processing down to the data storage, has received wide attention because of its potent…

cs.IT2021★ 1 cited

GRADE-AO: Towards Near-Optimal Spatially-Coupled Codes With High Memories

Siyi Yang, Ahmed Hareedy, Shyam Venkatasubramanian +2

Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications. They also find app…

cs.IT2021

Unequal Error Protection Achieves Threshold Gains on BEC and BSC via Higher Fidelity Messages

Beyza Dabak, Ahmed Hareedy, Alexei Ashikhmin +1

Because of their capacity-approaching performance, graph-based codes have a wide range of applications, including communications and storage. In these codes, unequal error protecti…