Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets.
Venkatesan Guruswami
,
Piotr Indyk
Venue
A*
STOC
Year
2002
Proceedings
STOC
DBLP record
conf/stoc/GuruswamiI02 ↗
Browse the full
STOC paper archive
.