Page Not Found
Page not found. Your pixels are in another canvas.
Sitemap
A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.
Pages
Giuseppe Durisi
Giuseppe Durisi, Professor, Chalmers University of Technology, information theory, communication theory, machine learning
Posts
Invited talk at LSIT 2023
Invited talk on short packets over massive random-access channels at the 2023 London Symposium on Information Theory
2023-Q1: team updates
2023-Q1 updates about my team at Chalmers
Setting up a new Mac
I’ve just got hold of a new Mac Studio, to replace my 2017 iMac, which has started showing signs of aging. I thought it could be useful for the PhD students ...
Fredrik Hellström’s PhD defense
My PhD student Fredrik Hellström successfully defended his PhD thesis
Two papers at NeurIPS 2022
Two papers from our team at NeurIPS 2022 on information-theoretic generalization bounds
SSF project approved
The Swedish Foundation for Strategic Research has granted a new project to our group
Information-theoretic generalization bounds for learning and metalearning
Our funding proposal on information-theoretic generalization bounds for learning and metalearning has been approved
paper at Globecom 2021
Joint detection and decoding for short-packet transmission
4 papers at Asilomar 2021
4 papers at this year’s Asilomar conference from our team
VR project approved
The Swedish Research Council has approved a new research project in our group
Plenary talk at ITW 2021
Plenary talk at the 2021 Information Theory Workshop
3 papers at ISIT 2021
Members of our group will present three papers at this year IEEE International Symposium on Information Theory
Numerical routines for reproducible research
We have just uploaded the matlab code to reproduce the results reported in two recently published papers
Two Marie Skłodowska-Curie fellowships in our team
Two postdoctoral researchers in our team received prestigious individual fellowships
Generalization Bounds via Information Density and Conditional Information Density
A general approach to derive bounds on the generalization error of randomized learning algorithms—to appear in the Journal on Selected Areas in Information T...
Massive MIMO for URLLC? Use multicell MMSE processing and avoid pilot contamination
How should one design a massive MIMO system so that it can support URLLC? In a recent article, we provide guidelines based on nonasymptotic information theory
Vacancies in my team
I am looking for a PhD student and a Post-doctoral researcher to join my team
Survey on short codes
A survey of good coding schemes for the transmission of short packets
My view on massive machine-type communications
Interview on massive machine-type communications for the Cognitive Networks Technical Committee Newsletter
Tutorial on short-packet transmission at Globecom 2018
Slides of our Globecom tutorial—short-packets communications: fundamentals and practical coding schemes
Two postdoctoral and one PhD positions available in my team
I am looking for 2 postdoctoral researchers and 1 PhD student who would like to join my team
WASP expedition project approved
A new research project in our team sponsored by WASP
VR project approved
A new research project in our team sponsored by VR
Invited presentation at PIMRC
Finite-blocklength information theory is an indispensable toolbox for the design of short-packet communication systems. In an invited presentation at this ye...
Our team has a new member
Fredrik Hellström has joined our team as new Ph.D. student
To appear in Trans. Inf. Theory
The following two papers will soon appear in the IEEE Transactions on Information Theory:
Designing URLLC via nonasymptotic information theory–part 4
Fourth part of my series of posts about the design of URLLC through finite-blocklength information theory: the metaconverse theorem.
Designing URLLC via nonasymptotic information theory–part 3
Third part of my series of posts about the design of URLLC through finite-blocklength information theory: the random-coding union bound with parameter s.
Presentation at TUM-COM Workshop
Presentation at the TUM-COM workshop on URLLC communications
Designing URLLC via nonasymptotic information theory–part 2
Second part of my series of posts about the design of URLLC through finite-blocklength information theory: the binary-input AWGN channel and its fundamental ...
Arxiv preprint: joint queuing-coding analysis for URLLC
R. Devassy, G. Durisi, G. C. Ferrante, O. Simeone, and E. Uysal-Biyikoglu, “Reliable transmission of short packets through queues and noisy channels under la...
A new Chalmers centre for artificial intelligence
Over the last eight months, I have been working together with many colleagues in the Information and Communication Technology Area of Advance at Chalmers on...
To appear in Trans. Inf. Theory
W. Yang, A. Collins, G. Durisi, Y. Polyanskiy, and H. V. Poor, “Beta-beta bounds: Finite-blocklength analog of the golden formula,” IEEE Tran. Inf. Theory, 2...
Designing URLLC via nonasymptotic information theory–part 1
An updated version of these notes can be found here
Paper at ISIT 2018
R. Devassy, G. Durisi, G. C. Ferrante, O. Simeone, and E. Uysal-Biyikoglu, “Delay and peak-age violation probability in short-packet transmission,” in Proc. ...
Welcome to my new blog!
Welcome to my new website–now hosted by github. I decided also to start a blog to help me summarizing regularly what I have been learning. This is the first ...