1953 search results - page 7 / 391 » codes 2010 |
127
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
109
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
An optimal constant-composition or constant-weight code of weight w has linear size if and only if its distance d is at
CAV
2010
Springer
15 years 7 months ago
2010
Springer
49
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
51
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
