Přejít k obsahu


On fast exhaustive search of the minimum distance of linear block codes

Citace:
BROULÍM, J., GEORGIEV, V., BOULGOURIS, N.V. On fast exhaustive search of the minimum distance of linear block codes. In 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT 2016) : proceedings. Piscataway: IEEE, 2016. s. 342-345. ISBN: 978-1-4673-8818-4 , ISSN: 2157-023X
Druh: STAŤ VE SBORNÍKU
Jazyk publikace: eng
Anglický název: On fast exhaustive search of the minimum distance of linear block codes
Rok vydání: 2016
Místo konání: Piscataway
Název zdroje: IEEE
Autoři: Ing. Jan Broulím , Doc. Dr. Ing. Vjačeslav Georgiev , Nikolaos V. Boulgouris
Abstrakt EN: Code design and assessment can be a computationally intensive task because of billions operations needed for code evaluation. Therefore, it is important that fast algorithms are devised for minimum distance. We propose a scalable variant of a known algorithm for exhaustive search of the minimum distance. The proposed algorithm is based on smart thread management in order to speed up the exhaustive search. The algorithm is particularly efficient when applied in combination with genetic algorithms for code design as a part of code evaluation and can be easily deployed on grid or cloud computing systems.
Klíčová slova

Zpět

Patička