Upper and lower bounds on permutation codes of distance four

Simple item page
dc.contributor.authorSawchuck, Natalie
dc.contributor.supervisorDukes, Peter
dc.date.accessioned2008-12-30T19:39:15Z
dc.date.available2008-12-30T19:39:15Z
dc.date.copyright2008en_US
dc.date.issued2008-12-30T19:39:15Z
dc.degree.departmentDepartment of Mathematics and Statistics
dc.degree.levelMaster of Science M.Sc.en_US
dc.description.abstractA permutation array, represented by PA(n, d), is a subset of Sn such that any two distinct elements have a distance of at least d where d is the number of differing positions. We analyze the upper and lower bounds of permutation codes with distance equal to 4. An optimization problem on Young diagrams is used to improve the upper bound for almost all n while the lower bound is improved for small values of n by means of recursive construction methods.en_US
dc.identifier.urihttp://hdl.handle.net/1828/1315
dc.languageEnglisheng
dc.language.isoenen_US
dc.rightsAvailable to the World Wide Weben_US
dc.subjectDiscrete Mathematicsen_US
dc.subject.lcshUVic Subject Index::Sciences and Engineering::Mathematicsen_US
dc.titleUpper and lower bounds on permutation codes of distance fouren_US
dc.typeThesisen_US

Files

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

Collections

Electronic Theses and Dissertations (ETD)
 
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.