Consolidation for compact constraints and Kendall tau LP decodable permutation codes

DOI10.1007/S10623-016-0313-5MaRDI QIDQ1675286zbMATH OpenOpenAlexFDO

Authors Manabu Hagiwara, Justin Kong

Publication date 27 October 2017

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-016-0313-5

zbMATH Keywords

linear programmingdecodingpermutation groups

Mathematics Subject Classification ID

Linear programming (90C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25) Decoding (94B35)

Recommendations

• Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
• New upper bounds on the size of permutation codes under Kendall \(\tau\)-metric
• LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices
• Semidefinite programming for permutation codes
• On the complete decoding of constrained codes
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• Upper bounds on permutation codes via linear programming
• Partial permutation decoding for simplex codes
• Capacity achieving code constructions for two classes of (d,k) constraints
• Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric

Cites work

• scientific article; zbMATH DE number 51906 (Why is no real title available?)
• scientific article; zbMATH DE number 53657 (Why is no real title available?)
• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 3999824 (Why is no real title available?)
• scientific article; zbMATH DE number 3078983 (Why is no real title available?)
• scientific article; zbMATH DE number 3095897 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A note on certain subpolytopes of the assignment polytope associated with circulant graphs
• A note on compact graphs
• Codes in Permutations and Error Correction for Rank Modulation
• Coding with permutations
• Constructions of Rank Modulation Codes
• Graph isomorphism and theorems of Birkhoff type
• LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices
• Metrics on permutations, a survey
• On the subgroup distance problem.
• Permutation codes for sources
• Rank Modulation for Flash Memories
• Reflection Group Codes and Their Decoding
• Reflection groups and invariant theory

This page was built for publication: Consolidation for compact constraints and Kendall tau LP decodable permutation codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675286)