Ray Li | DeepAI

DeepAI AI Chat

Featured Co-authors

Percy Liang
165 publications
Thomas Drugman
59 publications
Venkatesan Guruswami
57 publications
Virginia Vassilevska Williams
45 publications
Mary Wootters
33 publications
Amir Abboud
27 publications
Itzhak Tamo
23 publications
Serge Gaspers
20 publications
Alexis Moinet
19 publications
Joshua Brakensiek
17 publications
Mina Dalirrooyfard
14 publications

∙ 08/25/2023

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets

A simple, recently observed generalization of the classical Singleton bo...

0 Omar Alrabiah, et al. ∙

∙ 07/14/2023

On Diameter Approximation in Directed Graphs

Computing the diameter of a graph, i.e. the largest distance, is a funda...

0 Amir Abboud, et al. ∙

∙ 07/06/2023

Improved rate-distance trade-offs for quantum codes with restricted connectivity

For quantum error-correcting codes to be realizable, it is important tha...

0 Nouédyn Baspin, et al. ∙

∙ 04/19/2023

Randomly punctured Reed–Solomon codes achieve list-decoding capacity over linear-sized fields

Reed–Solomon codes are a classic family of error-correcting codes consis...

0 Omar Alrabiah, et al. ∙

∙ 11/30/2022

Approximating binary longest common subsequence in almost-linear time

The Longest Common Subsequence (LCS) is a fundamental string similarity ...

0 Xiaoyu He, et al. ∙

∙ 06/27/2022

CopyCat2: A Single Model for Multi-Speaker TTS and Many-to-Many Fine-Grained Prosody Transfer

In this paper, we present CopyCat2 (CC2), a novel model capable of: a) s...

0 Sri Karlapati, et al. ∙

∙ 01/30/2022

Efficient Near-Optimal Codes for General Repeat Channels

Given a probability distribution 𝒟 over the non-negative integers, a 𝒟-r...

0 Francisco Pernice, et al. ∙

∙ 06/10/2021

Hardness of Approximate Diameter: Now for Undirected Graphs

Approximating the graph diameter is a basic task of both theoretical and...

0 Mina Dalirrooyfard, et al. ∙

∙ 06/09/2021

The zero-rate threshold for adversarial bit-deletions is less than 1/2

We prove that there exists an absolute constant δ>0 such any binary code...

0 Venkatesan Guruswami, et al. ∙

∙ 06/03/2021

Improved batch code lower bounds

Batch codes are a useful notion of locality for error correcting codes, ...

0 Ray Li, et al. ∙

∙ 11/24/2020

Wedge-Lifted Codes

We define wedge-lifted codes, a variant of lifted codes, and we study th...

0 Jabari Hastings, et al. ∙

∙ 11/09/2020

Improved List-Decodability of Reed–Solomon Codes via Tree Packings

This paper shows that there exist Reed–Solomon (RS) codes, over large fi...

0 Zeyu Guo, et al. ∙

∙ 08/12/2020

Improved SETH-hardness of unweighted Diameter

We prove that, assuming the Strong Exponential Time Hypothesis, for any ...

0 Ray Li, et al. ∙

∙ 04/28/2020

Bounds for list-decoding and list-recovery of random linear codes

A family of error-correcting codes is list-decodable from error fraction...

0 Venkatesan Guruswami, et al. ∙

∙ 08/12/2019

Coded trace reconstruction in a constant number of traces

The coded trace reconstruction problem asks to construct a code C⊂{0,1}^...

0 Joshua Brakensiek, et al. ∙

∙ 07/01/2019

Enumeration of Preferred Extensions in Almost Oriented Digraphs

In this paper, we present enumeration algorithms to list all preferred e...

0 Serge Gaspers, et al. ∙

∙ 06/26/2019

A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree

Decision Tree is a classic formulation of active learning: given n hypot...

0 Ray Li, et al. ∙

∙ 05/08/2019

Max-Cut in Degenerate H-Free Graphs

We obtain several lower bounds on the Max-Cut of d-degenerate H-free gra...

0 Ray Li, et al. ∙

∙ 05/06/2019

Lifted multiplicity codes and the disjoint repair group property

Lifted Reed Solomon Codes (Guo, Kopparty, Sudan 2013) were introduced in...

0 Ray Li, et al. ∙

∙ 05/06/2019

Lifted Multiplicity Codes

Lifted Reed Solomon Codes (Guo, Kopparty, Sudan 2013) were introduced in...

0 Ray Li, et al. ∙

∙ 02/26/2019

On Ramsey numbers of hedgehogs

The hedgehog H_t is a 3-uniform hypergraph on vertices 1,...,t+t2 such t...

0 Jacob Fox, et al. ∙

∙ 01/24/2018

Random linear binary codes have smaller list sizes than uniformly random binary codes

There has been a great deal of work establishing that random linear code...

0 Ray Li, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world