Abstract: Almost Instantaneous Fixed to Variable (AIFV) coding is a relatively new method of loss less coding that, unlike Huffman coding, uses more than one coding tree. The problem of constructing ...
Abstract: The fixed path Min-Sum (FMS) algorithm efficiently decodes non-binary LDPC codes with low/moderate code rates, but suffers significant performance degradation for high code rates. This paper ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback