CORR
2008
Springer
13 years 3 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
— This paper quantifies the information rate of multiple-input multiple-output (MIMO) systems with finite rate channel state feedback and power on/off strategy. In power on/off...
ROBOCOMM
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract—This paper presents an information-theoretic approach to sensor placement that incorporates communication capacity into an optimal formulation. A new formulation is pres...