Generating constant weight binary codes

David Knight

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid


The determination of bounds for A(n, d,w), the maximum possible number of binary vectors of length n, weight w, and pairwise Hamming distance no less than d, is a classic problem in coding theory. Such sets of vectors have many applications. A description is given of how the problem can be used in a first-year undergraduate computational mathematics class as a challenging alternative to more traditional problems, and thus provide motivation for programming with loops and arrays, and the investigation of computational efficiency. Some new results, obtained by a fast implementation of a lexicographic approach, are also presented.
Iaith wreiddiolSaesneg
Tudalennau (o-i)115 - 124
Nifer y tudalennau9
CyfnodolynInternational Journal of Mathematical Education in Science and Technology
Rhif cyhoeddi1
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsE-gyhoeddi cyn argraffu - 1 Ion 2008

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Generating constant weight binary codes'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn