A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels.
Assaf Ben-YishaiYoung-Han KimOr OrdentlichOfer ShayevitzPublished in: IEEE Trans. Inf. Theory (2021)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- worst case
- communication channels
- objective function
- computer graphics
- virtual reality
- user friendly
- sufficiently accurate
- linear programming relaxation
- hamming distance
- optimal solution
- learning theory
- upper and lower bounds
- special case
- lower bounding