Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgments
- Notation
- 1 Introduction
- Part I Preliminaries
- Part II Single-Hop Networks
- Part III Multihop Networks
- Part IV Extensions
- Appendices
- A Convex Sets and Functions
- B Probability and Estimation
- C Cardinality Bounding Techniques
- D Fourier–Motzkin Elimination
- E Convex Optimization
- Bibliography
- Common Symbols
- Author Index
- Subject Index
B - Probability and Estimation
from Appendices
Published online by Cambridge University Press: 05 June 2012
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgments
- Notation
- 1 Introduction
- Part I Preliminaries
- Part II Single-Hop Networks
- Part III Multihop Networks
- Part IV Extensions
- Appendices
- A Convex Sets and Functions
- B Probability and Estimation
- C Cardinality Bounding Techniques
- D Fourier–Motzkin Elimination
- E Convex Optimization
- Bibliography
- Common Symbols
- Author Index
- Subject Index
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781139030687/resource/name/firstPage-9781139030687apx2_p625-630_CBO.jpg)
- Type
- Chapter
- Information
- Network Information Theory , pp. 625 - 630Publisher: Cambridge University PressPrint publication year: 2011