Perfect permutation codes with the Kendall's τ-metric

@article{Buzaglo2014PerfectPC,
  title={Perfect permutation codes with the Kendall's τ-metric},
  author={Sarit Buzaglo and Tuvi Etzion},
  journal={2014 IEEE International Symposium on Information Theory},
  year={2014},
  pages={2391-2395}
}
The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in the set of all permutations on n elements, Sn, using the Kendall's τ-metric. We prove that there are no perfect single-error-correcting codes in Sn, where n > 4 is a prime or 4 ≤ n ≤ 10. We also prove that if such a code exists for n which is not a prime then… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 35 references

and L

R. Ahlswede, H. K. Aydinian
H. Khachatrian, “On pe rfect codes and related concepts,” Designs, Codes Crypto., vol. 22, pp. 221–237 • 2001
View 4 Excerpts
Highly Influenced

An algebraic approach to association sch emes of coding theory”,Philips

Ph. Delsarte
J. Res., • 1973
View 3 Excerpts
Highly Influenced

Computing the ball size of frequency permutations under chebyshev distance

2011 IEEE International Symposium on Information Theory Proceedings • 2011
View 1 Excerpt

Product Constructions for Perfect Lee Codes

IEEE Transactions on Information Theory • 2011
View 1 Excerpt

Similar Papers

Loading similar papers…