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 8 of 8 for “"coding theorem"”.
-
Two-step coding theorem in the nearly continuous category
… category. Rudolph proved a representation theorem in the 1970's, showing that any measurable flow, where the function ƒ is only assumed to be measure-preserving on a measurable Z-system, can be represented as a flow built under a function where the ceiling function takes only two values. We …
-
Error exponents for multipath fading channels : a strong coding theorem
… bandwidth. These bounds constitute a strong coding theorem for the channel as they not only delimit the range of achievable rates, but also give us a relationship among the error probability, data rate, bandwidth, "peakiness", and fading parameters such as the coherence time. They can be used …
-
Coding theorems of quantum information theory
Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information transmission via quantum channels we give a new proof of the coding …
-
Finite blocklength analysis of the MISO Coherent Block Fading Channel
… fundamental limits. Specifically, we give the coding theorem showing the achievable dispersion of this channel. We identify that this channel has non-unique capacity achieving input distributions, and although these distribution all yield the same capacity, some distributions in this set yield …
-
Anytime information theory
… from end-to-end. On the source side, we give a coding theorem for such unstable processes that shows that we can achieve the rate-distortion bound even in the infinite horizon case if we are willing to tolerate bounded delays in encoding and decoding. On the channel side, we define a new …
-
A channel emulation viewpoint of coding theorems
… viewpoint matches the existing results in coding theory, and expect that this viewpoint can inspire the study of constructing long network codes using a layered black box architecture.
-
Unreliable and resource-constrained decoding
… or resource consumption are established. For decoding repetition codes using consensus decoding circuits, the optimal tradeoff between decoding speed and quadratic wiring cost is defined and established. Designing optimal circuits is shown to be NP-complete, but is carried out for small circuit …
-
Multiple access networks over finite fields : optimality of separation, randomness and linearity
… loss in sum rate due to separate source-channel coding when separation fails. We prove that the bound is very tight by showing that it is accurate to the second decimal place. We derive the capacity region and the maximum code rate for the noisy as well as noise-free channel where, code rate is …