69 citations to 10.1016/S0019-9958(79)90076-7 (Crossref Cited-By Service)
  1. Khmaies Ouahada, Theo G. Swart, Hendrik C. Ferreira, Ling Cheng, “Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes”, Des. Codes Cryptogr., 48, no. 2, 2008, 141  crossref
  2. Moshe Schwartz, 2010 IEEE International Symposium on Information Theory, 2010, 869  crossref
  3. Moshe Schwartz, Pascal O. Vontobel, “Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric”, IEEE Trans. Inform. Theory, 63, no. 10, 2017, 6227  crossref
  4. Alexander Barg, Arya Mazumdar, “Codes in Permutations and Error Correction for Rank Modulation”, IEEE Trans. Inform. Theory, 56, no. 7, 2010, 3158  crossref
  5. Patrick Solé, “The covering radius of permutation designs”, J Algebr Comb, 57, no. 1, 2023, 305  crossref
  6. Peter J. Cameron, “Permutation codes”, European Journal of Combinatorics, 31, no. 2, 2010, 482  crossref
  7. Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic, 2012 IEEE International Symposium on Information Theory Proceedings, 2012, 2988  crossref
  8. Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, I. H. Sudborough, “New lower bounds for permutation arrays using contraction”, Des. Codes Cryptogr., 87, no. 9, 2019, 2105  crossref
  9. Faruk Gologlu, Juri Lember, Ago-Erik Riet, Vitaly Skachek, 2015 IEEE International Symposium on Information Theory (ISIT), 2015, 1726  crossref
  10. Anxiao Jiang, Moshe Schwartz, Jehoshua Bruck, “Correcting Charge-Constrained Errors in the Rank-Modulation Scheme”, IEEE Trans. Inform. Theory, 56, no. 5, 2010, 2112  crossref
Previous
1
2
3
4
5
6
7
Next