Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/3855| Title: | Performances of the Reed-Solomon codes decoded with the Guruswami-Sudan algorithm [articol] |
| Authors: | Polgar, Zsolt Năstase, Ana Bota, Vasile |
| Subjects: | RS codes Guruswami-Sudan decoding algorithm Berlekamp-Massey decoding algorithm Correction capability Decoding time |
| Issue Date: | 2004 |
| Publisher: | Timişoara : Editura Politehnica |
| Citation: | Polgar, Zsolt. Performances of the Reed-Solomon codes decoded with the Guruswami-Sudan algorithm. Timişoara: Editura Politehnica, 2004 |
| Series/Report no.: | 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 |
| 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. |
| 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 |
| Appears in Collections: | Articole științifice/Scientific articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| BUPT_ART_Polgar_f.pdf | 708.64 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.