Thesis Title

Developments in Nonlinear Codes and Distance Preserving Maps

Author

John Elliott

Date of Graduation

Summer 2002

Degree

Master of Science in Mathematics

Department

Mathematics

Committee Chair

Cameron Wickham

Subject Categories

Mathematics

Abstract

Linear codes are generally easier to construct and correct errors than nonlinear codes. However, for some parameters nonlinear binary codes are more efficient than any linear binary code. Some of these codes can be constructed as linear codes in higher powers of two and then converted to binary codes by a distance preserving map. The purpose of this paper is to analyze the properties and necessary conditions of distance preserving maps in order to construct the most efficient maps.

Copyright

© John Elliott

Citation-only

Dissertation/Thesis

Share

COinS