Maximum Distance Separable Codes for Symbol-Pair Read Channels

被引:72
作者
Chee, Yeow Meng [1 ]
Ji, Lijun [2 ]
Kiah, Han Mao [1 ]
Wang, Chengmin [3 ]
Yin, Jianxing [2 ]
机构
[1] Nanyang Technol Univ, Div Math Sci, Sch Phys & Math Sci, Singapore 637371, Singapore
[2] Suzhou Univ, Dept Math, Suzhou 215006, Peoples R China
[3] Jiangnan Univ, Sch Sci, Wuxi 214122, Peoples R China
基金
新加坡国家研究基金会;
关键词
Codes for magnetic storage; maximal distance separable; Singleton-type bound; symbol-pair read channels;
D O I
10.1109/TIT.2013.2276615
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:7259 / 7267
页数:9
相关论文
共 11 条
[1]  
[Anonymous], 1999, SPRINGER SERIES STAT
[2]  
Beth T., 1999, DESIGN THEORY, VI
[3]  
Bondy J. A., 2008, GRADUATE TEXTS MATH
[4]  
Cassuto Yuval, 2011, Proceedings of the 2011 IEEE International Symposium on Information Theory - ISIT, P2348, DOI 10.1109/ISIT.2011.6033982
[5]   Codes for Symbol-Pair Read Channels [J].
Cassuto, Yuval ;
Blaum, Mario .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (12) :8011-8020
[6]   Codes for Symbol-Pair Read Channels [J].
Cassuto, Yuval ;
Blaum, Mario .
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, :988-992
[7]  
Chee Y. M., 2012, P INT S INF THEOR CA, P2896
[8]   HAMILTON CIRCUITS AND HAMILTON PATHS [J].
DIRAC, GA .
MATHEMATISCHE ANNALEN, 1972, 197 (01) :57-&
[9]  
Novak J., 1974, Matematicky Casopis, V24, P43
[10]  
Novak J., 1971, SBORN VED PRAC VSST