Lower bounds on achievable rates for limited bitshift correcting codes.

Victor D. Kolesnik Victor Yu. Krachkovsky

Published in: IEEE Trans. Inf. Theory (1994)

Keyphrases

lower bound
upper bound
branch and bound algorithm
objective function
vc dimension
lower and upper bounds
lower bounding
machine learning
worst case
constraint satisfaction problems
linear programming relaxation
error correcting codes