Title of article
Bounds on codes over an alphabet of five elements Original Research Article
Author/Authors
Galina T. Bogdanova، نويسنده , , Patric R.J. ostergard، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
7
From page
13
To page
19
Abstract
We consider the problem of finding bounds and exact values of A5(n,d) — the maximum size of a code of length n and minimum distance d over an alphabet of 5 elements. Using a wide variety of constructions and methods, a table of bounds on A5(n,d) for n⩽11 is obtained.
Keywords
q-ary code , Error-correcting code , Code construction
Journal title
Discrete Mathematics
Serial Year
2001
Journal title
Discrete Mathematics
Record number
949799
Link To Document