activity
20082011
most citedA Construction of Systematic MDS Codes with Minimum Repair Bandwidth

56 citations · 130 across the 7 of their papers we have counts for

collaborators

7 papers

cs.MM2011

Celerity: A Low-Delay Multi-Party Conferencing Solution

X. Chen, M. Chen, B. Li +3

In this paper, we attempt to revisit the problem of multi-party conferencing from a practical perspective, and to rethink the design space involved in this problem. We believe that…

cs.IT2010★ 13 cited

A Survey on Network Codes for Distributed Storage

Alexandros G. Dimakis, Kannan Ramchandran, Yunnan Wu +1

Distributed storage systems often introduce redundancy to increase reliability. When coding is used, the repair problem arises: if a node storing encoded information fails, in orde…

cs.IT2009★ 3 cited

Position Modulation Code for Rewriting Write-Once Memories

Yunnan Wu, Anxiao Jiang

A write-once memory (wom) is a storage medium formed by a number of ``write-once'' bit positions (wits), where each wit initially is in a `0' state and can be changed to a `1' stat…

cs.IT2009★ 4 cited

Spectrum Sharing as Network Congestion Games

Sahand Ahmad, Cem Tekin, Mingyan Liu +2

This paper has been withdrawn by the first author due to incomplete bibliography and incorporation of multiple formats in the same file.

cs.GT2009★ 23 cited

Congestion games with resource reuse and applications in spectrum sharing

Sahand Haji Ali Ahmad, Mingyan Liu, Yunnan Wu

In this paper we consider an extension to the classical definition of congestion games (CG) in which multiple users share the same set of resources and their payoff for using any r…

cs.IT2009★ 56 cited

A Construction of Systematic MDS Codes with Minimum Repair Bandwidth

Yunnan Wu

In a distributed storage system based on erasure coding, an important problem is the \emph{repair problem}: If a node storing a coded piece fails, in order to maintain the same lev…