How to Find the Equivalence Classes in a Set of Linear Codes in Practice?
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 impl...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-01-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/12/2/328 |
| Summary: | 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 <span style="font-variant: small-caps;">LCequivalence</span>, which is designed to obtain the inequivalent codes in a set of linear codes over a finite field with <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>q</mi><mo><</mo><mn>64</mn></mrow></semantics></math></inline-formula> elements. This program is a module of the free software package <span style="font-variant: small-caps;">QextNewEdition</span> for constructing, classifying and studying linear codes. |
|---|---|
| ISSN: | 2227-7390 |