Please use this identifier to cite or link to this item:
Title: Maximum distance separable symbol-pair codes
Authors: Chee, Yeow Meng
Kiah, Han Mao
Wang, Chengmin
Keywords: DRNTU::Engineering::Computer science and engineering::Computing methodologies::Symbolic and algebraic manipulation
Issue Date: 2012
Source: Chee, Y. M., Kiah, H. M., & Wang, C. (2012). Maximum distance separable symbol-pair codes. 2012 IEEE International Symposium on Information Theory (ISIT), pp.2886-2890 .
Abstract: 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 Ω(q2). We also construct equidistant cyclic MDS symbol-pair codes from Mendelsohn designs.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SPMS Conference Papers

Google ScholarTM



Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.