BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Cheuk Ting LI (Chinese University of Hong Kong) DTSTART:20260930T150000Z DTEND:20260930T161500Z DTSTAMP:20261006T143522Z UID:AAIT/55 DESCRIPTION:Title: A Correspondence between Coding Problems and Logic via Confusion Hypergraphs (Part II).\nby Cheuk Ting LI (Chinese University of Hong Kong) as par t of Seminar on Algorithmic Aspects of Information Theory\n\n\nAbstract\nI nformation is often represented as random variables or partitions of the s ample space\, where we can take the "conjunction" of two pieces of informa tion as the joint random variable\, but cannot perform other logical opera tions. By generalizing partitions to confusion hypergraphs (which form a H eyting algebra)\, we can take conjunction\, disjunction and implication be tween information. In this talk\, we will discuss connections between conf usion hypergraphs and logic (generalized inquisitive logic and intuitionis tic logic)\, and show how we can directly compute an almost-optimal coding scheme for various coding settings (e.g.\, network coding and index codin g) by translating the settings into logical formulae\, and evaluating the formulae over hypergraphs. The optimal communication cost is given approxi mately by the hypergraph entropy. We will also discuss several identities and inequalities on hypergraph entropy\, and their interpretations in codi ng settings. (Part II of the talk).\n\nThis is the 2nd part of the talk st arted on Sep 23. The recorded video and slides of the first part of the ta lk are available on the page of the seminar\, https://www.lirmm.fr/~romash chen/seminar-aait.html .\n LOCATION:https://researchseminars.org/talk/AAIT/55/ END:VEVENT END:VCALENDAR