Finding the permutation between equivalent linear codes: the support splitting algorithm (Q4501759): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1109/18.850662 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2119117325 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:28, 19 March 2024
scientific article; zbMATH DE number 1503458
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding the permutation between equivalent linear codes: the support splitting algorithm |
scientific article; zbMATH DE number 1503458 |
Statements
Finding the permutation between equivalent linear codes: the support splitting algorithm (English)
0 references
7 September 2000
0 references
permutation-equivalent codes
0 references
invariant
0 references
weight enumerator
0 references
linear codes
0 references
signature
0 references
support splitting algorithm
0 references
hull
0 references