Completely Transitive Codes in Hamming Graphs

Author： Giudici M.   Praeger C.E.  

Publisher： Elsevier

ISSN： 0195-6698

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

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

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

Transitive decompositions of graphs

By  

Bulletin of the Australian Mathematical Society, Vol. 77, Iss. 3, 2008-06 ,pp. : 521-521

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

FINITE $s$ -GEODESIC TRANSITIVE GRAPHS

By  

Bulletin of the Australian Mathematical Society, Vol. 89, Iss. 1, 2014-02 ,pp. : 175-176

Cambridge University Press

Access to resources Recommend Favorite