A 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.
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:BVIV.ry.uvic.ca#1828/1315 |
| Date | 30 December 2008 |
| Creators | Sawchuck, Natalie |
| Contributors | Dukes, Peter |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Rights | Available to the World Wide Web |
Page generated in 0.002 seconds