This thesis presents new methods for finding optimal and near-optimal constant weight binary codes with distance d and weight w such that d=2(w-1). These methods have led to the discovery of a number of new codes which are being submitted for publication. Improvements in methods for generating lexicographic codes are also discussed, with suggestions for further research in this area.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kau-892 |
| Date | January 2007 |
| Creators | Taub, David |
| Publisher | Karlstads universitet, Fakulteten för teknik- och naturvetenskap |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0021 seconds