Maximum Distance Separable Codes for Symbol-Pair Read Channels
Yeow Meng Chee, Lijun Ji, Han Mao Kiah, Chengmin Wang, and Jianxing, Yin
TL;DR
None
Contribution
None
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Error Correcting Code Techniques · graph theory and CDMA systems