An Array of Disjoint Maximal Constant Weight Codes

Authors

Christine Berkesch, Butler UniversityFollow

Abstract

We show that when gcd(n,w) = 1, the set of binary words of length n and weight w can be partitioned to give n maximal w-weight codes. It follows that under the same hypothesis, the least cardinal of a maximal constant weight code is at most 1/n times n choose w.

Author Bio

Christine is currently in her senior year at Butler University. This research was done during the summer and fall of 2003 as a part of the Butler Summer Institute and work towards a senior honors thesis under the direction of Dr. Prem Sharma. Next year she will be entering graduate school in mathematics in order to become a college professor. Her academic interest is in algebra, while she also enjoys music.

Faculty Sponsor

Prem L Sharma

Recommended Citation

Berkesch, Christine (2004) "An Array of Disjoint Maximal Constant Weight Codes," Rose-Hulman Undergraduate Mathematics Journal: Vol. 5: Iss. 1, Article 1.
Available at: https://scholar.rose-hulman.edu/rhumj/vol5/iss1/1