LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices
From MaRDI portal
Publication:2989854
DOI10.1109/TIT.2012.2196253zbMath1364.94687arXiv1011.6441OpenAlexW2089933274MaRDI QIDQ2989854
Manabu Hagiwara, Tadashi Wadayama
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.6441
Related Items (2)
Consolidation for compact constraints and Kendall tau LP decodable permutation codes ⋮ Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD
This page was built for publication: LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices