Login / Signup
Generalized sphere-packing upper bounds on the size of codes for combinatorial channels.
Daniel F. Cullina
Negar Kiyavash
Published in:
ISIT (2014)
Keyphrases
</>
upper bound
lower bound
upper and lower bounds
constant factor
lower and upper bounds
worst case
branch and bound algorithm
linear functions
objective function
tight bounds
error detection
packing problem
sample size
linear programming
multi class
dynamic programming
special case