5 citations · 11 across the 5 of their papers we have counts for
8 papers · 1 filter
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…
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…
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…
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…
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…
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…
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…
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…