An efficient algorithm for constructing minimal trellises for codes over finite abelian groups (Q3129471)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for constructing minimal trellises for codes over finite abelian groups |
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
