Linear code: Difference between revisions

Content deleted Content added
Tags: Mobile edit Mobile web edit
added Bonisoli's theorem with 2 references
Line 76:
 
''Lemma'': Any linear code is permutation equivalent to a code which is in standard form.
 
==Bonisoli's theorem==
A code is defined to be '''equidistant''' if and only if there exists some constant ''d'' such that the distance between any two of the code's distinct codewords is equal to ''d''.<ref>{{cite journal|author=Etzion, Tuvi|author2=Raviv, Netanel|title=Equidistant codes in the Grassmannian|journal=arXiv preprint arXiv:1308.6231|year=2013|url=https://arxiv.org/abs/1308.6231}}</ref> In 1984 Arrigo Bonisoli determined the structure of linear one-weight codes over finite fields and proved that every equidistant linear code is a sequence of [[w:Dual code|dual]] [[Hamming code]]s.<ref>{{cite journal|author=Bonisoli, A.|year=1984|title=Every equidistant linear code is a sequence of dual Hamming codes|journal=Ars Combinatoria|volume=18|pages=181–186}}</ref>.
 
==Examples==