2000 character limit reached
New upper bounds for trace reconstruction
Published 7 Sep 2020 in math.PR, cs.IT, math.CO, and math.IT | (2009.03296v3)
Abstract: We show that any $n$-bit string can be recovered with high probability from $\exp(\widetilde{O}(n{1/5}))$ independent random subsequences.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.