Name
Abstract | ||
|---|---|---|
We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These codes are maximum distance separable (MDS) in the sense that they meet the Singleton-type bound. In contrast to classical codes, where all known $q$-ary MDS codes have length $O(q)$ , we show that $q$-ary MDS symbol-pair codes can have length $\\Omega (q^{2})$. In addition, we completely determine the existence of MDS symbol-pair codes for certain parameters. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TIT.2013.2276615 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
codes for magnetic storage,maximal distance separable,channel coding,singleton-type bound,optimal symbol-pair codes,symbol-pair read channels,q-ary mds symbol-pair codes,maximum distance separable codes | Journal | 59 |
Issue | ISSN | Citations |
11 | 0018-9448 | 10 |
PageRank | References | Authors |
0.86 | 6 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yeow Meng Chee | 1 | 593 | 62.01 |
| Lijun Ji | 2 | 56 | 8.53 |
| Han Mao Kiah | 3 | 128 | 29.10 |
| Chengmin Wang | 4 | 44 | 8.30 |
| Jianxing Yin | 5 | 373 | 30.16 |