activity
20092022
most citedNetwork Coding for Computing: Cut-Set Bounds

120 citations · 388 across the 34 of their papers we have counts for

collaborators
Showing cs.ITShow all

10 papers · 1 filter

cs.IT2019★ 2 cited

Non-Stochastic Information Theory

Anshuka Rangi, Massimo Franceschetti

In an effort to develop the foundations for a non-stochastic theory of information, the notion of -mutual information between uncertain variables is introduced as a generalizati…

cs.IT2017★ 1 cited

Deterministic coding theorems for blind sensing: optimal measurement rate and fractal dimension

Taehyung J. Lim, Massimo Franceschetti

Completely blind sensing is the problem of recovering bandlimited signals from measurements, without any spectral information beside an upper bound on the measure of the whole supp…

cs.IT2015★ 1 cited

Information without rolling dice

Massimo Franceschetti, Taehyung J. Lim

The deterministic notions of capacity and entropy are studied in the context of communication and storage of information using square-integrable, bandlimited signals subject to per…

cs.IT2014

On Landau's eigenvalue theorem and information cut-sets

Massimo Franceschetti

A variation of Landau's eigenvalue theorem describing the phase transition of the eigenvalues of a time-frequency limiting, self adjoint operator is presented. The total number of…

cs.IT2011★ 2 cited

Computing linear functions by linear coding over networks

Rathinakumar Appuswamy, Massimo Franceschetti

We consider the scenario in which a set of sources generate messages in a network and a receiver node demands an arbitrary linear function of these messages. We formulate an algebr…

cs.IT2011★ 5 cited

LQG Control Approach to Gaussian Broadcast Channels with Feedback

Ehsan Ardestanizadeh, Paolo Minero, Massimo Franceschetti

A code for communication over the k-receiver additive white Gaussian noise broadcast channel with feedback is presented and analyzed using tools from the theory of linear quadratic…