Sciweavers

217 search results - page 7 / 44
» A new upper bound on the cyclic chromatic number
Sort
View
CORR
2006
Springer
78views Education» more  CORR 2006»
13 years 7 months ago
On the Fading Number of Multiple-Input Single-Output Fading Channels with Memory
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and ...
Stefan M. Moser
TIT
2002
78views more  TIT 2002»
13 years 7 months ago
Improved upper bounds on sizes of codes
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
INFOCOM
2005
IEEE
14 years 1 months ago
Bounding the power rate function of wireless ad hoc networks
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
Yunnan Wu, Qian Zhang, Wenwu Zhu, Sun-Yuan Kung
JCT
2007
146views more  JCT 2007»
13 years 7 months ago
Laplacian spectral bounds for clique and independence numbers of graphs
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
Mei Lu, Huiqing Liu, Feng Tian
TCOM
2011
86views more  TCOM 2011»
13 years 2 months ago
New Bounds and Optimal Binary Signature Sets - Part I: Periodic Total Squared Correlation
—We derive new bounds on the periodic (cyclic) total squared correlation (PTSC) of binary antipodal signature sets for any number of signatures K and any signature length L. Opti...
Harish Ganapathy, Dimitrios A. Pados, George N. Ka...