2017年12月
Consolidation for compact constraints and Kendall tau LP decodable permutation codes
DESIGNS CODES AND CRYPTOGRAPHY
- ,
- 巻
- 85
- 号
- 3
- 開始ページ
- 483
- 終了ページ
- 521
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1007/s10623-016-0313-5
- 出版者・発行元
- SPRINGER
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.
- リンク情報
- ID情報
-
- DOI : 10.1007/s10623-016-0313-5
- ISSN : 0925-1022
- eISSN : 1573-7586
- Web of Science ID : WOS:000410457400007