412 search results - page 3 / 83 » New Set of Codes for the Maximum-Likelihood Decoding Problem |
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
—This paper provides a framework for designing space-time codes to take advantage of a small number of feedback bits from the receiver. The new codes are based on circulant matri...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We show that Minimum-Decoding-Complexity QuasiOrthogonal Space-Time Block Code (MDC-QOSTBC) can be used to form a new differential space-time modulation (DSTM) scheme to provide f...
TCOM
2010
13 years 1 days ago
2010
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...
ISCAS
1994
IEEE
13 years 9 months ago
1994
IEEE
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
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...