Please use this identifier to cite or link to this item:
Extending lp--decoding for permutation codes from euclidean to Kendall tau metric
|Title:||Extending lp--decoding for permutation codes from euclidean to Kendall tau metric|
|Contributors:||Craven, Thomas (advisor)|
|Publisher:||University of Hawaii at Manoa|
|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|
|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.|
|Appears in Collections:||
M.A. Plan B Theses- Mathematics Department|
Please email email@example.com if you need this content in ADA-compliant format.
Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.