Logo image
Maximum Distance Separable Codes for Symbol-Pair Read Channels
Journal article   Peer reviewed

Maximum Distance Separable Codes for Symbol-Pair Read Channels

Yeow Meng Chee, Lijun Ji, Han Mao Kiah, Chengmin Wang and Jianxing Yin
IEEE transactions on information theory, Vol.59(11), pp.7259-7267
01/11/2013

Abstract

Computer Science Computer Science, Information Systems Computer Science, Theory & Methods Engineering Engineering, Electrical & Electronic Mathematics Mathematics, Applied Physical Sciences Science & Technology Technology
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.

Metrics

1 Record Views

Details

Logo image