17 search results - page 1 / 4 » Sum-Product Decoding of BCH Codes |
40
Voted
IEICET
2008
15 years 23 days ago
2008
108
Voted
SIPS
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— In this paper, we propose partly parallel architectures based on optimal overlapped sum-product (OSP) decoding. To ensure high throughput and hardware utilization effi...
CORR
2008
Springer
15 years 25 days ago
2008
Springer
A coded modulation system is considered in which nonbinary coded symbols are mapped directly to nonbinary modulation signals. It is proved that if the modulator-channel combination...
99
Voted
CORR
2010
Springer
15 years 25 days 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...
81
Voted
DCC
2008
IEEE
16 years 10 days ago
2008
IEEE
In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary qu...