NotesFAQContact Us
Collection
Advanced
Search Tips
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ781070
Record Type: Journal
Publication Date: 2008-Jan
Pages: 10
Abstractor: Author
Reference Count: 12
ISBN: N/A
ISSN: ISSN-0020-739X
Generating Constant Weight Binary Codes
Knight, D.G.
International Journal of Mathematical Education in Science and Technology, v39 n1 p115-124 Jan 2008
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.
Taylor & Francis, Ltd. 325 Chestnut Street Suite 800, Philadelphia, PA 19106. Tel: 800-354-1420; Fax: 215-625-2940; Web site: http://www.tandf.co.uk/journals/default.html
Publication Type: Journal Articles; Reports - Descriptive
Education Level: Higher Education
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A