3 resultados para Binary Hamming code
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
* The author is supported by a Return Fellowship from the Alexander von Humboldt Foundation.
Resumo:
In this paper we present 35 new extremal binary self-dual doubly-even codes of length 88. Their inequivalence is established by invariants. Moreover, a construction of a binary self-dual [88, 44, 16] code, having an automorphism of order 21, is given.
Resumo:
We obtain new combinatorial upper and lower bounds for the potential energy of designs in q-ary Hamming space. Combined with results on reducing the number of all feasible distance distributions of such designs this gives reasonable good bounds. We compute and compare our lower bounds to recently obtained universal lower bounds. Some examples in the binary case are considered.