Counting Codes via the Container Method

Simple item page
dc.contributor.authorPenney, Amy
dc.date.accessioned2024-03-17T04:09:06Z
dc.date.available2024-03-17T04:09:06Z
dc.date.issued2024
dc.description.abstractThe container method is a technique used to upper bound the number of independent sets in a graph. The technique originated from Kleitman and Winston, and Sapozheko. It was developed in full generality and extended to hypergraphs independently by Saxton and Thomason, and Balogh, Morris and Samotij. This technique has been used by Balogh, Treglown and Wagner to prove an upper bound on the number of t error correcting codes, as well as a bound on the number of r-(n,k,d) codes when r=2. The goal of this project is to extend these results to upper bound the number of r-(n,k,d) codes for general r.
dc.description.reviewstatusReviewed
dc.description.scholarlevelUndergraduate
dc.description.sponsorshipJamie Cassels Undergraduate Research Awards (JCURA)
dc.identifier.urihttps://hdl.handle.net/1828/16204
dc.language.isoen
dc.publisherUniversity of Victoria
dc.subjectContainer Method
dc.subjectr-(n,k,d) Codes
dc.subjectError Correcting Codes
dc.titleCounting Codes via the Container Method
dc.typePoster

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Amy_Penney-JCURAposter-2024.pdf
Size:
902.59 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Jamie Cassels Undergraduate Research Awards (JCURA)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.