Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"capacity-achieving codes"”.
-
Optimized Network Coding for Wireline and Aref Networks
… broadcasting. We characterize the multicast capacity of Aref networks, the achievability of which is shown using an ensemble of random codes. In order to construct structured capacity achieving codes, we consider a natural layered coding scheme and show that this coding scheme is suboptimal.
-
Sparse graph codes for compression, sensing, and secrecy
Sparse graph codes were first introduced by Gallager over 40 years ago. Over the last two decades, such codes have been the subject of intense research, and capacity approaching sparse graph codes with low complexity encoding and decoding algorithms have been designed for many channels. Motivated …
-
Iterative algorithms for lossy source coding
… we analyze low density parity check (LDPC) codes and low density generator matrix (LDGM) codes for quantization under a Hamming distortion. We prove that LDPC codes can achieve the rate-distortion function. We also show that the variable node degree of any LDGM code must become unbounded for …
-
Distances on rankings: from social choice to flash memories
… in the context of rank modulation, designing codes with a given minimum distance is required for preserving data integrity. It is however well-known that conventional distances are not adequate for many applications. Motivated by several problems from different disciplines, including problems …
-
Design Techniques for Efficient Sparse Regression Codes
Sparse regression codes (SPARCs) are a recently introduced coding scheme for the additive white Gaussian noise channel, for which polynomial time decoding algorithms have been proposed which provably achieve the Shannon channel capacity. One such algorithm is the approximate message passing (AMP) …