activity
20142025
most citedFountain Codes with Nonuniform Selection Distributions through Feedback

30 citations · 47 across the 20 of their papers we have counts for

collaborators

30 papers

cs.IT2025

Quantizing for Noisy Flash Memory Channels

Juyun Oh, Taewoo Park, Jiwoong Im +2

Flash memory-based processing-in-memory (flash-based PIM) offers high storage capacity and computational efficiency but faces significant reliability challenges due to noise in hig…

cs.CR2025

Mutual Information Minimization for Side-Channel Attack Resistance via Optimal Noise Injection

Jiheon Woo, Donggyun Ryu, Daewon Seo +4

Side-channel attacks (SCAs) pose a serious threat to system security by extracting secret keys through physical leakages such as power consumption, timing variations, and electroma…

cs.LG2024

Robust Regression with Ensembles Communicating over Noisy Channels

Yuval Ben-Hur, Yuval Cassuto

As machine-learning models grow in size, their implementation requirements cannot be met by a single computer system. This observation motivates distributed settings, in which inte…

cs.IT2022★ 1 cited

Genomic Compression with Read Alignment at the Decoder

Yotam Gershon, Yuval Cassuto

We propose a new compression scheme for genomic data given as sequence fragments called reads. The scheme uses a reference genome at the decoder side only, freeing the encoder from…

cs.IT2022★ 1 cited

A Unified Spatially Coupled Code Design: Threshold, Cycles, and Locality

Homa Esfahanizadeh, Eshed Ram, Yuval Cassuto +1

Spatially-Coupled (SC)-LDPC codes are known to have outstanding error-correction performance and low decoding latency. Whereas previous works on LDPC and SC-LDPC codes mostly take…

cs.IT2021★ 1 cited

Generalized LRS Estimator for Min-entropy Estimation

Jiheon Woo, Chanhee Yoo, Young-Sik Kim +2

The min-entropy is a widely used metric to quantify the randomness of generated random numbers, which measures the difficulty of guessing the most likely output. It is difficult to…