Cubes, Codes, and Graphical Designs

Simple item page
dc.contributor.advisorThomas, Rekha
dc.contributor.authorBabecki, Catherine
dc.date.accessioned2022-01-26T23:25:40Z
dc.date.available2022-01-26T23:25:40Z
dc.date.issued2022-01-26
dc.date.submitted2021
dc.descriptionThesis (Master's)--University of Washington, 2021
dc.description.abstractGraphical designs are an extension of spherical designs to functions on graphs. We connect linear codes to graphical designs on cube graphs, and show that the Hamming code in particular is a highly effective graphical design. We show that even in highly structured graphs, graphical designs are distinct from the related concepts of extremal designs, maximum stable sets in distance graphs, and t-designs on association schemes.
dc.embargo.termsOpen Access
dc.format.mimetypeapplication/pdf
dc.identifier.otherBabecki_washington_0250O_23579.pdf
dc.identifier.urihttp://hdl.handle.net/1773/48288
dc.language.isoen_US
dc.rightsCC BY
dc.subject
dc.subjectMathematics
dc.subject.otherMathematics
dc.titleCubes, Codes, and Graphical Designs
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Babecki_washington_0250O_23579.pdf
Size:
1006.37 KB
Format:
Adobe Portable Document Format
Download

Collections

Mathematics