Back to results
Missouri State University
Developments in Nonlinear Codes and Distance Preserving Maps
Abstract
dc:description.abstractLinear 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science in Mathematics
- Level thesis:degree_level
- Masters
- Discipline thesis:degree_discipline
- Mathematics
- Year
- 2002
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Elliott, John
- Contributors dc:contributor
-
- Cameron Wickham
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- © John Elliott
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://bearworks.missouristate.edu/theses/856
- OAI identifier oai:identifier
- oai:bearworks.missouristate.edu:theses-1857