A new approach to cross-bifix-free sets

IEEE Transactions on Information Theory

Volumn 58, Issue 6, 2012, Pages 4058-4063

  Bilotta, Stefano ^a   Pergola, Elisa ^a   Pinzani, Renzo ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Algorithms; binary sequences; combinatorial mathematics

Indexed keywords

BINARY WORDS; CONSTRUCTIVE METHODS;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTER APPLICATIONS; INFORMATION THEORY;

BINARY SEQUENCES;

EID: 84861378573     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2189479     Document Type: Article

References (17)

1. R. H. Barker, "Group synchronizing of binary digital systems," in Communication Theory, W. Jackson, Ed. London, U. K.: Butterworth, 1953, pp. 273-287.
2. J. Lindner, "Binary sequences up to length 40 with best possible autocorrelation function," Electron. Lett., vol. 11, p. 507, 1975.
3. R. A. Scholtz, "Frame synchronization techniques," IEEE Trans. Commun., vol. COM-28, no. 8, pt. 2, pp. 1204-1213, Aug. 1980.
4. A. J. de Lind vanWijngaarden and T. J. Willink, "Frame synchronization using distributed sequences," IEEE Trans. Communun., vol. 48, no. 12, pp. 2127-2138, Dec. 2000.
5. P. T. Nielsen, "On the expected duration of a search for a fixed pattern in random data," IEEE Trans. Inf. Theory, vol. IT-19, no. 5, pp. 702-704, Sep. 1973.
6. D. Bajic and J. Stojanovic, "Distributed sequences and search process," in Proc. IEEE Int. Conf. Commun., Paris, France, Jun. 2004, pp. 514-518.
7. D. Bajic and D. Drajic, "Duration of search for a fixed pattern in random data: Distribution function and variance," Electron. Lett., vol. 31, no. 8, pp. 631-632, 1995.
8. D. Bajic, "On construction of cross-bifix-free kernel sets," presented at the 2nd MCM COST 2100, Lisbon, Portugal, Feb. 2007.
9. D. Shen, W. Zhang, D. P. Reed, and A. B. Lippman, "On frame synchronization for multiple access channels," in Proc. IEEE Int. Conf. Workshop, 2009, pp. 1-5.
10. D. Bajic and C. Stefanovic, "On the search for a sequence from a predefined set of sequences in random and framed data streams," IEEE Trans. Commun., vol. 60, no. 1, pp. 189-197, Jan. 2012.
11. M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings. Cambridge, U. K.: Cambridge Univ. Press, 2007.
12. J. Berstel, D. Perrin, and C. Reutenauer, Codes and Automata (Encyclopedia of Mathematics and its Applications). Cambridge, U. K.: Cambridge Univ. Press, 2009.
13. P. T. Nielsen, "A note on bifix-free sequences," IEEE Trans. Inf. Theory, vol. IT-19, no. 5, pp. 704-706, Sep. 1973.
14. T. Harju and D. Nowotka, "Counting bordered and primitive words with a fixed weight," Theoret. Comput. Sci., vol. 340, pp. 273-279, 2005.
15. N. J. A. Sloane, On-line encyclopedia of integer sequences. 1996. [Online]. Available: http://oeis. org
16. L. Comtet, Advanced Combinatorics: The Art of Finite and Infinite Expansions. Amsterdam, The Netherlands: Reidel, 1974.
17. R. P. Stanley, Enumerative Combinatorics. Cambridge, U. K.: Cambridge Univ. Press, 1999, vol. 2.