Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance

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 algebraic codes are designed that improve on the Bose

• Type: Journal
• Year: 2004
• Where: CORR
• Authors: Sergey Yekhanin, Ilya Dumer
• Keywords: -ary Code, CORR 2004, Education, Maximum Size, Minimum Asymptotic Redundancy