Reverse-free codes and permutations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10108507" target="_blank" >RIV/00216208:11320/11:10108507 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S1571065311001314" target="_blank" >http://www.sciencedirect.com/science/article/pii/S1571065311001314</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.endm.2011.09.062" target="_blank" >10.1016/j.endm.2011.09.062</a>
Alternative languages
Result language
angličtina
Original language name
Reverse-free codes and permutations
Original language description
Two codewords (a1,...,ak) and (b1,...,bk) form a reverse-free pair if (ai,aj) is not equal to (bj,bi) whenever 1{i,j{k are indices such that ai is not equal to 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 apower 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.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů