activity
20112017
most citedList decoding subspace codes from insertions and deletions

5 citations · 11 across the 5 of their papers we have counts for

collaborators
Showing cs.ITShow all

8 papers · 1 filter

cs.IT2017

Fundamental Limits of Communication Over State-Dependent Channels With Feedback

Mladen Kovačević, Carol Wang, Vincent Y. F. Tan

The fundamental limits of communication over state-dependent discrete memoryless channels with noiseless feedback are studied, under the assumption that the communicating parties a…

cs.IT2017

On the Maximum Size of Block Codes Subject to a Distance Criterion

Ling-Hua Chang, Po-Ning Chen, Vincent Y. F. Tan +2

We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than . The achievability argument involves an iterative c…

cs.IT2016

On the capacity of the binary adversarial wiretap channel

Carol Wang

New bounds on the semantic secrecy capacity of the binary adversarial wiretap channel are established . Against an adversary which reads a fraction of the transmitted codewor…

cs.IT2016★ 1 cited

Maximally Recoverable Codes for Grid-like Topologies

Parikshit Gopalan, Guangda Hu, Swastik Kopparty +3

The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in…

cs.IT2014

Deletion codes in the high-noise and high-rate regimes

Venkatesan Guruswami, Carol Wang

The noise model of deletions poses significant challenges in coding theory, with basic questions like the capacity of the binary deletion channel still being open. In this paper, w…

cs.IT2013

Explicit rank-metric codes list-decodable with optimal redundancy

Venkatesan Guruswami, Carol Wang

We construct an explicit family of linear rank-metric codes over any field that enables efficient list decoding up to a fraction of errors in the rank metric wi…

cs.IT2012★ 5 cited

List decoding subspace codes from insertions and deletions

Venkatesan Guruswami, Srivatsan Narayanan, Carol Wang

We present a construction of subspace codes along with an efficient algorithm for list decoding from both insertions and deletions, handling an information-theoretically maximum fr…

cs.IT2011★ 5 cited

Optimal rate list decoding via derivative codes

Venkatesan Guruswami, Carol Wang

The classical family of Reed-Solomon codes over a field $\F_q$ consist of the evaluations of polynomials $f \in \F_q[X]$ of degree at distinct field elements. I…