207 search results - page 12 / 42 » Powers of cycles, powers of paths, and distance graphs |
130
click to vote
INFOCOM
1993
IEEE
15 years 10 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...
194
Voted
SETA
2004
Springer
16 years 2 days 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 =...
198
click to vote
DC
2002
15 years 6 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...
169
click to vote
COMBINATORICA
2007
15 years 6 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...
185
click to vote
GLOBECOM
2006
IEEE
16 years 23 days 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...