Perfect codes on the towers of Hanoi graph

Publisher： Cambridge University Press

E-ISSN： 1755-1633|57|3|367-376

ISSN： 0004-9727

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

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 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

1-perfect codes in Sierpiński graphs

By  

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

Cambridge University Press

Access to resources Recommend Favorite

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

Three Constructions of Authentication Codes with Perfect Secrecy

By Ding Cunsheng   Tian Xiaojian  

Designs, Codes and Cryptography, Vol. 33, Iss. 3, 2004-11 ,pp. : 227-239

Springer Publishing Company

Access to resources Recommend Favorite

Codes with girth 8 Tanner graph representation

By Sakzad Amin   Sadeghi Mohammad-Reza   Panario Daniel  

Designs, Codes and Cryptography, Vol. 57, Iss. 1, 2010-10 ,pp. : 71-81

Springer Publishing Company

Access to resources Recommend Favorite