Ulam Ball Size Analysis for Permutation and Multipermutation Codes Correcting Translocation Errors

DOI10.1109/TIT.2019.2938987MaRDI QIDQ5211541zbMATH OpenFDO

Authors Justin Kong

Publication date 28 January 2020

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

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

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65)

Abstract: Permutation and multipermutation codes in the Ulam metric have been suggested for use in non-volatile memory storage systems such as flash memory devices. In this paper we introduce a new method to calculate permutation sphere sizes in the Ulam metric using Young Tableaux and prove the non-existence of non-trivial perfect permutation codes in the Ulam metric. We then extend the study to multipermutations, providing tight upper and lower bounds on multipermutation Ulam sphere sizes and resulting upper and lower bounds on the maximal size of multipermutation codes in the Ulam metric.

This page was built for publication: Ulam Ball Size Analysis for Permutation and Multipermutation Codes Correcting Translocation Errors

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