Rectified 5-cell: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Tomruen
 
en>Addbot
m Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q7303156
Line 1: Line 1:
Hi there. My title is Sophia Meagher even though it is not the name on my beginning certificate. North Carolina is exactly where we've been residing for years and will never transfer. I am really fond of to go to karaoke but I've been using on new issues recently. Office supervising is where her primary earnings arrives from.<br><br>Feel free to surf to my site ... [https://www-Ocl.gist.ac.kr/work/xe/?document_srl=605236 psychic readers]
In [[computer science]], '''group codes''' are a type of [[coding theory|code]]. Group codes consist of 
<math>n</math> [[linear block codes]] which are subgroups of <math>G^n</math>, where <math>G</math> is a finite [[Abelian group]].
 
A systematic group code <math>C</math> is a code over <math>G^n</math> of order <math>\left| G \right|^k</math> defined by <math>n-k</math> homomorphisms which determine the parity check bits. The remaining <math>k</math> bits are the information bits themselves.
 
== Construction ==
Group codes can be constructed by special [[generator matrix|generator matrices]] which resemble generator matrices of linear block codes except that the elements of those matrices are [[endomorphism]]s of the group instead of symbols from the code's alphabet. For example, consider the generator matrix
 
:<math>
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}
</math>
 
The elements of this matrix are <math>2\times 2</math> matrices which are endomorphisms. In this scenario, each codeword can be represented as
<math>g_1^{m_1} g_2^{m_2} ... g_r^{m_r}</math>  
where <math>g_1,... g_r</math> are the [[Generating set of a group|generator]]s of <math>G</math>.
 
== References ==
* {{cite doi|10.1109/ISIT.1993.748676}}
* G. D. Forney, M. Trott, {{doi-inline|10.1109/18.259635|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,  {{doi-inline|10.1109/18.556679|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).
 
[[Category:Coding theory]]

Revision as of 13:38, 23 March 2013

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

A systematic group code C is a code over Gn of order |G|k defined by nk 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=((0011)(0101)(1101)(0011)(1111)(0000))

The elements of this matrix are 2×2 matrices which are endomorphisms. In this scenario, each codeword can be represented as g1m1g2m2...grmr where g1,...gr are the generators of G.

References

  • 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).