10 problems
- 0 votes0 replies0 views
Optimality of the second-order term for Wyner–Ziv coding
Let Wyner–Ziv coding denote lossy source coding with decoder side information, and let the second-order term be the term appearing in Theorem. Optimality conjecture. The second-ord…
- 0 votes0 replies0 views
Conjectured rate bounds for single-server PPIR with mixed side information
PPIR-MSI rate-bound conjecture. The PPIR-MSI rate must satisfy
- 0 votes0 replies0 views
Conjectured rate for identifiable side information in single-server PPIR
Identifiable-side-information rate conjecture. The rate is achievable.
- 0 votes0 replies0 views
Multi-server PIR-RSSI capacity conjecture
Multi-server PIR-RSSI capacity conjecture. The capacity of multi-server PIR-RSSI is given by
- 0 votes0 replies0 views
Ma et al.'s rigorous state-evolution conjecture for AMP with side information
Approximate message passing with side information (AMP-SI) is an AMP algorithm whose conditional denoiser can depend on the coordinate index through the side information; its state…
- 0 votes0 replies1 view
Strict separation of Minimax and Maximin lower bounds for vector Gaussian rate-distortion with trace distortion
The vector Gaussian rate-distortion problem with variable side information under trace distortion, denoted , is considered together with its Minimax and Maximin lo…
- 0 votes0 replies0 views
Binary auxiliary-variable conjecture for the asymmetric binary rate-distortion problem
Binary auxiliary-variable conjecture. A binary auxiliary variable is sufficient to achieve the rate-distortion function, and the proposed bound is tight.
- 0 votes0 replies0 views
Capacity characterization for group leaders satisfying the receiver side-information condition
Consider a private-message AWGN broadcast channel with receivers, ordered by noise levels as . A group leader is the common subgraph obtained f…
- 0 votes0 replies1 view
Equivalence of the one-to-m lossy coding converse bounds
Let denote the rate-distortion function for average distortion and excess-distortion probability constraints, and let…
- 0 votes0 replies0 views
Optimality of the uncoded side-information inner bound for weaker legitimate side information
Let and denote Bob's and Eve's side information, respectively, and let and be their correlation parameters with the source. In the uncoded-side-informatio…