Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/20315| Title: | Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity | Authors: | Spasov, Dejan Gushev, Marjan |
Keywords: | nearest neighbor decoding, unique decoding, bounded distance decoding, minimum distance decoding | Issue Date: | 12-Sep-2010 | Publisher: | Springer, Berlin, Heidelberg | Conference: | International Conference on ICT Innovations | 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. | URI: | http://hdl.handle.net/20.500.12188/20315 |
| 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)
32
checked on Jul 24, 2024
Download(s)
7
checked on Jul 24, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.