Home > Research > Publications & Outputs > Array codes over rings and their trellis decoding
View graph of relations

Array codes over rings and their trellis decoding

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>10/1996
<mark>Journal</mark>IEE Proceedings - Communications
Issue number5
Number of pages6
Pages (from-to)241-246
Publication StatusPublished
<mark>Original language</mark>English


A class of array codes over rings of integers modulo-q with good Euclidean distance properties is introduced. Depending on the design, these codes can have linear or nonlinear properties. An extension of a simple algorithm to design a low-complexity trellis diagram for array codes over GF(2) introduced recently is developed for array codes over rings. These codes over rings are compared to the corresponding codes over GF(2), where particular attention is given to the coding gain, spectral efficiency, codebook size and trellis complexity. It is shown that array codes over Z4 and Z8 provide a twofold and threefold increase, respectively, in spectral efficiency as well as a higher coding gain over uncoded transmission and a much larger codebook than that obtained with the same array codes over GF(2) for similar code parameters.