Ulam Ball Size Analysis for Permutation and Multipermutation Codes Correcting Translocation Errors
From MaRDI portal
Publication:5211541
DOI10.1109/TIT.2019.2938987zbMATH Open1433.94146arXiv1712.03639MaRDI QIDQ5211541FDOQ5211541
Authors: Justin Kong 
Publication date: 28 January 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1712.03639
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)
