BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Lancaster University Faculty of Science and Technology//NONSGML v1.0//EN
BEGIN:VTIMEZONE
TZID:/Europe/London
X-LIC-LOCATION:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=3
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=10
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:429
SUMMARY:Codes with parent identifying property and digital fingerprinting codes: what is in between?
DESCRIPTION:In this talk we prove initial results on the proportion of "mutated" coordinates that can be tolerated under the IPP property. The talk is based on a joint work with A. Barg, G.R. Blakley and C. Tavernier.\n\nAn n-word y over a finite alphabet is called a descendant of a set U of t words (called "parents") if each coordinate of y coincides with the same coordinate of at least one of these t words. A code C is said to have the t-identifying parent property (t-IPP) if for any word y that is a descendant of at most t parents belonging to the code it is possible to identify at least one of them. The existence of good t-i.p.p. codes is known from earlier works. \n\nWe introduce a strong version of this problem under which some of the coordinates in y can break away from the descent rule ("mutate") , i.e., can take arbitrary values from the alphabet, or become completely unreadable.
DTSTART:20100205T130000
DTEND:20100205T140000
LOCATION:InfoLab21
END:VEVENT
END:VCALENDAR