{'fraction_non_alphanumeric': 0.0228310502283105, 'fraction_numerical': 0.0010147133434804667, 'mean_word_length': 5.067692307692307, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Rateless coding in the finite length regime

Rateless codes, also known as digital fountain codes, are excellently suited for erasure correction in packet-switched communication networks. First applications are digital video broadcast or multicast over terrestrial networks or multimedia services in cellular networks. Such networks are usually prone to packet losses due to network congestions or unrecoverable bit errors within packets. The main attributes of rateless codes can be summarised as follows: • The transmitter is able to produce as many encoded packets as needed from a given source block consisting of k source packets. • The receiver is able to decode an exact copy of the entire source block from any subset of k(1 + εR) received (i.e. non-erased) encoded packets, where εR ≥ 0 is a small reception overhead. • No feedback channel is required for packet acknowledgements. In the literature, rateless codes are usually based on the simplifying design assumptions of input sequences of infinite length. The analysis and the characterisation of the so designed codes apply only to codes with very long input sequences and a corresponding latency. In contrast, this thesis focuses codes with finite (especially short to medium) lengths. These practical lengths enable applications that require a low transmission latency. In this context, various types of finite length LT codes and Raptor codes are investigated. The main contributions of this thesis are: • The derivation of analytical closed form expressions of the residual erasure probability under optimal decoding. • The derivation of tight upper and lower residual erasure bounds. • The generalisation of binary codes to higher order Galois fields. • The formulation of concrete design guidelines for highly efficient LT code ensembles with equal and unequal erasure protection. • New performance assessment tools for Raptor codes in terms of the so-called erasure weight and kernel weight profiles.