Title of article :
On a lower bound on the number of perfect binary codes Original Research Article
Author/Authors :
S.A. Malyugin، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
Abstract :
It is proved that the number of perfect binary codes of length n is greater than 22(n+1)/2−log(n+1)·22(n−3)/4.
Keywords :
Perfect binary codes , Lower bounds , i-Component
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
