727 search results - page 33 / 146 » A Calculus of Bounded Capacities |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
JAL
2006
13 years 7 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
ESTIMEDIA
2007
Springer
14 years 1 months ago
2007
Springer
SoCs for multimedia applications typically use only one port to off-chip DRAM for cost reasons. The sharing of interconnect and the off-chip DRAM port by several IP blocks makes t...
INFOCOM
2002
IEEE
14 years 16 days ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...