Rate loss of network source codes
In this thesis, I present bounds on the performance of a variety of network source codes. These <em>rate loss</em> bounds compare the rates achievable by each network code to the rate-distortion bound <em>R(D)</em> at the corresponding distortions. The result is a collection...
Main Author: | Feng, Hanying |
---|---|
Format: | Others |
Published: |
2002
|
Online Access: | https://thesis.library.caltech.edu/1965/1/thesis.pdf Feng, Hanying (2002) Rate loss of network source codes. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/GVDP-7248. https://resolver.caltech.edu/CaltechETD:etd-05232002-173821 <https://resolver.caltech.edu/CaltechETD:etd-05232002-173821> |
Similar Items
-
Multiterminal source coding: sum-rate loss, code designs, and applications to video sensor networks
by: Yang, Yang
Published: (2010) -
Loss-rate Sensitive Network Coding and Its Applications
by: Chao-Yuan Chiang, et al.
Published: (2015) -
On Achievable Rate Regions for Source Coding Over Networks
by: Gu, WeiHsin
Published: (2009) -
Multiple Source Cooperation: From Code Division Multiplexing To Variable-Rate Network Coding
by: Zhang, Rong, et al.
Published: (2011) -
On Source Coding for Networks
by: Fleming, Michael Ian James
Published: (2004)