CORR
2004
Springer
13 years 5 months ago
2004
Springer
In this paper, we analyze the performance of space-time block codes which enable symbolwise maximum likelihood decoding. We derive an upper bound of maximum mutual information (MM...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We propose use of QR decomposition with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signa...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We consider source coding with fixed lag side information at the decoder. We focus on the special case of perfect side information with unit lag corresponding to source coding wit...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
This paper explains why MMSE estimation arises in lattice-based strategies for approaching the capacity of linear Gaussian channels, and comments on its properties.
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We continue to discuss why MMSE estimation arises in coding schemes that approach the capacity of linear Gaussian channels. Here we consider schemes that involve successive decodi...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both d...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
: The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.