Skip to main content
main-content

Tipp

Weitere Artikel dieser Ausgabe durch Wischen aufrufen

21.12.2016 | Ausgabe 3/2017

Designs, Codes and Cryptography 3/2017

Consolidation for compact constraints and Kendall tau LP decodable permutation codes

Zeitschrift:
Designs, Codes and Cryptography > Ausgabe 3/2017
Autoren:
Manabu Hagiwara, Justin Kong
Wichtige Hinweise
Communicated by P. Charpin.

Abstract

Invented in the 1960s, permutation codes have reemerged in recent years as a topic of great interest because of properties making them attractive for certain modern technological applications, especially flash memory. In 2011 a polynomial time algorithm called linear programming (LP) decoding was introduced for a class of permutation codes where the feasible set of codewords was a subset of the vertex set of a code polytope. In this paper we investigate a new class of linear constraints for matrix polytopes with no fractional vertices through a new concept called “consolidation.” We then introduce a necessary and sufficient condition for which LP decoding methods, originally designed for the Euclidean metric, may be extended to provide an efficient decoding algorithm for permutation codes with the Kendall tau metric.

Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten

Literatur
Über diesen Artikel

Weitere Artikel der Ausgabe 3/2017

Designs, Codes and Cryptography 3/2017 Zur Ausgabe

Premium Partner

    Bildnachweise