Capacity of wireless erasure networks

DOI10.1109/TIT.2005.864424MaRDI QIDQ3546758zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Amir F. Dana, Radhika Gowaikar, R. Palanki, Michelle Effros, B. 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)

Cited in

(14)

• Construction of fusion frame systems in finite dimensional Hilbert spaces
• Orthogonal projection decomposition of matrices and construction of fusion frames
• Strong converse theorems for multimessage networks with tight cut-set bound
• On the sum of K-frames in Hilbert spaces
• Operator representations of K-frames: boundedness and stability
• Probability modelled optimal frames for erasures
• The Effect of Time-Varying Jamming Interference on Networked Stabilization
• A probabilistic characterization of random and malicious communication failures in multi-hop networked control
• New properties of phase-retrievable g-frames and exact phase-retrievable g-frames
• Some properties of exact phase retrievable subspaces
• New properties and existence of exact phase-retrievable g-frames
• Transmit power policies for stochastic stabilisation of multi-link wireless networked control systems
• Some inequalities and equations of g-frame operator multipliers for finite group representations
• The duals of fusion frames for experimental data transmission coding of high energy physics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546758)