| [177024] |
| Title: Decoding of linear codes over Galois rings. |
| Written by: N. Suresh Babu and Karl-Heinz Zimmermann |
| in: <em>IEEE Transactions on Information Theory</em>. May (2001). |
| Volume: <strong>47</strong>. Number: (4), |
| on pages: 1599-1603 |
| Chapter: |
| Editor: |
| Publisher: IEEE: |
| Series: |
| Address: |
| Edition: |
| ISBN: 10.1109/18.923743 |
| how published: 01-95 BaZi01 TIT |
| Organization: |
| School: |
| Institution: |
| Type: |
| DOI: |
| URL: |
| ARXIVID: |
| PMID: |
Note: khzimmermann, AEG
Abstract: We present a method for decoding an arbitrary linear code over a Galois ring ā by a process of lifting decoding algorithms for a family of linear codes over a finite field š¦ forming an Ī±-element chain, where š¦ is the quotient field of ā and ā has characteristic pĪ±. As a new result, this method also works for linear codes over ā which are nonfree ā-modules.