109
Voted
CORR
2004
Springer
15 years 2 months ago
2004
Springer
Let ( ) denote the maximum size of a -ary code of length and distance . We study the minimum asymptotic redundancy ( ) = log ( ) as grows while and are fixed. For any and 1, long a...