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: | |
---|---|
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> |
Internet
https://thesis.library.caltech.edu/1965/1/thesis.pdfFeng, 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>