dc.contributor.author |
Polgar, Zsolt |
|
dc.contributor.author |
Năstase, Ana |
|
dc.contributor.author |
Bota, Vasile |
|
dc.date.accessioned |
2021-09-16T07:22:38Z |
|
dc.date.available |
2021-09-16T07:22:38Z |
|
dc.date.issued |
2004 |
|
dc.identifier.citation |
Polgar, Zsolt. Performances of the Reed-Solomon codes decoded with the Guruswami-Sudan algorithm. Timişoara: Editura Politehnica, 2004 |
en_US |
dc.identifier.uri |
http://primo.upt.ro:1701/primo-explore/search?query=any,contains,Performances%20of%20the%20Reed-Solomon%20codes%20decoded%20with%20the%20Guruswami-Sudan%20algorithm&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo |
|
dc.description.abstract |
The Guruswami-Sudan (GS) decoding algorithm is a list-type decoding algorithm that corrects more errors than the “declared” capability, for certain coding rates of the Reed-Solomon (RS) codes. Using computer simulations, the paper presents a comparison between the correction capability and the processing time of the GS and Berlekamp-Massey (BM) algorithms. The simulations are employed to establish the optimum values of the GS parameters that ensure the maximum performance/processing time ratio. Some methods of changing the GS parameters, in terms of the packet-error length, which provide shorter decoding times, are also presented. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Timişoara : Editura Politehnica |
en_US |
dc.relation.ispartofseries |
Buletinul ştiinţific al Universităţii „Politehnica” din Timişoara, România. Seria electronică şi telecomunicaţii, Tom 49(63), fasc. 2 (2004), p. 13-18 |
|
dc.subject |
RS codes |
en_US |
dc.subject |
Guruswami-Sudan decoding algorithm |
en_US |
dc.subject |
Berlekamp-Massey decoding algorithm |
en_US |
dc.subject |
Correction capability |
en_US |
dc.subject |
Decoding time |
en_US |
dc.title |
Performances of the Reed-Solomon codes decoded with the Guruswami-Sudan algorithm [articol] |
en_US |
dc.type |
Article |
en_US |