most citedBalanced Modulation for Nonvolatile Memories

17 citations · 41 across the 9 of their papers we have counts for

collaborators
Showing cs.ITShow all

9 papers · 1 filter

cs.IT201217 cited

Balanced Modulation for Nonvolatile Memories

Hongchao Zhou, Anxiao, Jiang +1

This paper presents a practical writing/reading scheme in nonvolatile memories, called balanced modulation, for minimizing the asymmetric component of errors. The main idea is to e…

cs.IT20121 cited

Nonuniform Codes for Correcting Asymmetric Errors in Data Storage

Hongchao Zhou, Anxiao, Jiang +1

The construction of asymmetric error correcting codes is a topic that was studied extensively, however, the existing approach for code construction assumes that every codeword shou…

cs.IT2012

Efficiently Extracting Randomness from Imperfect Stochastic Processes

Hongchao Zhou, Jehoshua Bruck

We study the problem of extracting a prescribed number of random bits by reading the smallest possible number of symbols from non-ideal stochastic processes. The related interval a…

cs.IT20122 cited

Linear Transformations for Randomness Extraction

Hongchao Zhou, Jehoshua Bruck

Information-efficient approaches for extracting randomness from imperfect sources have been extensively studied, but simpler and faster ones are required in the high-speed applicat…

cs.IT20124 cited

Streaming Algorithms for Optimal Generation of Random Bits

Hongchao Zhou, Jehoshua Bruck

Generating random bits from a source of biased coins (the biased is unknown) is a classical question that was originally studied by von Neumann. There are a number of known algorit…

cs.IT20128 cited

A Universal Scheme for Transforming Binary Algorithms to Generate Random Bits from Loaded Dice

Hongchao Zhou, Jehoshua Bruck

In this paper, we present a universal scheme for transforming an arbitrary algorithm for biased 2-face coins to generate random bits from the general source of an m-sided die, henc…