DSpace Repository

Detectarea şi corectarea erorilor la decodarea secvenţială a codurilor matroide

Show simple item record

dc.contributor.author BODEAN, G.
dc.contributor.author BODEAN, D.
dc.date.accessioned 2019-09-24T11:37:45Z
dc.date.available 2019-09-24T11:37:45Z
dc.date.issued 2007
dc.identifier.citation BODEAN, G., BODEAN, D. Detectarea şi corectarea erorilor la decodarea secvenţială a codurilor matroide. In: Meridian Ingineresc. 2007, nr. 3, pp. 86-93. ISSN 1683-853X. en_US
dc.identifier.issn 1683-853X
dc.identifier.uri http://repository.utm.md/handle/5014/4568
dc.description.abstract În lucrare sunt prezentate şi analizate proiectele unităţilor subansamblului de detectare şi corectare a erorilor în cuvintele de cod matroid cu lungimile n = 2m şi n = 2m+1, unde m = 2, 3, ...Pentru rezolvarea ecuaţiilor–cheie este aplicat algoritmul Euclidean de divizare a polinoamelor. Proiectele sunt codificate în limbajul VHDL. Implementarea proiectelor a fost realizată în CAD–sistemul Quartus-Altera. en_US
dc.description.abstract In this paper the algorithms and VHDL-entities of detection and correction of erroneous symbols in the matroid codes of length n = 2m and n = 2m+1, where m = 2, 3,…, are presented.. The matroid codes generalize a class linear non-binary maximum-distance separable block codes. The Euclidean algorithm of polynomials division is applied to solve the key equation. Projects of entities are implemented and verified in the CAD-system Quartus-Altera. en
dc.description.abstract Dans l’article sont présentés les algorithmes et les VHDL-modules de la détection et la correction des symboles erronés à des codes matroide de la longueur n = 2m et n = 2m+1, où m = 2, 3... Les codes matroide généralisent la classe linéaire non binaire maximum-distance séparable des codes block. Pour la décision de l'équation clé on applique l'algorithme Euclidean de la division des polynômes. Les projets des modules sont réalisés et sont contrôlés dans le CAD-système Quartus-Altera. fr
dc.description.abstract В работе представлены алгоритмы и VHDL-модули обнаружения и исправления ошибочных символов в матроидных кодах длины n = 2m и n = 2m+1, где m = 2, 3, ... Матроидные коды обобщают класс линейных недвоичных сепарабельных с максимальным расстоянием блоковых кодов. ru
dc.language.iso ro en_US
dc.publisher Editura U.T.M. en_US
dc.rights Attribution-NonCommercial-NoDerivs 3.0 United States *
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/us/ *
dc.subject matroid codes en_US
dc.subject equations en_US
dc.subject coduri matroide en_US
dc.subject ecuaţii en_US
dc.title Detectarea şi corectarea erorilor la decodarea secvenţială a codurilor matroide en_US
dc.title.alternative Errors detection and correction in the sequential decoding of the matroid codes en_US
dc.title.alternative La détection et la correction des erreurs au décodage symbolique des codes matroide en_US
dc.title.alternative Обнаружение и исправление ошибок при по-символьном декодировании матроидных кодов en_US
dc.type Article en_US


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States

Search DSpace


Advanced Search

Browse

My Account