On the bandwidth of a Hamming graph

Author： Harper L.H.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.301, Iss.1, 2003-05, pp. : 491-498

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

Graph Searching, Elimination Trees, and a Generalization of Bandwidth

By Fomin Fedor V.   Heggernes Pinar   Telle Jan Arne  

Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. : 73-87

Springer Publishing Company

Access to resources Recommend Favorite

On the Hamming distance of constraint satisfaction problems

By Crescenzi P.   Rossi G.  

Theoretical Computer Science, Vol. 288, Iss. 1, 2002-10 ,pp. : 85-100

Elsevier

Access to resources Recommend Favorite

Small weight bases for Hamming codes

By Tromp J.   Louxin Z.   Ying Z.  

Theoretical Computer Science, Vol. 181, Iss. 2, 1997-07 ,pp. : 337-345

Elsevier

Access to resources Recommend Favorite

Bandwidth Broker

By  

Recent Patents on Computer Science, Vol. 4, Iss. 2, 2011-05 ,pp. : 127-133

Bentham Science Publishers

Access to resources Recommend Favorite

Weight Functions and Generalized Hamming Weights of Linear Codes

By Nogin D.  

Problems of Information Transmission, Vol. 41, Iss. 2, 2005-04 ,pp. : 91-104

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite