BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UNIFR/WEBMASTER//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTSTART;VALUE=DATE:20101207T171500
DTEND;VALUE=DATE:20101207T171500
UID:5621@agenda.unifr.ch
DESCRIPTION:Coding theory aims at achieving efficient and reliable\ntrasmission of data over a noisy channel. Algebraically, an error\ncorrecting code C is a subspace of a linear space and the data to be\ntransmitted is represented as vectors in C. Network coding is a recent\ndevelopment in the theory of error correcting codes, which is\nwell-suited for transmitting data over a network. As the elements of a\nlinear code are points in a vector space, the elements of a network code\nare points on a Grassmannian variety. In this talk, we introduce the\ntheory of error correcting codes, motivating the definition of network\ncoding. We then explain an algebraic construction of network codes,\nwhich we obtained in collaboration with F. Manganiello and J. Rosenthal\n(University of Zurich). Our construction has optimal distance properties\nand an efficient decoding algorithm, which exploits the algebraic\nstructure of the code.\n<br />\n[Invited by Prof. Ruth Kellerhals and Dr. Laura Ciobanu]
SUMMARY:Prof. Dr. Elisa GORLA (Universität Basel): Codes on the Grassmannian, or how to correct errors in a network
CATEGORIES:Colloque / Congrès / Forum
LOCATION:PER 08\, Phys 2.52\, Chemin du Musée 3\, 1700 Fribourg
URL;VALUE=URI:https://agenda.unifr.ch/e/fr/5621
END:VEVENT
END:VCALENDAR