1-perfect codes in Sierpiński graphs

Publisher： Cambridge University Press

E-ISSN： 1755-1633|66|3|369-384

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.66, Iss.3, 2002-12, pp. : 369-384

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the binary codes with parameters of doubly-shortened 1-perfect codes

By Krotov Denis  

Designs, Codes and Cryptography, Vol. 57, Iss. 2, 2010-11 ,pp. : 181-194

Springer Publishing Company

Access to resources Recommend Favorite

Codes Based on Complete Graphs

By Jungnickel Dieter   Resmini Marialuisa J. de   Vanstone Scott A.  

Designs, Codes and Cryptography, Vol. 8, Iss. 1-2, 1996-05 ,pp. : 159-165

Springer Publishing Company

Access to resources Recommend Favorite

ELUSIVE CODES IN HAMMING GRAPHS

By  

Bulletin of the Australian Mathematical Society, Vol. 88, Iss. 2, 2013-10 ,pp. : 286-296

Cambridge University Press

Access to resources Recommend Favorite

On Intersection Problem for Perfect Binary Codes

By Avgustinovich Sergey   Heden Olof   Solov’eva Faina  

Designs, Codes and Cryptography, Vol. 39, Iss. 3, 2006-06 ,pp. : 317-322

Springer Publishing Company

Access to resources Recommend Favorite

Perfect codes on the towers of Hanoi graph

By  

Bulletin of the Australian Mathematical Society, Vol. 57, Iss. 3, 1998-06 ,pp. : 367-376

Cambridge University Press

Access to resources Recommend Favorite