In computer science, group codes are a type of code. Group codes consist of
linear block codes which are subgroups of , where is a finite Abelian group.
A systematic group code is a code over of order defined by homomorphisms which determine the parity check bits. The remaining bits are the information bits themselves.
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
The elements of this matrix are matrices which are endomorphisms. In this scenario, each codeword can be represented as
where are the generators of .
- Template:Cite doi
- G. D. Forney, M. Trott, Template:Doi-inline, IEEE Trans. Inform. theory, Vol 39 (1993), pages 1491-1593.
- V. V. Vazirani, Huzur Saran and B. S. Rajan, Template:Doi-inline, 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).