Maximum distance separable symbol-pair codes

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Chee, Yeow Meng, Kiah, Han Mao, Wang, Chengmin
Other Authors: School of Physical and Mathematical Sciences
Format: Conference or Workshop Item
Language:English
Published: 2013
Subjects:
DRNTU::Engineering::Computer science and engineering::Computing methodologies::Symbolic and algebraic manipulation
Online Access:https://hdl.handle.net/10356/102458
http://hdl.handle.net/10220/16355
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary: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.

Similar Items