Name
Abstract | ||
|---|---|---|
Symbol-pair codes can be used to guard against pair errors over symbol-pair read channels. One of the central themes in symbol-error correction is the construction of maximal distance separable (MDS) symbol-pair codes that possess the largest possible pair-error correcting performance. In this letter, we construct three new MDS symbol-pair codes with minimum pair-distance six or seven through repeated-root constacyclic codes. In contrast with classical MDS codes, they have relatively large length. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/LCOMM.2018.2791422 | IEEE Communications Letters |
Keywords | Field | DocType |
Linear codes,Hamming weight,Hamming distance,Indexes,Data storage systems,Writing | Discrete mathematics,Symbol,Computer science,Separable space,Computer network,Communication channel,Hamming distance,Guard (information security),Hamming weight | Journal |
Volume | Issue | ISSN |
22 | 3 | 1089-7798 |
Citations | PageRank | References |
2 | 0.38 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoshan Kai | 1 | 83 | 9.90 |
| Shixin Zhu | 2 | 216 | 37.61 |
| Yusen Zhao | 3 | 2 | 0.38 |
| Huarong Luo | 4 | 2 | 0.38 |
| Zhe Chen | 5 | 343 | 70.20 |