on the symmetry group of extended perfect binary codes of length n+1 and rank n-log(n+1)+2
2012 (English)In: Advances in Mathematics of Communication, ISSN 1930-5346, Vol. 6, no 2, 121-130 p.Article in journal (Refereed) Published
It is proved that for every integer n = 2(k) - 1, with k >= 5, there exists a perfect code C of length n, of rank r = n - log(n + 1) + 2 and with a trivial symmetry group. This result extends an earlier result by the authors that says that for any length n = 2(k) - 1, with k >= 5, and any rank r, with n - log(n + 1) + 3 <= r <= n - 1 there exist perfect codes with a trivial symmetry group.
Place, publisher, year, edition, pages
2012. Vol. 6, no 2, 121-130 p.
Perfect codes, symmetry group
IdentifiersURN: urn:nbn:se:kth:diva-71321DOI: 10.3934/amc.2012.6.121ISI: 000304194500001ScopusID: 2-s2.0-84861967067OAI: oai:DiVA.org:kth-71321DiVA: diva2:486653
FunderKnut and Alice Wallenberg Foundation, KAW 2005.0098
QC 201206122012-01-312012-01-312012-06-12Bibliographically approved