## A characterization of the circularity of certain balanced incomplete block designs.

dc.contributor.advisor | Clay, James R. | en_US |

dc.contributor.author | Modisett, Matthew Clayton. | |

dc.creator | Modisett, Matthew Clayton. | en_US |

dc.date.accessioned | 2011-10-31T17:07:06Z | |

dc.date.available | 2011-10-31T17:07:06Z | |

dc.date.issued | 1988 | en_US |

dc.identifier.uri | http://hdl.handle.net/10150/184393 | |

dc.description.abstract | When defining a structure to fulfill a set of axioms that are similar to those prescribed by Euclid, one must select a set of points and then define what is meant by a line and what is meant by a circle. When properly defined these labels will have properties which are similar to their counterparts in the (complex) plane, the lines and circles which Euclid undoubtedly had in mind. In this manner, the geometer may employ his intuition from the complex plane to prove theorems about other systems. Most "finite geometries" have clearly defined notions of points and lines but fail to define circles. The two notable exceptions are the circles in a finite affine plane and the circles in a Mobius plane. Using the geometry of Euclid as motivation, we strive to develop structures with both lines and circles. The only successful example other than the complex plane is the affine plane over a finite field, where all of Euclid's geometry holds except for any assertions involving order or continuity. To complement the prolific work concerning finite geometries and their lines, we provide a general definition of a circle, or more correctly, of a collection of circles and present some preliminary results concerning the construction of such structures. Our definition includes the circles of an affine plane over a finite field and the circles in a Mobius plane as special cases. We develop a necessary and sufficient condition for circularity, present computational techniques for determining circularity and give varying constructions. We devote a chapter to the use of circular designs in coding theory. It is proven that these structures are not useful in the theory of error-correcting codes, since more efficient codes are known, for example the Reed-Muller codes. However, the theory developed in the earlier chapters does have applications to Cryptology. We present five encryption methods utilizing circular structures. | |

dc.language.iso | en | en_US |

dc.publisher | The University of Arizona. | en_US |

dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |

dc.subject | Incomplete block designs. | en_US |

dc.subject | Combinatorial designs and configurations. | en_US |

dc.subject | Circle. | en_US |

dc.title | A characterization of the circularity of certain balanced incomplete block designs. | en_US |

dc.type | text | en_US |

dc.type | Dissertation-Reproduction (electronic) | en_US |

dc.identifier.oclc | 701246006 | en_US |

thesis.degree.grantor | University of Arizona | en_US |

thesis.degree.level | doctoral | en_US |

dc.contributor.committeemember | Benson, Clark | en_US |

dc.contributor.committeemember | Brillhart, John | en_US |

dc.contributor.committeemember | Gay, David | en_US |

dc.contributor.committeemember | Greenlee, W. M. | en_US |

dc.identifier.proquest | 8814261 | en_US |

thesis.degree.discipline | Mathematics | en_US |

thesis.degree.discipline | Graduate College | en_US |

thesis.degree.name | Ph.D. | en_US |

refterms.dateFOA | 2018-08-22T18:22:16Z | |

html.description.abstract | When defining a structure to fulfill a set of axioms that are similar to those prescribed by Euclid, one must select a set of points and then define what is meant by a line and what is meant by a circle. When properly defined these labels will have properties which are similar to their counterparts in the (complex) plane, the lines and circles which Euclid undoubtedly had in mind. In this manner, the geometer may employ his intuition from the complex plane to prove theorems about other systems. Most "finite geometries" have clearly defined notions of points and lines but fail to define circles. The two notable exceptions are the circles in a finite affine plane and the circles in a Mobius plane. Using the geometry of Euclid as motivation, we strive to develop structures with both lines and circles. The only successful example other than the complex plane is the affine plane over a finite field, where all of Euclid's geometry holds except for any assertions involving order or continuity. To complement the prolific work concerning finite geometries and their lines, we provide a general definition of a circle, or more correctly, of a collection of circles and present some preliminary results concerning the construction of such structures. Our definition includes the circles of an affine plane over a finite field and the circles in a Mobius plane as special cases. We develop a necessary and sufficient condition for circularity, present computational techniques for determining circularity and give varying constructions. We devote a chapter to the use of circular designs in coding theory. It is proven that these structures are not useful in the theory of error-correcting codes, since more efficient codes are known, for example the Reed-Muller codes. However, the theory developed in the earlier chapters does have applications to Cryptology. We present five encryption methods utilizing circular structures. |

### Files in this item

**Name:**

**Size:**

**Format:**

**Description:**