Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/20312| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Spasov, Dejan | en_US |
| dc.date.accessioned | 2022-07-04T09:42:51Z | - |
| dc.date.available | 2022-07-04T09:42:51Z | - |
| dc.date.issued | 2013 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.12188/20312 | - |
| dc.description.abstract | Greedy algorithms in Coding Theory are simple to define and easy to implement, but require exponential running time. Codes obtained with greedy constructions have very good parameters, thus improving the running time of these algorithms may lead to discovery of new codes with best known parameters. We give an overview of greedy algorithms and discuss further improvements. | en_US |
| dc.publisher | Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, Macedonia | en_US |
| dc.title | Progress Report of Greedy Algorithms in Coding theory | en_US |
| dc.type | Proceeding article | en_US |
| dc.relation.conference | CIIT 2013 | en_US |
| item.fulltext | With Fulltext | - |
| item.grantfulltext | open | - |
| 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 | |
|---|---|---|---|---|
| 10CiiT-42.pdf | 228.04 kB | Adobe PDF | View/Open |
Page view(s)
36
checked on May 29, 2024
Download(s)
6
checked on May 29, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.