Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/20315| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Spasov, Dejan | en_US |
| dc.contributor.author | Gushev, Marjan | en_US |
| dc.date.accessioned | 2022-07-04T09:53:40Z | - |
| dc.date.available | 2022-07-04T09:53:40Z | - |
| dc.date.issued | 2010-09-12 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.12188/20315 | - |
| dc.description.abstract | We show that for (systematic) linear codes the time complexity of unique decoding is 2 nRH R 2/ O n q and the time complexity of minimum distance decoding is 2 nRH R O n q . The proposed algorithm inspects all error patterns in the information set of the received message of weight less than d 2 or d , respectively. | en_US |
| dc.publisher | Springer, Berlin, Heidelberg | en_US |
| dc.subject | nearest neighbor decoding, unique decoding, bounded distance decoding, minimum distance decoding | en_US |
| dc.title | Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity | en_US |
| dc.type | Proceeding article | en_US |
| dc.relation.conference | International Conference on ICT Innovations | en_US |
| item.grantfulltext | open | - |
| item.fulltext | With Fulltext | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 1003.4627.pdf | 269.66 kB | Adobe PDF | View/Open |
Page view(s)
53
checked on Oct 11, 2024
Download(s)
10
checked on Oct 11, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.