An efficient algorithm for constructing minimal trellises for codes over finite abelian groups (Q3129471): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:51, 3 February 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
