Group code

In computer science, group codes are a type of code. Group codes consist of $n$ linear block codes which are subgroups of $G^n$ , where $G$ is a finite abelian group.

A systematic group code $C$ is a code over $G^n$ of order $\left| G \right|^k$ defined by $n-k$ homomorphisms which determine the parity check bits. The remaining $k$ bits are the information bits themselves.

Construction

Group codes can be constructed by special generator matrices which resemble generator matrices of linear block codes except that the elements of those matrices are endomorphisms of the group instead of symbols from the code's alphabet. For example, consider the generator matrix

G = \begin{pmatrix} \begin{pmatrix} 0 0 \\ 1 1 \end{pmatrix} \begin{pmatrix} 0 1 \\ 0 1 \end{pmatrix} \begin{pmatrix} 1 1 \\ 0 1 \end{pmatrix} \\ \begin{pmatrix} 0 0 \\ 1 1 \end{pmatrix} \begin{pmatrix} 11 \\ 1 1 \end{pmatrix} \begin{pmatrix} 0 0 \\ 0 0 \end{pmatrix} \end{pmatrix}

The elements of this matrix are $2\times 2$ matrices which are endomorphisms. In this scenario, each codeword can be represented as $g_1^{m_1} g_2^{m_2} ... g_r^{m_r}$ where $g_1,... g_r$ are the generators of $G$ .

References

Biglieri, E.; Elia, M. (1993). "Construction of Linear Block Codes Over Groups". Proceedings. IEEE International Symposium on Information Theory. p. 360. doi:10.1109/ISIT.1993.748676. ISBN 0-7803-0878-6.
G. D. Forney, M. Trott, The dynamics of group codes : State spaces, trellis diagrams and canonical encoders, IEEE Trans. Inform. theory, Vol 39 (1993), pages 1491-1593.
V. V. Vazirani, Huzur Saran and B. S. Rajan, An efficient algorithm for constructing minimal trellises for codes over finite Abelian groups, IEEE Trans. Inform. Theory 42, No.6, (1996), 1839-1854.
A. A. Zain, B. Sundar Rajan, "Dual codes of Systematic Group Codes over Abelian Groups", Appl. Algebra Eng. Commun. Comput. 8(1): 71-83 (1996).

This article is issued from Wikipedia - version of the Saturday, August 29, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.