Sciweavers

653 search results - page 2 / 131
» The size of minimum 3-trees
Sort
View
TIT
2002
78views more  TIT 2002»
14 years 11 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
EJC
2011
14 years 6 months ago
Matching and edge-connectivity in regular graphs
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
Suil O, Douglas B. West
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
14 years 11 months ago
Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
William Duckworth
COMCOM
2010
116views more  COMCOM 2010»
14 years 11 months ago
Optimal frame size analysis for framed slotted ALOHA based RFID networks
We offer an analytical solution for the optimal frame size of the non-muting version of the Basic Frame Slotted ALOHA collision resolution protocol for RFID networks. Previous inv...
Zornitza Genova Prodanoff
WCNC
2010
IEEE
14 years 10 months ago
Impact of Secondary Users' Field Size on Spectrum Sharing Opportunities
— Previous works studied the effect of many system parameters on spectrum sharing opportunities where secondary users access the spectrum of primary users. However, a parameter t...
Muhammad Aljuaid, Halim Yanikomeroglu