Search for dissertations about: "generalized minimum distance decoding"

Found 4 swedish dissertations containing the words generalized minimum distance decoding.

  2. 1. On hard-decision forward error correction with application to high-throughput fiber-optic communications

    Author : Alireza Sheikh; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; product-like codes; bounded distance decoding; staircase codes.; product codes; hard decision decoding; generalized minimum distance decoding; probabilistic shaping; coded modulation; Achievable information rates;

    Abstract : The advent of the Internet not only changed the communication methods significantly, but also the life-style of the human beings. The number of Internet users has grown exponentially in the last decade, and the number of users exceeded 3.4 billion in 2016. READ MORE

  4. 2. Sparse Codes on Graphs with Convolutional Code Constraints

    Author : Muhammad Umar Farooq; Kommunikationsteknologi; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Braided codes; Density evolution; Serially concatenated codes; Spatially coupled codes; Generalized LDPC codes; threshold saturation; Turbo codes;

    Abstract : Modern coding theory is based on the foundation of the sparse codes on graphs, such as the low-density parity-check (LDPC) codes, and the turbo-like codes (TCs) with component convolutional codes. The success of the LDPC codes and the TCs lies in their ability to perform low-complexity iterative message passing decoding procedures. READ MORE

  5. 3. Some Notes on Code-Based Cryptography

    Author : Carl Löndahl; Institutionen för elektro- och informationsteknik; []
    Keywords : ;

    Abstract : This thesis presents new cryptanalytic results in several areas of coding-based cryptography. In addition, we also investigate the possibility of using convolutional codes in code-based public-key cryptography. The first algorithm that we present is an information-set decoding algorithm, aiming towards the problem of decoding random linear codes. READ MORE

  6. 4. Spatially Coupled Turbo-Like Codes

    Author : Saeedeh Moloudi; Kommunikationsteknologi; []
    Keywords : ;

    Abstract : The focus of this thesis is on proposing and analyzing a powerful class of codes on graphs---with trellis constraints---that can simultaneously approach capacity and achieve very low error floor. In particular, we propose the concept of spatial coupling for turbo-like code (SC-TC) ensembles and investigate the impact of coupling on the performance of these codes. READ MORE