In this paper we consider a Multi Carrier Code Division Multiplex (MC–CDM) scheme. At the receiver side the Maximum A Posteriori Symbol–by–Symbol Estimator (MAPSSE) is used for the detection of the CDM signal. Therefore the influence of the spreading factor on the overall Bit Error Rate (BER) is investigated. We concatenate the MAPSSE with the channel decoder which allows for iterative decoding...

Consider coded transmission over a binary-input symmetric memoryless channel. The channel decoder uses the noisy observations of the code symbols to reproduce the transmitted code symbols. Thus, it combines the information about individual code symbols to obtain an overall information about each code symbol, which may be the reproduced code symbol or its a-posteriori probability. This tutorial ...

where l(x) is the length of codeword c(x) for a symbol x ∈ X , and p(x) is the probability of the symbol. Intuitively, a good code should preserve the information content of an outcome. Since information content depends on the probability of the outcome (it is higher if probability is lower, or equivalently if the outcome is very uncertain), a good codeword will use fewer bits to encode a certa...

This paper describes the derivation of the T-Complexity and T-Information Theory from the decomposition of finite strings, based on the duality of strings and variable-length T-Codes. It further outlines its similarity to the string parsing algorithm by Lempel and Ziv. It is intended as a summary of work published mainly by Titchener and Nicolescu. 1 A brief Introduction to T-Codes This paper f...

This paper demonstrates an effective lossless data hiding scheme using min imum Redundancy codes. The binary secret message is concurrently embedded and encoded with a cover medium such as a video file, an audio file, or even a text file. The proposed scheme not only provides good data hiding capacity and data recovery capability, but also being efficient in space saving. Each symbol in a cover...

There are several ways to use iterative decoding techniques with coded continuous phase modulation (CPM). This paper presents a method using parallel concatenation of convolutionally-coded CPM. All CPM schemes can be decomposed into a ring convolutional code and a memoryless signal mapper. This allows a properly designed convolutional code trellis to be combined with the CPM trellis, producing ...

An n symbol source which has a Huffman code with codelength vector Ln = (1, 2, 3, · · · , n − 2, n − 1, n − 1) is called an anti-uniform source. In this paper, it is shown that for this class of sources, the optimal fix-free code and symmetric fix-free code is C∗ n = (0, 11, 101, 1001, · · · , 1 n−2 { }} { 0 · · · 0 1).