Academic Journal
Maximum Distance Separable Codes for Symbol-Pair Read Channels.
| Title: | Maximum Distance Separable Codes for Symbol-Pair Read Channels. |
|---|---|
| Authors: | Chee, Yeow Meng1, Ji, Lijun2, Kiah, Han Mao1, Wang, Chengmin3, Yin, Jianxing2 |
| Source: | IEEE Transactions on Information Theory. Nov2013, Vol. 59 Issue 11, p7259-7267. 9p. |
| Subject Terms: | Magnetic memory (Computers), Program generators (Computer programs), Hamming distance, Vectors (Calculus), Separable algebras, Channel coding |
| 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 \Omega (q^2). In addition, we completely determine the existence of MDS symbol-pair codes for certain parameters. [ABSTRACT FROM AUTHOR] |
| Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Business Source Index |
Be the first to leave a comment!