Capacity bounds for a class of diamond networks

Keyphrases

• Auxiliary Channel 33%
• Binary Adder 33%
• Bounding Technique 33%
• Capacity Bounds 100%
• Diamond Network 100%
• Gaussian multiple Access Channel 33%
• Minimax Problem 33%
• Multiple Access Channel 33%
• Multiple Descriptions 33%
• New Lower Bound 33%
• New Upper Bound 33%
• Proof Techniques 33%

Engineering

• Adders 33%
• Diamond 100%
• Gaussians 100%
• Max 33%
• Maximization 33%
• Multiple Access Channel 66%
• Problem Description 33%

Computer Science

• Auxiliary Channel 50%
• Bit-Pipe 100%
• Multiple Access Channel 100%
• Problem Description 50%
• Proof Technique 50%