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 9 of 9 for “"Error Exponents"”.

  1. Information Theory With Large Alphabets And Source Coding Error Exponents

    … sequence of distributions. We finally examine error exponents for source coding/compression problems. The error exponent characterizes the optimal exponential decay of the error probability. For the cases of the Wyner-Ziv and source coding with side information problems we provide new upper and …

    cornell Repository record for Information Theory With Large Alphabets And Source Coding Error Exponents (opens in a new tab)

  2. Modeling and performance analysis of a UAV-based sensor network for improved ATR

    … channel. The concepts of recognition capacity, error exponents and probability of outage are defined and derived for a PCA-based ATR system. Both the case of a single encoded image and the case of encoded correlated multiple frames are analyzed. Numerical evaluations are performed. Finally we …

    wvu Repository record for Modeling and performance analysis of a UAV-based sensor network for improved ATR (opens in a new tab)

  3. On Woven Convolutional Codes

    … for use in communication systems where very low error probabilities are needed. This thesis is devoted to woven convolutional codes, a construction where the constituent codes are woven together in a manner that resembles the structure of a fabric. A family of active distance measures for …

    lund Repository record for On Woven Convolutional Codes (opens in a new tab) Download PDF for On Woven Convolutional Codes (opens in a new tab)

  4. Moderate Deviations And Exact Asymptotics In Channel Coding

    Investigation of the data rate, blocklength and error probability interplay for the optimum block code(s) on a discrete memoryless channel is a fundamental problem of information theory. Because of the intricacy of the problem, it is ubiquitous to allow blocklength to grow unboundedly, which, in …

    cornell Repository record for Moderate Deviations And Exact Asymptotics In Channel Coding (opens in a new tab)

  5. Fog-aided wireless communications and machine learning

    … is evaluated through the probability of error and error exponents as function of key system parameters such as interference power and fronthaul link capacity.<br/>Finally, we turn our focus to edge-AI, commonly referred to as federated learning. We consider a Bayesian federated learning …

    kings Repository record for Fog-aided wireless communications and machine learning (opens in a new tab) Download PDF for Fog-aided wireless communications and machine learning (opens in a new tab)

  6. REFINED ASYMPTOTICS FOR THE FUNDAMENTAL LIMITS OF COMMUNICATIONS WITH FEEDBACK

    … feedback codes and under the non-vanishing error probability formalism, and (2) establishing the moderate deviations asymptotics and joint-source channel coding exponent with variable-length feedback codes. In the first part, the e-capacity regions for Gaussian MACs under expected power …

    nus Repository record for REFINED ASYMPTOTICS FOR THE FUNDAMENTAL LIMITS OF COMMUNICATIONS WITH FEEDBACK (opens in a new tab) Download file for REFINED ASYMPTOTICS FOR THE FUNDAMENTAL LIMITS OF COMMUNICATIONS WITH FEEDBACK (opens in a new tab)

  7. FUNDAMENTAL PERFORMANCE LIMITS OF STATISTICAL PROBLMES: FROM HYPOTHESIS TESTING TO THE LOTTERY TICKETS HYPOTHESIS

    … second-order asymptotics of type-I and type-II error probabilities under probabilistic constraints. In sequential adversarial hypothesis testing game, we evaluate the asymptotic Nash equilibrium between the decision maker and the adversary and identify the payoff at this equilibrium. Finally, by …

    nus Repository record for FUNDAMENTAL PERFORMANCE LIMITS OF STATISTICAL PROBLMES: FROM HYPOTHESIS TESTING TO THE LOTTERY TICKETS HYPOTHESIS (opens in a new tab) Download file for FUNDAMENTAL PERFORMANCE LIMITS OF STATISTICAL PROBLMES: FROM HYPOTHESIS TESTING TO THE LOTTERY TICKETS HYPOTHESIS (opens in a new tab)

  8. 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)

  9. 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)