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

12/11/2017
by   Justin Kong, et al.
0

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.

READ FULL TEXT
research
11/03/2020

Nonexistence of perfect permutation codes under the Kendall τ-metric

In the rank modulation scheme for flash memories, permutation codes have...
research
12/19/2022

Bounds on Mixed Codes with Finite Alphabets

Mixed codes, which are error-correcting codes in the Cartesian product o...
research
01/25/2019

New Lower Bounds for Permutation Codes using Linear Block Codes

In this paper we prove new lower bounds for the maximal size of permutat...
research
01/21/2019

New Bounds on the Field Size for Maximally Recoverable Codes Instantiating Grid-like Topologies

In recent years, the rapidly increasing amounts of data created and proc...
research
03/04/2019

Asymmetric Single Magnitude Four Error Correcting Codes

Limited magnitude asymmetric error model is well suited for flash memory...
research
03/12/2018

Theoretical Bounds and Constructions of Codes in the Generalized Cayley Metric

Permutation codes have recently garnered substantial research interest d...
research
02/24/2023

Improved Bounds for Permutation Arrays Under Chebyshev Distance

Permutation arrays under the Chebyshev metric have been considered for e...

Please sign up or login with your details

Forgot password? Click here to reset