EE Seminar: The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding

04 במאי 2026, 13:00 
אולם 011, בניין כיתות-חשמל 
EE Seminar: The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding

הרישום לסמינר יבוצע בתחילת הסמינר באמצעות סריקת הברקוד למודל (יש להיכנס לפני כן למודל,  לא באמצעות האפליקציה)

Registration to the seminar is done at the beginning of the seminar by scanning the barcode for the Moodle (Please enter ahead to the Moodle, NOT by application)

 

(The talk will be given in English)

 

Speaker:     Prof. Or Ordentlich

School of Computer Science and Engineering, Hebrew University

 

011 hall, Electrical Engineering-Kitot Building‏

Monday, May 4th, 2026

13:00 - 14:00

 

The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding
 

Abstract

For a lattice/linear code, we define the Voronoi spherical cumulative density function (CDF) as the CDF of the $\ell_2$-norm/Hamming weight of a random vector uniformly distributed over the Voronoi cell. Using the first moment method together with a simple application of Jensen's inequality, we develop lower bounds on the expected Voronoi spherical CDF of a random lattice/linear code. Our bounds are valid for any finite dimension and are quite close to a  ball-based lower bound. They immediately translate to new non-asymptotic upper bounds on the normalized second moment and the error probability of a random lattice over the additive white Gaussian noise channel, as well as new non-asymptotic upper bounds on the Hamming distortion and the error probability of a random linear code over the binary symmetric channel. In particular, we show that for most lattices in $\mathbb{R}^n$ the second moment is  greater than that of a Euclidean ball with the same covolume only by a  $\left(1+O(\frac{1}{n})\right)$ multiplicative factor. Similarly, for most linear codes in $\mathbb{F}_2^n$ the expected Hamming distortion is greater than that of a corresponding Hamming ball only by an additive universal constant.

https://arxiv.org/pdf/2506.19791

Short Bio

Or Ordentlich received the B.Sc. (cum laude), M.Sc. (summa cum laude), and Ph.D. degrees from Tel Aviv University, Israel, in 2010, 2011, and 2016, respectively, all in electrical engineering. He is an Asso-ciate Professor with the School of Computer Science and Engineering, Hebrew University of Jerusalem. From 2015 to 2017, he was a Post-Doctoral Fellow with the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology (MIT), and the Department of Electrical and Computer Engineering, Boston University. His research focuses on information theory, and its application to modern problems in communication, compression, and data science. His work on lattice covering has received the Frontiers of Science Award in 2025. He has been serving as an Associate Editor for Signal Processing and Source Coding in IEEE TRANSACTIONS ON INFORMATION THEORY since 2021.

  -סמינר זה ייחשב כסמינר שמיעה לתלמידי תואר שני ושלישי-

This Seminar Is Considered A Hearing Seminar For Msc/Phd Students-

 

אוניברסיטת תל אביב עושה כל מאמץ לכבד זכויות יוצרים. אם בבעלותך זכויות יוצרים בתכנים שנמצאים פה ו/או השימוש שנעשה בתכנים אלה לדעתך מפר זכויות
שנעשה בתכנים אלה לדעתך מפר זכויות נא לפנות בהקדם לכתובת שכאן >>