Details

Autor(en) / Beteiligte

• Chen, Bocong
• Lin, Liren
• Liu, Hongwei

Titel

Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions

Ist Teil von

• IEEE transactions on information theory, 2017-12, Vol.63 (12), p.7661-7666

Ort / Verlag

New York: IEEE

Erscheinungsjahr

2017

Link zum Volltext

• IEEE_Xplore

Quelle

IEEE/IET Electronic Library

Beschreibungen/Notizen

• Symbol-pair codes introduced by Cassuto and Blaum (2010) are designed to protect against pair errors in symbol-pair read channels. The higher the minimum pair distance, the more pair errors the code can correct. Maximum distance separable (MDS) symbol-pair codes are optimal in the sense that pair distance cannot be improved for given length and code size. The contribution of this paper is twofold. First, we present three lower bounds for the minimum pair distance of constacyclic codes, the first two of which generalize the previously known results due to Cassuto and Blaum (2011) and Kai et al. (2015). The third one exhibits a lower bound for the minimum pair distance of repeated-root cyclic codes. Second, we obtain new MDS symbol-pair codes with minimum pair distance seven and eight through repeated-root cyclic codes.