An efficient algorithm for constructing minimal trellises for codes over finite abelian groups (Q3129471)

From MaRDI portal
Revision as of 01:40, 31 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers