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 13 of 13 for “"Large Alphabet"”.

  1. Sub-Linear Algorithms For Non-Homogeneous Large Alphabet Source Classification

    Suppose we have several unknown distributions the same discrete countable sample space, namely, {1, 2, 3, 4, ..., n}. and given sequences of samples generated i.i.d from one of the distributions, where the sequence length is smaller than n, known as the sparse sample case. One interesting …

    cornell Repository record for Sub-Linear Algorithms For Non-Homogeneous Large Alphabet Source Classification (opens in a new tab)

  2. Optimal entropy estimation on large alphabet: fundamental limits and fast algorithms

    Consider the problem of estimating the Shannon entropy of a distribution over k elements from n independent samples. We obtain the minimax mean- square error within universal multiplicative constant factors if n exceeds a constant factor of k/log(k); otherwise there exists no consistent estimator. …

    uiuc Repository record for Optimal entropy estimation on large alphabet: fundamental limits and fast algorithms (opens in a new tab)

  3. Analysis, improvement and extensions of a Lee metric list decoding algorithm for alternant codes

    … improvements in special cases are given as for large alphabet codes and codes over GF(2). Tools are developped to study Lee metric codes over a Gaussian channel with a PSK or QAM modulation and to compare Lee and Hammming metrics.

    nus Repository record for Analysis, improvement and extensions of a Lee metric list decoding algorithm for alternant codes (opens in a new tab) Download file for Analysis, improvement and extensions of a Lee metric list decoding algorithm for alternant codes (opens in a new tab)

  4. LDPC Codes over Large Alphabets and Their Applications to Compressed Sensing and Flash Memory

    … parity-check (LDPC) codes over channels with large alphabet sets and the applications on compressed sensing (CS) and flash memories. Compared to belief-propagation (BP) decoding, verification-based (VB) decoding has significantly lower complexity and near optimal performance when the channel …

    tamu Repository record for LDPC Codes over Large Alphabets and Their Applications to Compressed Sensing and Flash Memory (opens in a new tab)

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

    … problem examined is that of classification in a 'large-alphabet' regime. In this large-alphabet regime, which is motivated by natural language, standard statistical approaches to classification based on chi-squared tests or maximum likelihood are inconsistent. We derive the limit (in terms of …

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

  6. Advanced Coding Techniques For Fiber-Optic Communications And Quantum Key Distribution

    … In secure quantum communications, large-alphabet quantum key distribution (QKD) is becoming attractive recently due to its potential in improving the efficiency of key exchange. To recover the carried information bits, efficient information reconciliation is desirable, for which the …

    arizona-thes Repository record for Advanced Coding Techniques For Fiber-Optic Communications And Quantum Key Distribution (opens in a new tab)

  7. Construction of I-Deletion-Correcting Ternary Codes

    Finding large deletion correcting codes is an important issue in coding theory. Many researchers have studied this topic over the years. Varshamov and Tenegolts constructed the Varshamov-Tenengolts codes (VT codes) and Levenshtein showed the Varshamov-Tenengolts codes are perfect binary …

    brock Repository record for Construction of I-Deletion-Correcting Ternary Codes (opens in a new tab)

  8. Decision-making under statistical uncertainty

    … is particularly significant for the testing of large alphabet distributions. We also show that the test statistic used in the GLRT is a relaxation of the Kullback-Leibler divergence statistic used in the Hoeffding test. We present results on the asymptotic behavior of the two test statistics to …

    uiuc Repository record for Decision-making under statistical uncertainty (opens in a new tab)

  9. Hypothesis testing and learning with small samples

    Made available in DSpace on 2013-02-03T19:47:07Z (GMT). No. of bitstreams: 2 Dayu_Huang.pdf: 867949 bytes, checksum: 1380ac54cb65b4bf5dc75aac2c9cb8dc (MD5) license.txt: 4059 bytes, checksum: 77c2d693fd71ccd7d98454f2a06de3cb (MD5)

    uiuc Repository record for Hypothesis testing and learning with small samples (opens in a new tab)

  10. Statistical Divergences for Learning and Inference: Limit Laws and Non-Asymptotic Bounds

    … which the sample space is either discrete with a large alphabet (e.g., natural language processing) or continuous of high dimension (e.g., computer vision). This dissertation revisits statistical divergences in modern applications and addresses challenges arising from the complex nature of the …

    washington Repository record for Statistical Divergences for Learning and Inference: Limit Laws and Non-Asymptotic Bounds (opens in a new tab)

  11. Estimation of KL divergence: optimal minimax rate

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2017-02-28 without embargo terms

    uiuc Repository record for Estimation of KL divergence: optimal minimax rate (opens in a new tab)

  12. 30 GHz Path Loss Modeling and Performance Evaluation for Noncoherent M-ary Frequency Shift Keying in the 30 GHz Band

    … (LOS) and non-LOS (NLOS) environments in a large building on the University of South Carolina campus, specifically at Swearingen Engineering Center. Several propagation path loss (PL) models are presented based upon this collected data. We can use these PL models in link budgets for …

    south-carolina Repository record for 30 GHz Path Loss Modeling and Performance Evaluation for Noncoherent M-ary Frequency Shift Keying in the 30 GHz Band (opens in a new tab)

  13. Suffix trees and suffix arrays in primary and secondary storage

    … boundaries, they are not able to process the large quantity of data in reasonable time. To speed up the runtime of these algorithms, suffix trees and suffix arrays are routinely used to generate a set of starting positions quickly and/or narrow down the set of possibilities need to be …

    iastate Repository record for Suffix trees and suffix arrays in primary and secondary storage (opens in a new tab)