Maximum distance separable symbol-pair codes
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 tha...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/102458 http://hdl.handle.net/10220/16355 |
| _version_ | 1826122819170205696 |
|---|---|
| author | Chee, Yeow Meng Kiah, Han Mao Wang, Chengmin |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Chee, Yeow Meng Kiah, Han Mao Wang, Chengmin |
| author_sort | Chee, Yeow Meng |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T05:54:25Z |
| format | Conference Paper |
| id | ntu-10356/102458 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T05:54:25Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | ntu-10356/1024582020-03-07T12:31:20Z Maximum distance separable symbol-pair codes Chee, Yeow Meng Kiah, Han Mao Wang, Chengmin School of Physical and Mathematical Sciences IEEE International Symposium on Information Theory (2012 : Cambridge, US) DRNTU::Engineering::Computer science and engineering::Computing methodologies::Symbolic and algebraic manipulation 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. 2013-10-10T03:36:37Z 2019-12-06T20:55:19Z 2013-10-10T03:36:37Z 2019-12-06T20:55:19Z 2012 2012 Conference Paper 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 . https://hdl.handle.net/10356/102458 http://hdl.handle.net/10220/16355 10.1109/ISIT.2012.6284052 en |
| spellingShingle | DRNTU::Engineering::Computer science and engineering::Computing methodologies::Symbolic and algebraic manipulation Chee, Yeow Meng Kiah, Han Mao Wang, Chengmin Maximum distance separable symbol-pair codes |
| title | Maximum distance separable symbol-pair codes |
| title_full | Maximum distance separable symbol-pair codes |
| title_fullStr | Maximum distance separable symbol-pair codes |
| title_full_unstemmed | Maximum distance separable symbol-pair codes |
| title_short | Maximum distance separable symbol-pair codes |
| title_sort | maximum distance separable symbol pair codes |
| topic | DRNTU::Engineering::Computer science and engineering::Computing methodologies::Symbolic and algebraic manipulation |
| url | https://hdl.handle.net/10356/102458 http://hdl.handle.net/10220/16355 |
| work_keys_str_mv | AT cheeyeowmeng maximumdistanceseparablesymbolpaircodes AT kiahhanmao maximumdistanceseparablesymbolpaircodes AT wangchengmin maximumdistanceseparablesymbolpaircodes |