LP-Decodable Multipermutation Codes

DOI10.1109/TIT.2016.2526655MaRDI QIDQ2976885zbMATH OpenFDO

Authors Xishuo Liu, Stark C. Draper

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.7408

Mathematics Subject Classification ID

Decoding (94B35)

Abstract: In this paper, we introduce a new way of constructing and decoding multipermutation codes. Multipermutations are permutations of a multiset that may consist of duplicate entries. We first introduce a new class of matrices called multipermutation matrices. We characterize the convex hull of multipermutation matrices. Based on this characterization, we propose a new class of codes that we term LP-decodable multipermutation codes. Then, we derive two LP decoding algorithms. We first formulate an LP decoding problem for memoryless channels. We then derive an LP algorithm that minimizes the Chebyshev distance. Finally, we show a numerical example of our algorithm.

Cited in

(1)

• Permutation codes for the Laplacian source (Corresp.)

This page was built for publication: LP-Decodable Multipermutation Codes

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