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 20 of 32 for “"Random coding"”.
-
Gallager’s random coding exponent for differential space time modulation
… the receiver. We focus on the analysis of the random coding exponent proposed by Gallager for such spacetime channels employing differential modulation with finite signal sets, and consider multiple symbol differential detection (MSDD) with an observation window size N. The underlying principle …
-
A functional analysis of random coding sequences in Escherichia coli
… gene functions can evolve from previously non-coding sequences, which are essentially random stretches of nucleotides. Several studies have explored the role of such random sequences as templates for evolutionary innovation. This included a systematic study, where a library of random coding …
-
Detection- and Information -Theoretic Analysis of Steganography and Fingerprinting
… perspective, we derive the capacity and random-coding error exponent of perfectly secure steganography and public fingerprinting. For both games, a randomized stacked-binning scheme and a matched maximum penalized mutual information decoder are used to achieve capacity and to realize a …
-
Sequential decoding
In this investigation, the coding problem for a binary symmetric channel (BSC) has been studied in detail, in order to provide a clear exposition of the work done by Wozencraft and Reiff en on sequential decoding. A new exposition of the random coding technique and a precise formulation in terms of …
-
Performance analysis of cooperative relay networks in presence of interference
… symbol error probability, outage probability and random coding error exponent, in order to analytically estimate network capacity. A dual-hop network is introduced as the most basic type of relay network. Random coding error exponent results have been obtained using this simple network model are …
-
Θεωρία πληροφορίας και επεξεργασία σήματος για (μη-γραμμικά) επικοινωνιακά κανάλια
In this thesis, error decoding probability bounds and achievable rates for linear and nonlinear communications channels are presented. Gallager's upper bound as well as its variations through the Duman--Salehi bound are improved. The proposed technique relies on the new inverse exponential sum …
-
Joint source/channel coding for discrete memoryless channels: Lessons to learn
The design of optimal joint source/channel coding and decoding is examined for discrete memoryless channels with end-to-end distortion as the criterion for reliable communication. Joint source/channel encoders which map sequences of source symbols directly to sequences of channel symbols without …
-
Coding for Frequency-Hopped Spread-Spectrum Channels With Partial-Band Interference
… is measured by the channel capacity and the random coding exponent. The performance of specific codes is measured by the bit error probability. The channel models we consider are quite general and include channels with unknown parameters, channels which change with time, and channels with …
-
Bidirectional sequential decoding
The main drawback of sequential decoding is the variability of its decoding effort which could cause decoding erasures. We propose and analyze in this dissertation efficient bidirectional sequential decoding (B SD) techniques to alleviate this drawback, In the proposed BSD, two decoders are used; …
-
To Use the Codebook Information or Not: A Study of the Compress-and-Forward Relay Strategy
… relay cannot decode the message sent because the coding rate is too large vis-a-vis what it can handle, and try to investigate the optimality of compress-and-forward strategy for this scenario. Specifically, noting that relay's compression is based on the unconditional distribution of its …
-
Distributed Wireless Multicast: Throughput and Delay
… to meet that challenge through the use of random coding of data packets coupled with random access to a shared channel. We present an analysis of both the throughput and delay performance of this scheme. We first analyze the multicast throughput in a random access network of finitely many …
-
Lattice-based Robust Distributed Coding Scheme for Correlated Sources
… two lattice-based robust distributed source coding systems, one for two correlated sources and the other for three correlated sources. We provide a detailed performance analysis under the high resolution assumption. It is shown that, in a certain asymptotic regime, our scheme for two …
-
Information-outage analysis of finite-length codes
The performance of random error control codes approaches the Shannon capacity limit as the code length goes to infinity. When the code length is finite, then the code will be unable to achieve arbitrarily low error probability and a nonzero codeword error rate is inevitable. Information-theoretic …
-
Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects
… techniques such as maximum entropy and random coding. It arises naturally in the context of statistical mechanics by the emulation of a physical process whereby a solid is slowly cooled and at zero temperature assumes its minimum energy configuration. We start with the introduction to DA …
-
Achievable Schemes and Performance Bounds for Centralized and Distributed Index Coding
Index coding studies the efficient broadcast problem where a server broadcasts multiple messages to a group of receivers with side information. Through exploiting the receiver side information, the amount of required communication from the server can be significantly reduced. Thanks to its basic …
-
Set quantizer
… hidden Markov model and the second is based on a random coding approach. The SQ is tested on memoryless sources, Markov sources and image data. For bit rate greater than two, it is found that the SQ performs better for memoryless sources than all the quantizers found in the literature.
-
Low Rate Encoding of Autoregressive Sources
… smoothing is not helpful. Finally, a certain random coding scheme is used to rate 1. The performance of such as information theoretic inspired scheme is compared with the tree searched DPCM. Wherever appropriate, the relevance of results to low rate waveform encoding of speech is stressed.</p>
-
A Packet Scheduling Mechanism for Wireless Peer-to-Peer Content Distribution
… of the systems that employ network coding to facilitate data exchange. We show that, due to the free rider problem network coding does not necessary improve the performance of the system and, in some cases, may lead to worse system performance. We propose a novel approach to this …
-
Private Information Retrieval with Side Information and Coding for Security
… channel with a focus on the design of practical coding schemes to achieve information-theoretically achievable random-coding based secrecy rates. First, we consider the problem of PIR from $N$ non-colluding and replicated databases when the user is equipped with a cache that holds an uncoded …
-
Efficient Network Coding for Different Network Topologies
Network coding is known to be able to improve a network's throughput and resilience to packet losses. However, in practice high decoding complexity has been a major obstacle that prevents network coding from being widely employed. This thesis considers efficient network coding methods that have low …
Page 1 of 2