S-code: new distance-3 MDS array codes

In this paper, we present a new description of the X-code, a class of MDS array code, using skews, named S-code. The X-codes result in codewords that are arrays of size n /spl times/ n, where n is prime. Our new description does not require n to be prime but requires n to be an odd number with small...

Full description

Saved in:
Bibliographic Details
Published in2005 IEEE International Symposium on Circuits and Systems (ISCAS) pp. 348 - 351 Vol. 1
Main Authors Katti, R., Xiaoyu Ruan
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Computational complexity
Decoding
Encoding
Error correction
Neodymium
Parity check codes
Reed-Solomon codes
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present a new description of the X-code, a class of MDS array code, using skews, named S-code. The X-codes result in codewords that are arrays of size n /spl times/ n, where n is prime. Our new description does not require n to be prime but requires n to be an odd number with smallest prime factor greater than 3. We prove that the S-codes result in a distance-3 MDS code and give a description of which slopes other than 1 and -1 can be used to construct S-codes. Encoding and decoding procedures of the S-code are also introduced.
ISBN:9780780388345
0780388348
ISSN:0271-4302
2158-1525
DOI:10.1109/ISCAS.2005.1464596