Search for dissertations about: "Hamming codes"
Found 5 swedish dissertations containing the words Hamming codes.
-
1. On the Design of Turbo Codes
Abstract : This thesis is about Turbo codes - codes constructed via parallel concatenation of two recursive convolutional encoders linked by an interleaver. The focus of the work is on the understanding and design of Turbo codes. READ MORE
-
2. Superimposed codes for additive channels
Abstract : We consider a situation where several users send information over a single additive channel. We suppose the transmission is synchronized and that at most m of the total number of potential T users transmit simultaneously. The receiver gets a message which is the sum of the messages of the active users at that moment. READ MORE
-
3. Ternary Codes with Weight Constraints
Abstract : We study the problem of maximizing the size of a ternary block code with given length and minimum Hamming distance. The problem is further restricted in two different ways. Either we require all codewords to have constant Hamming weight, or we require all codewords to have constant composition. READ MORE
-
4. Towards a Theory of Codes for Iterative Decoding
Abstract : Channel codes in combination with iterative decoding techniques are a both powerful and efficient method to protect data against disturbances in digital communication systems. This thesis deals with various code constructions for block-wise and continuous transmission that have the potential to achieve low bit error rates with iterative decoding, even when operating close to the Shannon limit. READ MORE
-
5. Using Coding Techniques for Attacking Post-Quantum Cryptographic Assumptions and Systems
Abstract : Post-quantum cryptography for resisting possible attacks from malicious quantum adversaries has become one of the key topics in recent cryptographic research. Its ultimate goal is to search for efficient and secure primitives replacing the factoring- and discrete log-based schemes in service that will be broken in polynomial time by Shor’s algorithm. READ MORE