Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.endm.2011.09.062 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
extremal combinatorics,permutations,codes,reverse-free | Discrete mathematics,Combinatorics,Matrix (mathematics),Permutation,Infinity,Extremal combinatorics,Order of magnitude,Mathematics,Alphabet | Journal |
Volume | ISSN | Citations |
38 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zoltán Füredi | 1 | 1237 | 233.60 |
| Ida Kantor | 2 | 6 | 2.76 |
| Angelo Monti | 3 | 671 | 46.93 |
| B. Sinaimeri | 4 | 47 | 11.75 |