Generating Constant Weight Binary Codes
Uloženo v:
| Název: | Generating Constant Weight Binary Codes |
|---|---|
| Jazyk: | English |
| Autoři: | Knight, D.G |
| Zdroj: | International Journal of Mathematical Education in Science and Technology. Jan 2008 39(1):115-124. |
| Dostupnost: | 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 |
| Peer Reviewed: | Y |
| Fyzický popis: | |
| Page Count: | 10 |
| Datum vydání: | 2008 |
| Druh dokumentu: | Journal Articles Reports - Descriptive |
| Education Level: | Higher Education |
| Descriptors: | Mathematics Instruction, College Freshmen, Programming, Coding |
| DOI: | 10.1080/00207390701453496 |
| ISSN: | 0020-739X |
| Abstrakt: | 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. |
| Abstractor: | Author |
| Number of References: | 12 |
| Entry Date: | 2007 |
| Přístupové číslo: | EJ781070 |
| Databáze: | ERIC |
Full Text Finder 
Nájsť tento článok vo Web of Science Buďte první, kdo okomentuje tento záznam!