{"id":{"repo_id":"mo-state","oai_identifier":"oai:bearworks.missouristate.edu:theses-1857"},"canonical_url":"https://search.dev.ndltd.org/etd/mo-state/oai:bearworks.missouristate.edu:theses-1857","repository":{"repo_id":"mo-state","name":"Missouri State University","base_url":"https://bearworks.missouristate.edu/do/oai/"},"display":{"title":"Developments in Nonlinear Codes and Distance Preserving Maps","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Elliott, John"],"institution":null,"degree_name":"Master of Science in Mathematics","degree_level":"Masters","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Cameron Wickham"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2002,"date_issued":"2002-07-01T07:00:00Z","date_published":"2002-07-01T07:00:00Z","updated_at":"2026-07-24T03:15:54Z","subjects":["Mathematics"],"languages":[],"rights":["© John Elliott"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://bearworks.missouristate.edu/theses/856","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Cameron Wickham"]},{"key":"dc:creator","label":"Author","values":["Elliott, John"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["© John Elliott"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://bearworks.missouristate.edu/theses/856"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Developments in Nonlinear Codes and Distance Preserving Maps"]}]}],"canonical_facts":{"dc:contributor":["Cameron Wickham"],"dc:creator":["Elliott, John"],"dc:description.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."],"dc:identifier":["https://bearworks.missouristate.edu/theses/856"],"dc:rights":["© John Elliott"],"dc:subject":["Mathematics"],"dc:title":["Developments in Nonlinear Codes and Distance Preserving Maps"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Masters"],"thesis:degree_name":["Master of Science in Mathematics"]},"updated_at":"2026-07-24T03:15:54Z"}