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

Simple item page
dc.contributor.advisorCraven, Thomas
dc.contributor.authorKong, Justin
dc.date.accessioned2013-02-06T20:14:01Z
dc.date.available2013-02-06T20:14:01Z
dc.date.issued2012
dc.descriptionPlan B paper, M.A., Mathematics, University of Hawaii at Manoa, 2012
dc.description.abstractInvented 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.
dc.format.extent32 pages
dc.identifier.urihttp://hdl.handle.net/10125/25930
dc.languageen-US
dc.publisherUniversity of Hawaii at Manoa
dc.rightsAll 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.
dc.titleExtending lp--decoding for permutation codes from euclidean to Kendall tau metric
dc.typeMaster's project
dc.type.dcmiText
local.thesis.degreelevelMasters
local.thesis.departmentMathematics
local.thesis.mastertypePlan B

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
MA_2012_Kong.pdf
Size:
324.21 KB
Format:
Adobe Portable Document Format
Download

Collections

M.A. Plan B Theses- Mathematics Department