Revision as of 10:57, 11 January 2022 edit Adumbrativus (talk \| contribs) Extended confirmed users, Page movers 11,607 edits →Generalization: Mention the term Galois ring ← Previous edit		Revision as of 18:55, 30 January 2022 edit undo Citation bot (talk \| contribs) Bots 5,863,432 edits Alter: template type. \| Use this bot. Report bugs. \| Suggested by AManWithNoPlan \| #UCB_webform 1709/1776 Next edit →
Line 78: ==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 ~~arxiv~~arXiv\|author=Etzion, Tuvi\|author2=Raviv, Netanel\|title=Equidistant codes in the Grassmannian\|year=2013\|eprint=1308.6231\|class=math.CO}}</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==

Linear code: Difference between revisions