-
3
-
-
0141904542
-
Multiple window-sliding search
-
D. Bajić, J. Stojanović, and J. Lindner, "Multiple window-sliding search, " in Proc. Int. Symp. Inf. Theory, Jun./Jul. 2003, p. 249.
-
(2003)
Proc. Int. Symp. Inf. Theory, Jun./Jul.
, pp. 249
-
-
Bajić, D.1
Stojanović, J.2
Lindner, J.3
-
4
-
-
84877126009
-
Avoiding cross-bifix-free binary words
-
S. Bilotta, E. Grazzini, E. Pergola, and R. Pinzani, "Avoiding cross-bifix-free binary words, " Acta Inf., vol. 50, no. 3, pp. 157-173, 2013.
-
(2013)
Acta Inf.
, vol.50
, Issue.3
, pp. 157-173
-
-
Bilotta, S.1
Grazzini, E.2
Pergola, E.3
Pinzani, R.4
-
5
-
-
84861378573
-
A new approach to cross-bifix-free sets
-
Jun.
-
S. Bilotta, E. Pergola, and R. Pinzani, "A new approach to cross-bifix-free sets, " IEEE Trans. Inf. Theory, vol. 58, no. 6, pp. 4058-4063, Jun. 2012.
-
(2012)
IEEE Trans. Inf. Theory
, vol.58
, Issue.6
, pp. 4058-4063
-
-
Bilotta, S.1
Pergola, E.2
Pinzani, R.3
-
6
-
-
84897679135
-
Cross-bifix-free codes within a constant factor of optimality
-
Jul.
-
Y. M. Chee, H. M. Kiah, P. Purkayastha, and C. Wang, "Cross-bifix-free codes within a constant factor of optimality, " IEEE Trans. Inf. Theory, vol. 59, no. 7, pp. 4668-4674, Jul. 2013.
-
(2013)
IEEE Trans. Inf. Theory
, vol.59
, Issue.7
, pp. 4668-4674
-
-
Chee, Y.M.1
Kiah, H.M.2
Purkayastha, P.3
Wang, C.4
-
8
-
-
0001020798
-
Synchronization of binary messages
-
Sep.
-
E. N. Gilbert, "Synchronization of binary messages, " IRE Trans. Inf. Theory, vol. 6, no. 4, pp. 470-477, Sep. 1960.
-
(1960)
IRE Trans. Inf. Theory
, vol.6
, Issue.4
, pp. 470-477
-
-
Gilbert, E.N.1
-
9
-
-
0018006616
-
Maximal Prefix-Synchronized Codes
-
L. T. Guibas and A. M. Odlyzko, "Maximal Prefix-Synchronized Codes, " SIAM J. Appl. Math., vol. 35, no. 2, pp. 401-418, 1978.
-
(1978)
SIAM J. Appl. Math.
, vol.35
, Issue.2
, pp. 401-418
-
-
Guibas, L.T.1
Odlyzko, A.M.2
-
10
-
-
0008874902
-
Decoding automata which are invariant with respect to their initial state
-
(in Russian)
-
V. I. Levenshtein, "Decoding automata which are invariant with respect to their initial state, " (in Russian), Problems Cybern., vol. 12, pp. 125-136, 1964.
-
(1964)
Problems Cybern.
, vol.12
, pp. 125-136
-
-
Levenshtein, V.I.1
-
11
-
-
84888077355
-
Maximum number of words in codes without overlaps
-
V. I. Levenshtein, "Maximum number of words in codes without overlaps, " Problems Inf. Transmiss., vol. 6, no. 4, pp. 355-357, 1970.
-
(1970)
Problems Inf. Transmiss.
, vol.6
, Issue.4
, pp. 355-357
-
-
Levenshtein, V.I.1
-
12
-
-
2342522779
-
Combinatorial problems motivated by comma-free codes
-
V. I. Levenshtein, "Combinatorial problems motivated by comma-free codes, " J. Combinat. Designs, vol. 12, no. 3, pp. 184-196, 2004.
-
(2004)
J. Combinat. Designs
, vol.12
, Issue.3
, pp. 184-196
-
-
Levenshtein, V.I.1
-
13
-
-
0034486692
-
Frame synchronization using distributed sequences
-
Dec.
-
A. J. de Lind van Wijngaarden and T. J. Willink, "Frame synchronization using distributed sequences, " IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 2127-2138, Dec. 2000.
-
(2000)
IEEE Trans. Inf. Theory
, vol.48
, Issue.12
, pp. 2127-2138
-
-
Wijngaarden Van Lind De, A.J.1
Willink, T.J.2
|