How to Find the Equivalence Classes in a Set of Linear Codes in Practice?

Autor:	Stefka Bouyuklieva, Iliya Bouyukliev
Jazyk:	angličtina
Rok vydání:	2024
Předmět:	linear code code equivalence canonical form graph isomorphism problem Mathematics QA1-939
Zdroj:	Mathematics, Vol 12, Iss 2, p 328 (2024)
Druh dokumentu:	article
ISSN:	2227-7390
DOI:	10.3390/math12020328
Popis:	An algorithm for equivalence of linear codes over finite fields is presented. Its main advantage is that it can extract exactly one representative from each equivalence class among a large number of linear codes. It can also be used as a test for isomorphism of binary matrices. The algorithm is implemented in the program LCequivalence, which is designed to obtain the inequivalent codes in a set of linear codes over a finite field with q<64 elements. This program is a module of the free software package QextNewEdition for constructing, classifying and studying linear codes.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/9d2a5aed2aec4521a8292954b3df6fda Zobrazit plný text záznamu View record in DOAJ Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.