Abstract
dc:description.abstractCodes and technology are part of our daily lives and allow the modern world to function, and for us to have conveniences in our lives such as smartphones that can be used to privately call people on the other side of the planet, and for secure access to the internet. In this thesis we will explore the construction of binary codes created by vertex-edge incidence matrices of planar graphs. The Hamming (7,4) code was an incredible code that allowed the detection and correction of errors after receiving them through a transmission. We will explore the possibility of the creation of generator matrices that can detect and possibly correct errors that occur due to interference caused between the message being sent and it being received. Here, we will provide a proof for tree and cycle graphs, as well as a basis for other graphs and future work.
Degree
thesis:*- Name thesis:degree_name
- Master of Arts in Mathematics
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Mathematics
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Avalos, Joshua
- Contributors dc:contributor
-
- Kim, Youngsu
Subjects
dc:subject × 5Identifiers
dc:identifier.*- Repository record dc:identifier
- https://scholarworks.lib.csusb.edu/etd/2239