Abstract | ||
---|---|---|
Cassuto and Blaum proposed new error correcting codes which are called symbol-pair codes. They gave a coding framework for channels whose outputs are overlapping pairs of symbols in storage applications. It is called symbol-pair read channel. The pair distance and pair error are used in symbol-pair read channel. Cassuto et al. and showed Yaakobi et al. presented decoding algorithms for symbol-pair codes. However, their decoding algorithms cannot always correct errors whose number is not more than half the minimum pair distance. In this paper, we propose a new decoding algorithm using the syndrome of symbol-pair codes. In addition, we show that the proposed algorithm can correct all pair errors within the pair error correcting capability. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1109/ITW.2014.6970813 | Information Theory Workshop |
Keywords | Field | DocType |
decoding,error correction codes,coding framework,error correcting code,pair distance,pair error correcting capability,storage application,symbol-pair code,symbol-pair read channel,syndrome decoding algorithm | Concatenated error correction code,BCJR algorithm,Berlekamp–Welch algorithm,Sequential decoding,Computer science,Block code,Serial concatenated convolutional codes,Algorithm,Theoretical computer science,Linear code,List decoding | Conference |
ISSN | Citations | PageRank |
1662-9019 | 3 | 0.64 |
References | Authors | |
1 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Masanori Hirotomo | 1 | 13 | 8.85 |
Makoto Takita | 2 | 3 | 0.98 |
Masakatu Morii | 3 | 25 | 1.92 |