Details

Autor(en) / Beteiligte

• Wu, J.
• Costello, D.J.

Titel

New multilevel codes over GF(q)

Ist Teil von

• IEEE transactions on information theory, 1992-05, Vol.38 (3), p.933-939

Ort / Verlag

Legacy CDMS: IEEE

Erscheinungsjahr

1992

Link zum Volltext

• IEEE_Xplore

Quelle

IEEE Electronic Library (IEL)

Beschreibungen/Notizen

• Set partitioning is applied to multidimensional signal spaces over GF(q), i.e., GF/sup n1/(q) (n1<or=q), and it is shown how to construct both multilevel block codes and multilevel trellis codes over GF(q). Multilevel (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d/sub min/>or=d are presented. These codes use Reed-Solomon codes as component codes. Longer multilevel block codes are also constructed using q-ary block codes with block length longer than q+1 as component codes. Some quaternary multilevel block codes are presented with the same length and number of information symbols as, but larger distance than, the best previously known quaternary one-level block codes. It is proved that if all the component block codes are linear. the multilevel block code is also linear. Low-rate q-ary convolutional codes, word-error-correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multilevel trellis codes over GF(q) or binary-to-q-ary trellis codes.< >