Abstract:
A special form of Cauchy matrix is used to obtain a tighter bound for the validity region of the maximum distance separable (MDS) conjecture and a new compact characteriz...Show MoreMetadata
Abstract:
A special form of Cauchy matrix is used to obtain a tighter bound for the validity region of the maximum distance separable (MDS) conjecture and a new compact characterization of generalized Reed-Solomon codes. The latter is further used to obtain constructions and some existence results for long (2k, k) double-circulant MDS codes.<>
Published in: IEEE Transactions on Information Theory ( Volume: 35, Issue: 6, November 1989)
DOI: 10.1109/18.45291
Repairing Reed-Solomon Codes
Venkatesan Guruswami,Mary Wootters
Algebraic soft-decision decoding of Reed-Solomon codes
R. Koetter,A. Vardy
A Unified Approach to Construct MDS Self-Dual Codes via Reed-Solomon Codes
Aixian Zhang,Keqin Feng
Subspace subcodes of Reed-Solomon codes
M. Hattori,R.J. McEliece,G. Solomon
A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm
S.V. Fedorenko
Hermitian Self-Dual, MDS, and Generalized Reed–Solomon Codes
Yongfeng Niu,Qin Yue,Yansheng Wu,Liqin Hu
MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes
Junzhen Sui,Qin Yue,Xia Li,Daitao Huang