List decoding

About: List decoding is a research topic. Over the lifetime, 7251 publications have been published within this topic receiving 151182 citations.

Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)

Abstract: The data structure of Huffman codes and its application to efficient encoding and decoding of Huffman codes are studied in detail. The tree structure is presented by a two-dimensional array which can be applied for the decoding of Huffman codes as a state transition table of the finite-state decoding automaton. Inversion produces a one-dimensional state transition table of the semiautonomous finite-state sequential machine which can be used as a Huffman encoder with a push-down stack. The encoding and decoding procedures are simple and efficient. It is not only possible to implement by simple hardware but is also applicable to software implementation.

Markov Chain Model for the Decoding Probability of Sparse Network Coding

Abstract: Random linear network coding has been shown to offer an efficient communication scheme, leveraging a remarkable robustness against packet losses. However, it suffers from a high-computational complexity, and some novel approaches, which follow the same idea, have been recently proposed. One of such solutions is sparse network coding (SNC), where only few packets are combined with each transmission. The amount of data packets to be combined can be set from a density parameter/distribution, which could be eventually adapted. In this paper, we present a semi-analytical model that captures the performance of SNC on an accurate way. We exploit an absorbing Markov process, where the states are defined by the number of useful packets received by the decoder, i.e., the decoding matrix rank, and the number of non-zero columns at such matrix. The model is validated by the means of a thorough simulation campaign, and the difference between model and simulation is negligible. We also include in the comparison of some more general bounds that have been recently used, showing that their accuracy is rather poor. The proposed model would enable a more precise assessment of the behavior of SNC techniques.

Multistage decoding of frequency-hopped fsk system

Abstract: A recent paper described an unproved decoding scheme for a frequency-hopped multilevel FSK system. We examined this multiple access communication system for possible application in satellite communication and mobile radio telephony. The new decoder, using the known algebraic structure of the users' addresses, reduces mutual interference and achieves a 50 to 60 percent increase in efficiency over conventional decoding. The present paper shows how additional decoding can further increase the efficiency, bringing it very close (within half a percent) to optimum. The scheme makes use of information derived while decoding the messages of other users and thus is especially attractive for the base station, where such information is readily available and does not require a significant increase in complexify. Compared to conventional decoding, the new scheme more than doubles the number of simultaneous users.