Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)
DOI: 10.1109/isit.2001.935948
|View full text |Cite
|
Sign up to set email alerts
|

Upper bounds on the list-decoding radius of Reed-Solomon codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 11 publications
0
0
0
Order By: Relevance