Extending lp--decoding for permutation codes from euclidean to Kendall tau metric

Date
2012
Authors
Kong, Justin
Contributor
Advisor
Craven, Thomas
Department
Instructor
Depositor
Speaker
Researcher
Consultant
Interviewer
Annotator
Journal Title
Journal ISSN
Volume Title
Publisher
University of Hawaii at Manoa
Volume
Number/Issue
Starting Page
Ending Page
Alternative Title
Abstract
Invented in the 1960’s, permutation codes have reemerged in recent years as a topic of great interest because of properties making them attractive for certain modern technological applications. In 2011 a decoding method called LP (linear programming) decoding was introduced for a class of permutation codes with a Euclidean distance induced metric. In this paper we comparatively analyze the Euclidean and Kendall tau metrics, ultimately providing conditions and examples for which LP-decoding methods can be extended to permutation codes with the Kendall tau metric. This is significant since contemporary research in permutation codes and their promising applications has incorporated the Kendall tau metric.
Description
Plan B paper, M.A., Mathematics, University of Hawaii at Manoa, 2012
Keywords
Citation
Extent
32 pages
Format
Geographic Location
Time Period
Related To
Table of Contents
Rights
All UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.
Rights Holder
Local Contexts
Email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.