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 10 of 10 for “"error exponents"”.

  1. Error exponents for multipath fading channels : a strong coding theorem

    … upper and lower bounds on the probability of error (the exponents of which are the error exponents) with "peaky" signaling -- the signaling strategy that achieves the capacity of the multipath fading channel under an average power constraint in the limit of infinite bandwidth. These bounds …

    mit Repository record for Error exponents for multipath fading channels : a strong coding theorem (opens in a new tab)

  2. Discrimination of Quantum Channels

    … with assessing optimal decision strategies and error rates for the task of binary quantum channel discrimination, where the main focus lies on proving optimal asymmetric error exponents (both asymptotically and non-asymptotically) for different variants of this problem. The task of binary …

    cambridge Repository record for Discrimination of Quantum Channels (opens in a new tab)

  3. Anytime information theory

    … channel so as to have finite average squared error 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 …

    mit Repository record for Anytime information theory (opens in a new tab)

  4. Distinguishing codes from noise : fundamental limits and applications to sparse communication

    … which admits both miss and false alarm errors. Then we investigate the fundamental limits of code distinguishing in terms of the error exponents of miss and false alarm error probabilities. In a scenario that miss probability is required to vanish asymptotically but not necessarily …

    mit Repository record for Distinguishing codes from noise : fundamental limits and applications to sparse communication (opens in a new tab)

  5. Exponential bounds on error probability with Feedback

    … fixed length block codes even the decay rate of error probability with block length does not increase with feedback for most channel models. Consequently for making the physical layer more reliable for higher layers one needs go beyond the framework of fixed length block codes and consider …

    mit Repository record for Exponential bounds on error probability with Feedback (opens in a new tab)

  6. Multiple access networks over finite fields : optimality of separation, randomness and linearity

    … For the noisy channel, we obtain the error exponents and hence, the expression for average probability of error when a random code is used for communicating over the channel.

    mit Repository record for Multiple access networks over finite fields : optimality of separation, randomness and linearity (opens in a new tab)

  7. Statistical Hypothesis Testing Under Model Uncertainty

    … We analyze the tradeoff between the pairwise error probability exponents when the actual distributions generating the observation are different from the distributions used in the likelihood ratio test, sequential probability ratio test, and Hoeffding's generalized likelihood ratio test in the …

    cambridge Repository record for Statistical Hypothesis Testing Under Model Uncertainty (opens in a new tab)

  8. Non-asymptotic Behavior in Massive Multiple Access and Streaming System Identification

    … goal is to obtain sharp characterizations, e.g. error exponents, it can be highly non-trivial to derive fully non-asymptotic results that serve this purpose, particularly in high dimensional problems of recent times. In aforesaid circumstances there is a second approach: recourse to asymptotics …

    mit Repository record for Non-asymptotic Behavior in Massive Multiple Access and Streaming System Identification (opens in a new tab)

  9. Detection of sparse mixtures: fundamental limits and algorithms

    … noise from the presence of signal with vanishing error probability? 2. Can one detect the presence of a signal without knowledge of the particular signal distribution or sparsity level, with vanishing error probability? The first question is that of consistent testing, while the second question is …

    uiuc Repository record for Detection of sparse mixtures: fundamental limits and algorithms (opens in a new tab)

  10. On the information theory of clustering, registration, and blockchains

    … method for image registration by studying its error exponent and prove its universal asymptotic optimality. We further extend this to design the max multiinformation method for universal multi-image registration and prove its universal asymptotic optimality. We then evaluate the non-asymptotic …

    uiuc Repository record for On the information theory of clustering, registration, and blockchains (opens in a new tab)