z-logo
open-access-imgOpen Access
On the symmetry group of extended perfect binary codes of length $n+1$ and rank $n-\log(n+1)+2$
Author(s) -
Olof Heden,
Fabio Pasticci,
Thomas Westerbäck
Publication year - 2012
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2012.6.121
Subject(s) - mathematics , combinatorics , rank (graph theory) , integer (computer science) , group (periodic table) , symmetry (geometry) , binary number , binary code , arithmetic , geometry , physics , quantum mechanics , computer science , programming language
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 ...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom