|
|
General Codes with m Marks
Holešovský, Jan ; Hrdina, Jaroslav (referee) ; Skula, Ladislav (advisor)
This bachelor's thesis is concerned with results of error-correcting codes theory, which deals with detection and correction of errors, that arise during communication by means of these codes. The aim of this thesis is the explanation of the theory above in absolute generality, followed by detail view of some significant codes. Using linear algebra over finite fields, we will introduce an error-corecting code like a set with structure, whose characters considerably simplify the detection and correction of errors. The knowledge, that was acquired for general codes, is applied to well-known binary codes at the end of the thesis (ie. Hamming codes and Golay code). With these codes are demonstrated their properties, that sort these codes to the most important binary codes.
|
|
|
Samoopravné kódy a rozpoznávání podle duhovky
Luhan, Vojtěch ; Šťovíček, Jan (advisor) ; Drápal, Aleš (referee)
Iris recognition constitutes one of the most powerful method for the iden- tification and authentication of people today. This thesis aims to describe the algorithms used in a sophisticated and mathematically correct way, while re- maining comprehensible. The description of these algorithms is not the only objective of this thesis; the reason they were chosen and potential improvements or substitutions are also discussed. The background of iris recognition, its use in cryptosystems, and the application of error-correcting codes are investigated as well.
|
|
| |
|
| |
|
|
Samoopravné kódy a rozpoznávání podle duhovky
Luhan, Vojtěch ; Šťovíček, Jan (advisor) ; Drápal, Aleš (referee)
Iris recognition constitutes one of the most powerful method for the iden- tification and authentication of people today. This thesis aims to describe the algorithms used by a mathematical apparatus. The description of these algo- rithms is not the only objective of this thesis; the reason they were chosen and potential improvements or substitutions are also discussed. The background of iris recognition, its use in cryptosystems, and the application of error-correcting codes are investigated as well. The second version of the thesis eliminates errata and a quantum of inaccu- racies discovered in the first version, especially in the ROI Definition, the Hough Transform and the Feature Extraction sections. Besides that, it also contains se- veral new propositions. Last, but not least, it shows a potential implementation of the algorithms described by appending pseudocodes to the relevant sections. 1
|
|
|
Samoopravné kódy a rozpoznávání podle duhovky
Luhan, Vojtěch ; Šťovíček, Jan (advisor) ; Drápal, Aleš (referee)
Iris recognition constitutes one of the most powerful method for the iden- tification and authentication of people today. This thesis aims to describe the algorithms used in a sophisticated and mathematically correct way, while re- maining comprehensible. The description of these algorithms is not the only objective of this thesis; the reason they were chosen and potential improvements or substitutions are also discussed. The background of iris recognition, its use in cryptosystems, and the application of error-correcting codes are investigated as well.
|
|
|
General Codes with m Marks
Holešovský, Jan ; Hrdina, Jaroslav (referee) ; Skula, Ladislav (advisor)
This bachelor's thesis is concerned with results of error-correcting codes theory, which deals with detection and correction of errors, that arise during communication by means of these codes. The aim of this thesis is the explanation of the theory above in absolute generality, followed by detail view of some significant codes. Using linear algebra over finite fields, we will introduce an error-corecting code like a set with structure, whose characters considerably simplify the detection and correction of errors. The knowledge, that was acquired for general codes, is applied to well-known binary codes at the end of the thesis (ie. Hamming codes and Golay code). With these codes are demonstrated their properties, that sort these codes to the most important binary codes.
|
guest ::
