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 “"Polar Codes"”.

  1. Polar Coding in Certain New Transmission Environments

    Polar codes, introduced by Arikan in 2009, have attracted considerable interest as an asymptotically capacity-achieving code with sufficient performance advantages to merit inclusion in the 5G standard. Polar codes are constructed directly from an explicit model of the communication channel, so …

    vt Repository record for Polar Coding in Certain New Transmission Environments (opens in a new tab)

  2. Invariant embeddings of the Deligne-Lusztig curves with applications

    … $\GG$ with applications in algebraic geometry codes, hash families, and polar codes. This thesis consists of four parts, the first part presents our result in finding smooth embeddings for the Deligne-Lusztig curves in projective space. The second part concerns certain Riemann-Roch spaces and …

    uiuc Repository record for Invariant embeddings of the Deligne-Lusztig curves with applications (opens in a new tab)

  3. A channel emulation viewpoint of coding theorems

    … the error probability bound of concatenated codes from the channel emulation viewpoint, and derive the evolution of deficiencies of polar codes. We show that the analysis from the emulation and deficiency viewpoint matches the existing results in coding theory, and expect that this viewpoint …

    uiuc Repository record for A channel emulation viewpoint of coding theorems (opens in a new tab)

  4. Quantized Guessing Random Additive Noise Decoding - A Universal Quantized Soft-Decoder

    … error correction potential of different channel codes, particularly Polar Adjusted Convolutional codes, CA-Polar codes, and CRCs.

    mit Repository record for Quantized Guessing Random Additive Noise Decoding - A Universal Quantized Soft-Decoder (opens in a new tab)

  5. Complexity and second moment of the mathematical theory of communication

    … complexity. The performance of a series of codes is evaluated by, as the block lengths approach infinity, whether their block error probabilities decay to zero, whether their code rates converge to channel capacity, and whether their growth in complexities stays under control. Over any …

    uiuc Repository record for Complexity and second moment of the mathematical theory of communication (opens in a new tab)

  6. Guessing Random Additive Noise Decoding in Coded Multiple-Input Multiple-Output Systems

    … List (CA-SCL) decoding of the CRC-Assisted Polar (CA-Polar) [105, 128] code found in the 5G New Radio standard. For this code, we find that ORBGRAND outperforms CA-SCL (list size 16) by 1 dB E_b/N₀ at block error rate of 10⁻³, under 16-QAM and Linear Minimum Mean Square Error detection, with …

    mit Repository record for Guessing Random Additive Noise Decoding in Coded Multiple-Input Multiple-Output Systems (opens in a new tab)

  7. Design and Analysis of Multilevel Coded Modulation for Multi-Node Networks

    … The rate penalty due to linearity of component codes is analyzed and to avoid it, a solution is proposed involving the labeling of signal constellations. Simulations show that the proposed architecture together with good point-to-point codes can achieve excellent performance. For the full-duplex …

    tdl Repository record for Design and Analysis of Multilevel Coded Modulation for Multi-Node Networks (opens in a new tab)

  8. Guessing Random Additive Noise Decoding (GRAND), from Performance to Implementation

    … variants of GRAND, Cyclic Redundancy Check (CRC) codes are evaluated and recognized with excellent performance, beating state-of-art CA-Polar codes. Random Linear Codes (RLCs) are also enabled to be good candidates for their security features. Owing to the advent of GRAND, the two codes, having …

    mit Repository record for Guessing Random Additive Noise Decoding (GRAND), from Performance to Implementation (opens in a new tab)

  9. Deep code: representation and learning algorithms for neural networks & their applications to communication codes

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms

    uiuc Repository record for Deep code: representation and learning algorithms for neural networks & their applications to communication codes (opens in a new tab)