4 research outputs found

    Systematic Codes for Rank Modulation

    Get PDF
    The goal of this paper is to construct systematic error-correcting codes for permutations and multi-permutations in the Kendall's Ï„\tau-metric. These codes are important in new applications such as rank modulation for flash memories. The construction is based on error-correcting codes for multi-permutations and a partition of the set of permutations into error-correcting codes. For a given large enough number of information symbols kk, and for any integer tt, we present a construction for (k+r,k){(k+r,k)} systematic tt-error-correcting codes, for permutations from Sk+rS_{k+r}, with less redundancy symbols than the number of redundancy symbols in the codes of the known constructions. In particular, for a given tt and for sufficiently large kk we can obtain r=t+1r=t+1. The same construction is also applied to obtain related systematic error-correcting codes for multi-permutations.Comment: to be presented ISIT201

    Multipermutation Codes in the Ulam Metric for Nonvolatile Memories

    Get PDF
    We address the problem of multipermutation code design in the Ulam metric for novel storage applications. Multipermutation codes are suitable for flash memory where cell charges may share the same rank. Changes in the charges of cells manifest themselves as errors whose effects on the retrieved signal may be measured via the Ulam distance. As part of our analysis, we study multipermutation codes in the Hamming metric, known as constant composition codes. We then present bounds on the size of multipermutation codes and their capacity, for both the Ulam and the Hamming metrics. Finally, we present constructions and accompanying decoders for multipermutation codes in the Ulam metric

    Combinatorial channels from partially ordered sets

    Get PDF
    A central task of coding theory is the design of schemes to reliably transmit data though space, via communication systems, or through time, via storage systems. Our goal is to identify and exploit structural properties common to a wide variety of coding problems, classical and modern, using the framework of partially ordered sets. We represent adversarial error models as combinatorial channels, form combinatorial channels from posets, identify a structural property of posets that leads to families of channels with the same codes, and bound the size of codes by optimizing over a family of equivalent channels. A large number of previously studied coding problems that fit into this framework. This leads to a new upper bound on the size of s-deletion correcting codes. We use a linear programming framework to obtain sphere-packing upper bounds when there is little underlying symmetry in the coding problem. Finally, we introduce and investigate a strong notion of poset homomorphism: locally bijective cover preserving maps. We look for maps of this type to and from the subsequence partial order on q-ary strings
    corecore