Developments in Nonlinear Codes and Distance Preserving Maps
Date of Graduation
Summer 2002
Degree
Master of Science in Mathematics
Department
Mathematics
Committee Chair
Cameron Wickham
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.
Subject Categories
Mathematics
Copyright
© John Elliott
Recommended Citation
Elliott, John, "Developments in Nonlinear Codes and Distance Preserving Maps" (2002). MSU Graduate Theses/Dissertations. 856.
https://bearworks.missouristate.edu/theses/856
Dissertation/Thesis
