Heaps for error correction and the geometry of non-linear loop-transversal codes
dc.contributor.advisor | Smith, Jonathan D.H. | |
dc.contributor.advisor | Gelaki, Shlomo | |
dc.contributor.advisor | Iverson, Joey | |
dc.contributor.author | Bentz, Channing J | |
dc.contributor.department | Mathematics | en_US |
dc.date.accessioned | 2025-06-25T22:40:40Z | |
dc.date.available | 2025-06-25T22:40:40Z | |
dc.date.issued | 2025-05 | |
dc.date.updated | 2025-06-25T22:40:41Z | |
dc.description.abstract | This thesis builds on the paper Linear and Nonlinear Loop-Transversal Codes in Error Correction and Graph Domination of Dagli et al. The goal is to establish a more general framework for error correcting codes and the loop-transversal code construction. We examine the specific example studied by Dagli et al. within this more general framework, with specific interest in the geometry of the structure. The intention of the work is to open the door to a deeper understanding of the connections between these loop-transversal codes and the coding scheme as a whole. | |
dc.format.mimetype | ||
dc.identifier.orcid | 0000-0002-5982-1300 | |
dc.identifier.uri | https://dr.lib.iastate.edu/handle/20.500.12876/jrl86ROr | |
dc.language.iso | en | |
dc.language.rfc3066 | en | |
dc.subject.disciplines | Mathematics | en_US |
dc.subject.keywords | Error Correction | en_US |
dc.title | Heaps for error correction and the geometry of non-linear loop-transversal codes | |
dc.type | article | en_US |
dc.type.genre | thesis | en_US |
dspace.entity.type | Publication | |
thesis.degree.discipline | Mathematics | en_US |
thesis.degree.grantor | Iowa State University | en_US |
thesis.degree.level | thesis | $ |
thesis.degree.name | Master of Science | en_US |
File
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- Bentz_iastate_0097M_22182.pdf
- Size:
- 1.46 MB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 0 B
- Format:
- Item-specific license agreed upon to submission
- Description: