207 search results - page 12 / 42 » Powers of cycles, powers of paths, and distance graphs |
INFOCOM
1993
IEEE
13 years 11 months ago
1993
IEEE
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
SETA
2004
Springer
14 years 1 months ago
2004
Springer
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
DC
2002
13 years 7 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
COMBINATORICA
2007
13 years 7 months ago
2007
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We study the downlink coverage of a base station terminal (BST), which has access to a relay node. Continuing a previous study in which the BST is assumed to provide a variable...