|
|
Non-commutative Gröbner bases
Požárková, Zuzana ; Šťovíček, Jan (advisor) ; Stanovský, David (referee)
In the presented work we define non-commutative Gröbner bases including the necessary basis of non- commutative algebra theory and notion admissible ordering. We present non-commutative variant of the Buchberger algorithm and study how the algorithm can be improved. Analogous to the Gebauer-Möller criteria lead us to detect almost all unnecessary obstructions in the non-commutative case. The obstructions are graphically ilustrated. The Buchberger algorithm can be improved within redundant polynomials. This work is a summary and its specification of the results of some known authors engaged in this field. Presented definitions are ilustrated on examples. We perform proves of some of the statements which have been proven differently by other authors. Powered by TCPDF (www.tcpdf.org)
|
|
|
Projective geometry codes
Požárková, Zuzana ; Drápal, Aleš (advisor) ; Holub, Štěpán (referee)
In the presented work we define a class of error-correcting codes based on incidence vectors of projective geometries, including the necessary basis of coding theory and projective geometries. A detailed calculation is performed to show the dimension of these codes. In conclusion we concern ourselves with majority decoding. This work is a summary of the results of some known authors engaged in this field. We continue on some of these results and we present evidence of some of the statements, which have been proven differently by other authors.
|
|
|
Non-commutative Gröbner bases
Požárková, Zuzana ; Šťovíček, Jan (advisor) ; Stanovský, David (referee)
In the presented work we define non-commutative Gröbner bases including the necessary basis of non- commutative algebra theory and notion admissible ordering. We present non-commutative variant of the Buchberger algorithm and study how the algorithm can be improved. Analogous to the Gebauer-Möller criteria lead us to detect almost all unnecessary obstructions in the non-commutative case. The obstructions are graphically ilustrated. The Buchberger algorithm can be improved within redundant polynomials. This work is a summary and its specification of the results of some known authors engaged in this field. Presented definitions are ilustrated on examples. We perform proves of some of the statements which have been proven differently by other authors. Powered by TCPDF (www.tcpdf.org)
|
|
|
Projective geometry codes
Požárková, Zuzana ; Drápal, Aleš (advisor) ; Holub, Štěpán (referee)
In the presented work we define a class of error-correcting codes based on incidence vectors of projective geometries, including the necessary basis of coding theory and projective geometries. A detailed calculation is performed to show the dimension of these codes. In conclusion we concern ourselves with majority decoding. This work is a summary of the results of some known authors engaged in this field. We continue on some of these results and we present evidence of some of the statements, which have been proven differently by other authors.
|
guest ::
