New MDS Symbol-Pair Codes From Repeated-Root Codes

被引：30

作者：

Kai, Xiaoshan ^{[1
]}

Zhu, Shixin ^{[1
]}

Zhao, Yusen ^{[1
]}

Luo, Huarong ^{[1
]}

Chen, Zhe ^{[1
]}

机构：

[1] Hefei Univ Technol, Sch Math, Hefei 230009, Anhui, Peoples R China

来源：

IEEE COMMUNICATIONS LETTERS | 2018年 / 22卷 / 03期

基金：

中国国家自然科学基金;

关键词：

MDS symbol-pair codes; repeated-root constacyclic codes; minimum pair-distance; CYCLIC CODES; READ CHANNELS; CONSTRUCTIONS;

D O I：

10.1109/LCOMM.2018.2791422

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

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.

引用

页码：462 / 465

页数：4

共 20 条

[1]

Cary Huffman., 2003, Fundamentals of Error-Correcting Codes

[2]

Cassuto Yuval, 2011, Proceedings of the 2011 IEEE International Symposium on Information Theory - ISIT, P2348, DOI 10.1109/ISIT.2011.6033982

[3] Codes for Symbol-Pair Read Channels [J].

Cassuto, Yuval ;

Blaum, Mario .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (12) :8011-8020

[4] Codes for Symbol-Pair Read Channels [J].

Cassuto, Yuval ;

Blaum, Mario .

2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, :988-992

[5] ON REPEATED-ROOT CYCLIC CODES [J].

CASTAGNOLI, G ;

MASSEY, JL ;

SCHOELLER, PA ;

VONSEEMANN, N .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (02) :337-342

[6]

Chee Y. M., 2012, P INT S INF THEOR CA, P2896

[7] Maximum Distance Separable Codes for Symbol-Pair Read Channels [J].

Chee, Yeow Meng ;

Ji, Lijun ;

Kiah, Han Mao ;

Wang, Chengmin ;

Yin, Jianxing .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (11) :7259-7267

[8] Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions [J].

Chen, Bocong ;

Lin, Liren ;

Liu, Hongwei .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (12) :7661-7666

[9]

Ding B., 2016, MAXIMUM DISTANCE SEP

[10] New constructions of MDS symbol-pair codes [J].

Ding, Baokun ;

Ge, Gennian ;

Zhang, Jun ;

Zhang, Tao ;

Zhang, Yiwei .

DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (04) :841-859

← 1 2 →