Consolidation for compact constraints and Kendall tau LP decodable permutation codes

Article

DOI: 10.1007/s10623-016-0313-5

Cite this article as:
Hagiwara, M. & Kong, J. Des. Codes Cryptogr. (2016). doi:10.1007/s10623-016-0313-5

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.

Keywords

Coding and information theory Graphs and abstract algebra Linear programming Permutation groups Decoding 

Mathematics Subject Classification

68P30 05C25 90C05 20B 94B35 

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Mathematics and InformaticsChiba UniversityChiba CityJapan

Personalised recommendations