On optimization of frame lengths and frame delimiting patterns for data communications using bifix approach

EUROCON 2005 - The International Conference on Computer as a Tool

Volumn I, Issue , 2005, Pages 632-635

  Stefanovic, Cedomir ^a,b   Bajic, Dragana ^a  

^a IEEE   (Serbia)

^b UNIVERSITY OF NOVI SAD   (Serbia)

Author keywords

Bifix; Bit stuffing; Flag; Frame; Frame delimitation; Pattern search

Indexed keywords

DATA TRANSFER; PROBABILITY; TELECOMMUNICATION LINKS;

BIFIX; BIT-STUFFING; FLAG; FRAME DELIMITATION; PATTERN SEARCH;

DATA COMMUNICATION SYSTEMS;

EID: 33847793961     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/eurcon.2005.1630009     Document Type: Conference Paper

References (5)

1. W. Stallings, Data and Computer Communications, Upper Saddle River, New Jersey, 1599, pp. 214 215
2. P.T. Nielsen "On the Expected Duration of the Search for a fixed pattern in random data Book", IEEE Trans. Inform. Theory, vol IT-19, pp. 702-704, September 1973.
3. D. Bajic, Cedomir Stefanovic and Dejan Vukobratovic, "Search Process and Probabilistic Bifix Approach", to be presented at ISIT 2005, Adelaide, Australia, September 4-9, 2005.
4. T. McConnell: "The Expected Time to Find a String in a Random Binary Sequence" [http://barnyard.syr.edu/cover.pdf], January 2001.
5. D. Bajic, D. Drajic: "Duration of search for a fixed pattern in random data: Distribution function and variance", Electronics Letters, 1995, Vol. 31. No. 8, pp 631-632.