Reverse-free codes and permutations

  • Füredi Z
  • Kantor I
  • Monti A
 et al. 
  • 5


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


Two codewords (a1,..., ak) and (b1,..., bk) form a reverse-free pair if (ai, aj)≠(bj, bi) holds whenever 1≤i

Author-supplied keywords

  • Codes
  • Extremal combinatorics
  • Permutations
  • Reverse-free

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free