Home > Research > Publications & Outputs > Array codes over rings and their trellis decoding

Research

Links

Text available via DOI:

Keywords

View graph of relations

Array codes over rings and their trellis decoding

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Array codes over rings and their trellis decoding. / Charbit, Gilles; Manoukian, H.; Honary, Bahram.
In: IEE Proceedings - Communications, Vol. 143, No. 5, 10.1996, p. 241-246.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Charbit, G, Manoukian, H & Honary, B 1996, 'Array codes over rings and their trellis decoding', IEE Proceedings - Communications, vol. 143, no. 5, pp. 241-246. https://doi.org/10.1049/ip-com:19960668

APA

Charbit, G., Manoukian, H., & Honary, B. (1996). Array codes over rings and their trellis decoding. IEE Proceedings - Communications, 143(5), 241-246. https://doi.org/10.1049/ip-com:19960668

Vancouver

Charbit G, Manoukian H, Honary B. Array codes over rings and their trellis decoding. IEE Proceedings - Communications. 1996 Oct;143(5):241-246. doi: 10.1049/ip-com:19960668

Author

Charbit, Gilles ; Manoukian, H. ; Honary, Bahram. / Array codes over rings and their trellis decoding. In: IEE Proceedings - Communications. 1996 ; Vol. 143, No. 5. pp. 241-246.

Bibtex

@article{9fb8db29f9f1440f8ad31d73a335ef88,
title = "Array codes over rings and their trellis decoding",
abstract = "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.",
keywords = "trellis codes, linear codes, decoding, computational complexity",
author = "Gilles Charbit and H. Manoukian and Bahram Honary",
year = "1996",
month = oct,
doi = "10.1049/ip-com:19960668",
language = "English",
volume = "143",
pages = "241--246",
journal = "IEE Proceedings - Communications",
issn = "1350-2425",
publisher = "Institute of Electrical Engineers",
number = "5",

}

RIS

TY - JOUR

T1 - Array codes over rings and their trellis decoding

AU - Charbit, Gilles

AU - Manoukian, H.

AU - Honary, Bahram

PY - 1996/10

Y1 - 1996/10

N2 - 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.

AB - 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.

KW - trellis codes

KW - linear codes

KW - decoding

KW - computational complexity

U2 - 10.1049/ip-com:19960668

DO - 10.1049/ip-com:19960668

M3 - Journal article

VL - 143

SP - 241

EP - 246

JO - IEE Proceedings - Communications

JF - IEE Proceedings - Communications

SN - 1350-2425

IS - 5

ER -