Download Now Free registration required
Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly useful in applications where performance increases with the number of decoded data units. In this paper, the authors provide a generic analytical framework for studying the asymptotic performance of Growth codes in different settings. Their analysis based on Wormald method applies to any class of Rateless codes that does not include a pre-coding step. They evaluate the decoding probability model for short code-blocks and validate their findings by experiments.
- Format: PDF
- Size: 277.13 KB