Return to search

Geometries of Binary Constant Weight Codes

<p>This thesis shows how certain classes of binary constant weight codes can be represented geometrically using linear structures in Euclidean space. The geometric treatment is concerned mostly with codes with minimum distance 2(w - 1), that is, where any two codewords coincide in at most one entry; an algebraic generalization of parts of the theory also applies to some codes without this property. The presented theorems lead to a total of 18 improvements of the table of lower bounds on A(n,d,w) maintained by E. M. Rains and N. J. A. Sloane. Additional improvements have been made by finding new lexicographic codes.</p>

Identiferoai:union.ndltd.org:UPSALLA/oai:DiVA.org:kau-88
Date January 2006
CreatorsEkberg, Joakim
PublisherKarlstad University, Division for Engineering Sciences, Physics and Mathematics
Source SetsDiVA Archive at Upsalla University
LanguageEnglish
Detected LanguageEnglish
TypeStudent thesis, text

Page generated in 0.0017 seconds