46 search results - page 3 / 10 » On k-partitioning of Hamming Graphs |
TCS
2008
13 years 8 months ago
2008
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
AC
2001
Springer
14 years 1 months ago
2001
Springer
SIAMDM
2008
13 years 8 months ago
2008
DM
1998
13 years 8 months ago
1998
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...
AAECC
2006
Springer
14 years 9 days ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...