Toward optimizing cauchy matrix for cauchy reed-solomon code

Author

Li, Xiangxue ; Zheng, Qingji ; Qian, Haifeng ; Zheng, Dong ; Li, Jianhua

Author_Institution

Shanghai Key Lab. of Inform. Security Manage. & Tech. Res., Shanghai Jiaotong Univ., Shanghai, China

Volume

13

Issue

8

fYear

2009

fDate

8/1/2009 12:00:00 AM

Firstpage

603

Lastpage

605

Abstract

The computational costs of Cauchy Reed-Solomon (CRS) encoding operation make a great impact on the performance of its practical applications. The letter concentrates on how to construct a good Cauchy matrix which can lead to an efficient CRS coding scheme. We first formally model the problem by using a binary quadratic programming, then present an approximate method called localized greedy algorithm (LGA) to solve it. Compared with existing work, LGA requires much lower complexities to obtain the same performance of Cauchy matrices.

Keywords

Reed-Solomon codes; greedy algorithms; matrix algebra; quadratic programming; Cauchy matrix; Reed-Solomon encoding operation; binary quadratic programming; localized greedy algorithm; Computational efficiency; Encoding; Galois fields; Greedy algorithms; Information security; Mathematical model; Parity check codes; Polynomials; Quadratic programming; Reed-Solomon codes; Reed-Solomon code, Cauchy matrix, disaster tolerance, binary quadratic programming.;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2009.090988

Filename

5200899