Abstract—We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Sin-gleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These codes aremaximumdistance separable (MDS) in the sense that theymeet the Singleton-type bound. In contrast to classical codes, where all known-ary MDS codes have length, we show that-ary MDS symbol-pair codes can have length. In addition, we completely determine the existence of MDS symbol-pair codes for certain parameters. Index Terms—Codes for magnetic storage, maximal distance separable, Singleton-type bound, symbol-pair read channels. I
We characterize product-maximum distance separable (PMDS) pairs of linear codes, i.e., pairs of code...
A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all l...
textabstractWe investigate the list decodability of symbol-pair codes in the present paper. Firstly,...
We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum ...
Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimu...
Symbol-pair codes are proposed to combat pair-errors in symbol-pair read channels. The minimum symbo...
Symbol-pair codes are used to protect against symbol-pair errors in high density data storage system...
Symbol-pair read channels, in which the outputs of the read process are pairs of consecutive symbols...
Symbol-pair read channels, in which the outputs of the read process are pairs of consecutive symbols...
Symbol-pair read channels, in which the outputs of the read process are pairs of consecutive symbols...
We investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show tha...
We investigate the list decodability of symbol-pair codes 1 in this paper. First, we show that the l...
We investigate the list decodability of symbol-pair codes 1 in this paper. First, we show that the l...
We investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show tha...
A new family of maximum distance separable (MDS) array codes is presented. The code arrays contain p...
We characterize product-maximum distance separable (PMDS) pairs of linear codes, i.e., pairs of code...
A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all l...
textabstractWe investigate the list decodability of symbol-pair codes in the present paper. Firstly,...
We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum ...
Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimu...
Symbol-pair codes are proposed to combat pair-errors in symbol-pair read channels. The minimum symbo...
Symbol-pair codes are used to protect against symbol-pair errors in high density data storage system...
Symbol-pair read channels, in which the outputs of the read process are pairs of consecutive symbols...
Symbol-pair read channels, in which the outputs of the read process are pairs of consecutive symbols...
Symbol-pair read channels, in which the outputs of the read process are pairs of consecutive symbols...
We investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show tha...
We investigate the list decodability of symbol-pair codes 1 in this paper. First, we show that the l...
We investigate the list decodability of symbol-pair codes 1 in this paper. First, we show that the l...
We investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show tha...
A new family of maximum distance separable (MDS) array codes is presented. The code arrays contain p...
We characterize product-maximum distance separable (PMDS) pairs of linear codes, i.e., pairs of code...
A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all l...
textabstractWe investigate the list decodability of symbol-pair codes in the present paper. Firstly,...