ELUSIVE CODES IN HAMMING GRAPHS

E-ISSN： 1755-1633|88|2|286-296

ISSN： 0004-9727

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

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

Completely Transitive Codes in Hamming Graphs

By Giudici M. Praeger C.E.

European Journal of Combinatorics, Vol. 20, Iss. 7, 1999-10 ,pp. : 647-662

Elsevier

Access to resources Recommend Favorite

On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs

By Imrich W. Klavzar S.

European Journal of Combinatorics, Vol. 17, Iss. 2, 1996-02 ,pp. : 209-221

Academic Press

Access to resources Recommend Favorite

Pairs of codes with prescribed Hamming distances and coincidences

By Grolmusz Vince

Designs, Codes and Cryptography, Vol. 41, Iss. 1, 2006-10 ,pp. : 87-99

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

1-perfect codes in Sierpiński graphs

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

Cambridge University Press

Access to resources Recommend Favorite