Distributed source coding for satellite communications
From MaRDI portal
Publication:4701364
DOI10.1109/18.761254zbMath0959.94015OpenAlexW2170184107MaRDI QIDQ4701364
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1bf17a26079747bb593eb191b7ee1ec7d52bd331
Related Items (9)
IMPACT OF TOPOLOGY ON THE MAXIMUM MULTICAST THROUGHPUT IN COMMUNICATION NETWORKS WITH NETWORK CODING ⋮ On Entropy, Information Inequalities, and Groups ⋮ Max-flow min-cut theorems on dispersion and entropy measures for communication networks ⋮ The linear guessing number of undirected graphs ⋮ Exact decoding probability of random linear network coding for combinatorial networks ⋮ The minrank of random graphs ⋮ Linear Index Coding via Semidefinite Programming ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Distributed source coding for satellite communications