Please use this identifier to cite or link to this item:
https://doi.org/10.1109/PIMRC.2006.254468
| DC Field | Value | |
|---|---|---|
| dc.title | Synthesis of multisequences having unknown elements in the middle with decoding applications | |
| dc.contributor.author | Zhang, J. | |
| dc.contributor.author | Armand, M. | |
| dc.date.accessioned | 2014-06-19T03:29:22Z | |
| dc.date.available | 2014-06-19T03:29:22Z | |
| dc.date.issued | 2006 | |
| dc.identifier.citation | Zhang, J.,Armand, M. (2006). Synthesis of multisequences having unknown elements in the middle with decoding applications. IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC : -. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/PIMRC.2006.254468" target="_blank">https://doi.org/10.1109/PIMRC.2006.254468</a> | |
| dc.identifier.isbn | 1424403294 | |
| dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/71922 | |
| dc.description.abstract | We propose an algorithm which incorporates Feng-Tzeng's Fundamental Iterative Algorithm (FIA) for synthesizing multisequences containing unknown elements in the middle. This algorithm can be applied to decode the Generalized Reed Solomon (GRS) codes whose associated syndrome sequences have unknown elements in the middle. We also show that the proposed algorithm can be used to decode Folded Reed Solomon (FRS) codes constructed from any GRS code. ©2006 IEEE. | |
| dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/PIMRC.2006.254468 | |
| dc.source | Scopus | |
| dc.type | Conference Paper | |
| dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
| dc.description.doi | 10.1109/PIMRC.2006.254468 | |
| dc.description.sourcetitle | IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC | |
| dc.description.page | - | |
| dc.identifier.isiut | NOT_IN_WOS | |
| Appears in Collections: | Staff Publications | |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.