Abstract
Error-correcting codes on permutations and multi-permutations have recently attracted much attention for their applications in flash memories through rank modulation. We propose a new rank demodulation method to transform the problem of a single burst unstable erasure (BUE) in a $t$ -balanced multi-permutation into the sub-problems of a single permutation-invariant erasure (PIE) in $t$ permutations. Based on the rank demodulation method, we propose two classes of $t$ -balanced multi-permutation codes to correct a single BUE of length up to $t$ by interleaving $t$ single-PIE-correcting permutation codes. The decoding methods for the proposed codes are included in the proofs and demonstrated by examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
