Unique Decoding of Explicit \varepsilon-balanced Codes Near the Gilbert-Varshamov Bound

The Gilbert-Varshamov bound (non-constructively) establishes the existence of binary codes of distance 1/2-\varepsilon and rate \Omega(\varepsilon^{2}) (where an upper bound of O(\varepsilon^{2}\log(1/\varepsilon)) is known). Ta-Shma [STOC 2017] gave an explicit construction of \varepsilon -balanced...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings / annual Symposium on Foundations of Computer Science s. 434 - 445
Hlavní autori:	Jeronimo, Fernando Granha, Quintana, Dylan, Srivastava, Shashank, Tulsiani, Madhur
Médium:	Konferenčný príspevok..
Jazyk:	English Japanese
Vydavateľské údaje:	IEEE 01.11.2020
Predmet:	Binary codes coding theory Decoding Encoding Iterative decoding Iterative methods Linear codes sdp sum of squares Task analysis
ISSN:	2575-8454
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!