| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:KOMBINATORIČNE GRAYEVE KODE
Authors:ID Vidner, Maja (Author)
ID Kovše, Matjaž (Mentor) More about this mentor... New window
Files:.pdf UNI_Vidner_Maja_2011.pdf (1,56 MB)
MD5: 760979A06D72E0C93461BE0F9A7A2716
PID: 20.500.12556/dkum/7350cbe4-3722-49ab-9adc-f44b2c57719d
 
Language:Slovenian
Work type:Undergraduate thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Veliko naprav v elektromehaniki uporablja sistem prikazovanja pozicij z odpiranjem in zapiranjem stikal. Če ta naprava uporablja binarno kodo, so možnosti za napačno branje pozicije bitov in posledično napačen izhod podatka, velike. Ker se binarne besede med seboj razlikujejo za več kot en bit in ker se stikala v napravah ne premikajo sinhrono, bi morale biti spremembe bitov med besedami čim manjše. Tukaj nastopi uporaba Grayeve kode, katere značilnost je sprememba samo enega bita med bitnimi besedami. V prvem delu te naloge je predstavljen binarni številčni sistem, ki je osnova za razvoj in gradnjo Grayevih kod. Nadalje je opisana povezava in pretvarjanje med binarno in Grayevo kodo. V drugem delu je predstavljena definicija Grayevih kod in generiranje le-teh z rekurzivnim algoritmom, poznanim pod imenom binarna reflektirana Grayeva koda. Opisani sta tudi uravnotežena in monotona Grayeva koda, ki predstavljata posebni različici Grayevih kod. Nadalje so predstavljene kombinatorične Grayeve kode za permutacije, kombinacije in particije celih števil. Opisana je tudi bijekcija med nizom particij in funkcijo omejene rasti. V zadnjem delu so predstavljeni praktični primeri, ki so lahko rešeni s pomočjo uporabe različnih Grayevih kod.
Keywords:Binarna koda, bitna beseda, Grayeva koda, uravnotežena Grayeva koda, monotona Grayeva koda, kombinatorična Grayeva koda.
Place of publishing:Maribor
Publisher:[M. Vidner]
Year of publishing:2011
PID:20.500.12556/DKUM-21563 New window
UDC:51(043.2)
COBISS.SI-ID:18845960 New window
NUK URN:URN:SI:UM:DK:XST3UCXX
Publication date in DKUM:04.01.2012
Views:3660
Downloads:212
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:COMBINATORIAL GRAY CODES
Abstract:Many devices in electromechanics use a system of indicating position by closing and opening switches. If those devices use binary codes, the chance for reading spurious positions is increased. Because binary strings differ in more than one bit and switches do not change states exactly in synchrony, the bit changes should be reduced in order for device to give us the right result. At this point Gray code is a perfect solution, considering that Gray code is a binary numeral system, where two successive values differ in only one bit. In this thesis the first part is dedicated to describe binary numeral system which is the base for generating Gray codes. Further on in this work is the description of relation between binary and Gray codes. In the second part is presented the definition of Gray code and generating of the code with recursive algorithm, known as binary reflected Gray code. Further in this part of work there are presented combinatorial Gray codes for permutations, combinations and integer partitions. Also in this part are described balanced Gray codes and their construction. In the last part are presented practical problems, that can be solved using Gray codes.
Keywords:Binary code, bit string, Gray code, balanced Gray code, monotone Gray code, combinatorial Gray code.


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica