Group code

In coding theory, 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.

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, considering 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 .

gollark: The Nightmare Collider
gollark: The Collider of Devastation
gollark: The Doom Collider
gollark: Suggested xkcd telescope names: The Very Large Telescope ☑ The Extremely Large Telescope ☑ The Overwhelmingly Large Telescope ☑ (Canceled) The Oppressively Colossal Telescope ☐ The Mind-numbingly Vast Telescope ☐ The Despair Telescope ☐ The Cataclysmic Telescope ☐ The Telescope of Devastation ☐ The Nightmare Scope ☐ The Infinite Telescope ☐ The Final Telescope ☐ I propose these names for colliders:The Oppressively Colossal Collider
gollark: Future Circular Collider is an awful name.

See also

References

    Further reading

    • Watkinson, John (1990). "3.4. Group codes". Coding for Digital Recording. Stoneham, MA, USA: Focal Press. pp. 51–61. ISBN 978-0-240-51293-8.
    • Biglieri, Ezio; Elia, Michele (1993-01-17). "Construction of Linear Block Codes Over Groups". Proceedings. IEEE International Symposium on Information Theory (ISIT). p. 360. doi:10.1109/ISIT.1993.748676. ISBN 978-0-7803-0878-7.
    • Forney, George David; Trott, Mitch D. (1993). "The dynamics of group codes: State spaces, trellis diagrams and canonical encoders". IEEE Transactions on Information Theory. 39 (5): 1491–1593. doi:10.1109/18.259635.
    • Vazirani, Vijay Virkumar; Saran, Huzur; Rajan, B. Sundar (1996). "An efficient algorithm for constructing minimal trellises for codes over finite Abelian groups". IEEE Transactions on Information Theory. 42 (6): 1839–1854. CiteSeerX 10.1.1.13.7058. doi:10.1109/18.556679.
    • Zain, Adnan Abdulla; Rajan, B. Sundar (1996). "Dual codes of Systematic Group Codes over Abelian Groups". Applicable Algebra in Engineering, Communication and Computing (AAECC). 8 (1): 71–83.
    This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.