June 2024 - Info-theory - huji-cs listserver

ITA seminar 1/7, 10:00 - Student Seminars
by Or Ordentlich 30 Jun '24

30 Jun '24

Hi all, Our next meeting in the Information Theory and Applications seminar will take place tomorrow (Monday), July 1, at 10:00, in room A500. The meeting will consist of two presentations, given by Nadav Lustig and Maya Swisa. They will describe to us research papers they have read. See you there, Or, Oron, Yuval and Alex

1 0

ITA seminar 17/6, 10:00 - Anelia Somekh-Baruch (Bar Ilan)
by Or Ordentlich 13 Jun '24

13 Jun '24

Hi all, Our next meeting in the Information Theory and Applications seminar will take place on Monday, June 17 at 10:00, in room A500. The speaker is Anelia Somekh-Baruch, who will tell us about an exciting new technique for proving impossibility results for various communication setups. See you there, Or, Oron, Yuval and Alex --------------------------------------------- *Title:* A new framework for proving converse theorems for channel coding *Abstract: *The problem of determining the fundamental limits of channel coding in the case of sub-optimal decoding, also known as "mismatched decoding," is a longstanding question that has numerous applications in fields such as communications, information theory, and computer science. For instance, the zero-error capacity of a channel is a special example of a mismatched channel coding scenario. In this talk, I will provide an overview of this problem and introduce a new bounding technique called the "multicasting approach." This approach yields multiple single-letter converse (impossibility) bounds for stationary memoryless channels that are non-trivial. Additionally, I will discuss how refining this method leads to state-of-the-art converse bounds on the reliability function (error exponent) for channel coding of discrete memoryless channels with maximum-likelihood decoding.

1 0

ITA seminar 3/6, 10:00 - Dor Elimelch (BGU)
by Or Ordentlich 03 Jun '24

03 Jun '24

Hi all, Our next meeting in the Information Theory and Applications seminar will take place on Monday, June 3 at 10:00, in room A500. The speaker is Dor Elimelch, who will tell us about error correction in constrained systems. See you there, Or, Oron, Yuval and Alex --------------------------------------------- *Title:* Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems *Abstract:* We introduce a novel framework for implementing error-correction in constrained systems. The main idea of our scheme, called Quantized-Constraint Concatenation (QCC), is to employ a process of embedding the codewords of an error-correcting code in a constrained system as a (noisy, non-invertible) quantization process. This is in contrast to traditional methods, such as concatenation and reverse concatenation, where the encoding into the constrained system is reversible. The possible number of channel errors QCC is capable of correcting is linear in the block length $n$, improving upon the $O(\sqrt{n})$ possible with the state-of-the-art known schemes. For a given constrained system, the performance of QCC depends on a new fundamental parameter of the constrained system -- its covering radius. Motivated by QCC, we study the covering radius of constrained systems in both combinatorial and probabilistic settings. We reveal an intriguing characterization of the covering radius of a constrained system using ergodic theory, which we use in order to establish efficiently computable upper bounds on the covering radius.

1 1

2024

Info-theory June 2024 ----- 2024 ----- November 2024 October 2024 September 2024 August 2024 July 2024 June 2024 May 2024 April 2024 March 2024 February 2024 January 2024

Info-theory June 2024