164 search results - page 10 / 33 » Improved upper bounds on sizes of codes |
71
Voted
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
109
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, we provide a semi-analytical method for predicting the upper and lower bound of the end-to-end mutual information for a relay network with practical codes and diffe...
COMBINATORICS
2007
14 years 9 months ago
2007
This paper deals with new infinite families of small dense sets in desarguesian projective planes PG(2, q). A general construction of dense sets of size about 3q2/3 is presented....
EJC
2008
14 years 9 months ago
2008
We present improved lower bounds on the sizes of small maximal partial ovoids and small maximal partial spreads in the classical symplectic and orthogonal polar spaces, and improv...
ICLP
2007
Springer
15 years 1 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...