Capacity of wireless erasure networks

DOI10.1109/TIT.2005.864424zbMath1293.94032DBLPjournals/tit/DanaGPHE06OpenAlexW2123350510WikidataQ29038552 ScholiaQ29038552MaRDI QIDQ3546758

Radhika Gowaikar, Amir F. Dana, Michelle Effros, R. Palanki, Babak Hassibi

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2005.864424

Mathematics Subject Classification ID

Communication theory (94A05) Coding theorems (Shannon theory) (94A24)

Related Items (11)

New properties of phase-retrievable g-frames and exact phase-retrievable g-frames ⋮ The Effect of Time-Varying Jamming Interference on Networked Stabilization ⋮ Probability modelled optimal frames for erasures ⋮ Strong converse theorems for multimessage networks with tight cut-set bound ⋮ Some properties of exact phase retrievable subspaces ⋮ The duals of fusion frames for experimental data transmission coding of high energy physics ⋮ Orthogonal projection decomposition of matrices and construction of fusion frames ⋮ Construction of fusion frame systems in finite dimensional Hilbert spaces ⋮ A Probabilistic Characterization of Random and Malicious Communication Failures in Multi-Hop Networked Control ⋮ Operator representations of K-frames: boundedness and stability ⋮ On the sum of K-frames in Hilbert spaces

This page was built for publication: Capacity of wireless erasure networks