| [177057] |
| Title: On indecomposable Abelian codes and their vertices. |
| Written by: Karl-Heinz Zimmermann |
| in: <em>IEEE Transactions on Information Theory</em>. November (1991). |
| Volume: <strong>37</strong>. Number: (6), |
| on pages: 1723-1731 |
| Chapter: |
| Editor: |
| Publisher: IEEE: |
| Series: |
| Address: |
| Edition: |
| ISBN: 10.1109/18.104341 |
| how published: 91-90 Zimm91b TIT |
| Organization: |
| School: |
| Institution: |
| Type: |
| DOI: |
| URL: |
| ARXIVID: |
| PMID: |
Note: khzimmermann, AEG
Abstract: Indecomposable nonsemisimple Abelian codes are investigated. The author describes all indecomposable Abelian group codes and shows that the minimal distance of such a code M is the product of the minimal distance of a semisimple Abelian group code and the minimal distance of the source module of M. It is illustrated that the minimal distance of every indecomposable Abelian code depends upon its associated vertex.