Applications of graph theory to error correcting codes

dc.contributor	Graduate Program in Mathematics.
dc.contributor.advisor	Oral, Haluk.
dc.contributor.author	İmamoğlu, Yeşim.
dc.date.accessioned	2023-03-16T11:21:36Z
dc.date.available	2023-03-16T11:21:36Z
dc.date.issued	2001.
dc.identifier.other	MATH 2001 I43
dc.identifier.uri	http://digitalarchive.boun.edu.tr/handle/123456789/15251
dc.description.abstract	Graph Theory has applications in many different fields, especially in combinatorics. In this study, we investigate the methods developed for obtaining error-correcting codes using graphs. First, the codes obtained from cycle and cut-set spaces of a graph are considered. After constructing the codes and giving the decoding schemes, methods for increasing the dimensions of these codes are examined. Then decoding schemes for these new codes are given. Next, a method for obtaining self-dual codes using cubic planar bipartite graphs is examined. The last method covered is to obtain perfect one error-correcting codes using some graphs that are constructed from the Tower of Hanoi Puzzle.
dc.format.extent	30 cm.
dc.publisher	Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2001.
dc.relation	Includes appendices.
dc.relation	Includes appendices.
dc.subject.lcsh	Graph theory.
dc.subject.lcsh	Error-correcting codes (Information theory)
dc.title	Applications of graph theory to error correcting codes
dc.format.pages	ix, 43 leaves ;