Progress Report of Greedy Algorithms in Coding theory

Spasov, Dejan (2013) Progress Report of Greedy Algorithms in Coding theory. In: Proceedings of the Tenth Conference on Informatics and Information Technology. Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 197-198. ISBN 978-608-4699-01-9

[img]
Preview
Text
978-608-4699-01-9_pp197-198.pdf

Download (233kB) | Preview
Official URL: http://ciit.finki.ukim.mk

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.

Item Type: Book Section
Subjects: International Conference on Informatics and Information Technologies > Theoretical Foundations of Informatics
International Conference on Informatics and Information Technologies > Signal Processing
Depositing User: Vangel Ajanovski
Date Deposited: 28 Oct 2016 00:15
Last Modified: 28 Oct 2016 00:15
URI: http://eprints.finki.ukim.mk/id/eprint/11079

Actions (login required)

View Item View Item