Reverse-free codes and permutations

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Two codewords (a1,..., ak) and (b1,..., bk) form a reverse-free pair if (ai, aj)≠(bj, bi) holds whenever 1≤i<j≤k are indices such that ai≠aj. In a reverse-free code, each pair of codewords is reverse-free. The maximum size of a reverse-free code with codewords of length k and an n-element alphabet is denoted by F (n,k). Let F(n, k) denote the maximum size of a reverse-free code with all codewords consisting of distinct entries.We determine F (n,3) and F (n,3) exactly whenever n is a power of 3, and asymptotically for other values of n. We prove non-trivial bounds for F(n, k) and F (n,k) for general k and for other related functions as well. Using VC-dimension of a matrix, we determine the order of magnitude of F (n,k) for n fixed and k tending to infinity. © 2011 Elsevier B.V.

Cite

CITATION STYLE

APA

Füredi, Z., Kantor, I., Monti, A., & Sinaimeri, B. (2011). Reverse-free codes and permutations. Electronic Notes in Discrete Mathematics, 38, 383–387. https://doi.org/10.1016/j.endm.2011.09.062

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free