An efficient algorithm for constructing minimal trellises for codes over finite abelian groups (Q3129471): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065681224 / rank | |||
Normal rank | |||
Latest revision as of 23:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for constructing minimal trellises for codes over finite abelian groups |
scientific article |
Statements
An efficient algorithm for constructing minimal trellises for codes over finite abelian groups (English)
0 references
27 April 1997
0 references
codes over rings
0 references
minimal trellis
0 references
group code
0 references
lattices
0 references
