default search action
ITW 2016: Cambridge, United Kingdom
- 2016 IEEE Information Theory Workshop, ITW 2016, Cambridge, United Kingdom, September 11-14, 2016. IEEE 2016, ISBN 978-1-5090-1090-5
- Anindya Gupta, B. Sundar Rajan:
A relation between network computation and functional index coding problems. 1-5 - Shigeaki Kuzuoka, Shun Watanabe
:
On distributed computing for functions with certain structures. 6-10 - Xuan Guang, Shenghao Yang, Congduan Li:
An improved upper bound on network function computation using cut-set partition. 11-15 - Georg Pichler
A Tight Upper Bound on the Mutual Information of Two Boolean Functions. 16-20 - Mario Goldenbaum, Holger Boche, H. Vincent Poor:
On secure computation over the binary modulo-2 adder multiple-access wiretap channel. 21-25 - Maxim Raginsky, Alexander Rakhlin, Matthew Tsao, Yihong Wu, Aolin Xu:
Information-theoretic analysis of stability and bias of learning algorithms. 26-30 - Shaofeng Zou, Yingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai
K-user degraded broadcast channel with secrecy outside a bounded range. 31-35 - Amal Hyadi, Zouheir Rezki
On the secrecy capacity of the broadcast wiretap channel with limited CSI feedback. 36-40 - Ziv Goldfeld:
MIMO Gaussian broadcast channels with common, private and confidential messages. 41-45 - Chia-Yu Liu, Y.-W. Peter Hong
Jamming-resistant frequency hopping system with secret key generation from channel observations. 46-50 - Jayant Apte, Qi Chen, John MacLaren Walsh:
Symmetries in the entropy space. 51-55 - Massimo Franceschetti:
A universal bound on the ϵ-entropy of bandlimited radiation. 56-60 - João E. Strapasson
A totally geodesic submanifold of the multivariate normal distributions and bounds for the Fisher-Rao distance. 61-65 - Alex Dytso
On the applications of the minimum mean p-th error (MMPE) to information theoretic quantities. 66-70 - Florent Krzakala
Mutual information in rank-one matrix estimation. 71-75 - Jean Barbier
Threshold saturation of spatially coupled sparse superposition codes for all memoryless channels. 76-80 - Giulia Cervia, Laura Luzzi, Matthieu R. Bloch, Maël Le Treust:
Polar coding for empirical coordination of signals and actions over noisy channels. 81-85 - Rahul Devassy, Giuseppe Durisi
Nonasymptotic coding-rate bounds for binary erasure channels with feedback. 86-90 - Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Improving Belief Propagation decoding of polar codes using scattered EXIT charts. 91-95 - Roberto Assis Machado, Marcelo Firer:
MacWilliams' Identity for metrics determined by directed graphs. 96-100 - Lars Palzer, Roy Timo:
A lower bound for the rate-distortion function of spike sources that is asymptotically tight. 101-105 - Kazuho Watanabe
Constant-width rate-distortion bounds for power distortion measures. 106-110 - Ruiyang Song, Stefano Rini, Alon Kipnis
Optimal rate allocation in multiterminal compress-and-estimate source coding. 111-115 - Ayush Jain, Rakesh Kumar Bansal:
On point-wise redundancy rate of Bender-Wolf's variant of SWLZ algorithm. 116-120 - Idoia Ochoa
CROMqs: an infinitesimal successive refinement lossy compressor for the quality scores. 121-125 - Yasutada Oohama:
Strong converse for state dependent channels with full state information at the sender and partial state information at the receiver. 126-130 - Chandra Nair, Hyeji Kim, Abbas El Gamal:
On the optimality of randomized time division and superposition coding for the broadcast channel. 131-135 - Andrew Thangaraj:
Dual capacity upper bounds for noisy runlength constrained channels. 136-140 - Oliver Kosut, Jörg Kliewer:
Network equivalence for a joint compound-arbitrarily-varying network model. 141-145 - Eli Haim, Yuval Kochman:
Binary distributed hypothesis testing via Körner-Marton coding. 146-150 - Diego Valsesia
Multispectral image compression using universal vector quantization. 151-155 - Yann Traonmilin, Rémi Gribonval:
A framework for low-complexity signal recovery and its application to structured sparsity. 156-160 - Kai Wan, Daniela Tuninetti
On the optimality of uncoded cache placement. 161-165 - Parisa Hassanzadeh, Antonia M. Tulino
Correlation-aware distributed caching and coded delivery. 166-170 - Mohammad Mohammadi Amiri
Coded caching for a large number of users. 171-175 - Ramy E. Ali, Viveck R. Cadambe
Consistent distributed storage of correlated data updates via multi-version coding. 176-180 - Ehsan Abbasi, Christos Thrampoulidis, Babak Hassibi:
General performance metrics for the LASSO. 181-185 - Chuang Wang, Yue M. Lu:
Online learning for sparse PCA in high dimensions: Exact dynamics and phase transitions. 186-190 - Keerthi Suria Kumar Arumugam
Keyless asynchronous covert communication. 191-195 - Kittipong Kittichokechai, Rafael F. Schaefer, Giuseppe Caire:
Secret key generation through a relay. 196-200 - Eric Graves, Paul L. Yu, Predrag Spasojevic
Keyless authentication in the presence of a simultaneously transmitting adversary. 201-205 - Wenwen Tu, Mario Goldenbaum, Lifeng Lai, H. Vincent Poor:
Simultaneously generating multiple keys over a cascade of a noiseless channel and a wiretap channel. 206-210 - Dustin G. Mixon, Soledad Villar, Rachel A. Ward
Clustering subgaussian mixtures with k-means. 211-215 - Julia Kuhn, Michel Mandjes, Thomas Taimre
Anomaly identification with limited sampling budget. 216-220 - Sung-En Chiu, Tara Javidi
Sequential measurement-dependent noisy search. 221-225 - Wenjing Liao, Mauro Maggioni
Learning adaptive multiscale approximations to data and functions near low-dimensional sets. 226-230 - Vida Ravanmehr, Sadegh Bolouki, Gregory J. Puleo, Olgica Milenkovic:
Doubly threshold graphs for social network modeling. 231-235 - David G. M. Mitchell
On the block error rate performance of spatially coupled LDPC codes for streaming applications. 236-240 - Santhosh Kumar, A. Robert Calderbank, Henry D. Pfister
Beyond double transitivity: Capacity-achieving cyclic codes on erasure channels. 241-245 - Rafah El-Khatib, Nicolas Macris:
The velocity of the propagating wave for general coupled scalar systems. 246-250 - Josep Font-Segura
Asymptotics of the random-coding union bound in quasi-static fading channels. 251-254 - Hyuk Lee, Jungwoo Lee
An outer bound on the storage-bandwidth tradeoff of exact-repair regenerating codes and its asymptotic optimality in high rates. 255-259 - Richard Kueng, Peter Jung:
Robust nonnegative sparse recovery and 0/1-Bernoulli measurements. 260-264 - Eric W. Tramel, Andre Manoel
Inferring sparsity: Compressed sensing using generalized restricted Boltzmann machines. 265-269 - Il Yong Chun, Ben Adcock:
Optimal sparse recovery for multi-sensor measurements. 270-274 - Markus Leinonen, Marian Codreanu
Rate-distortion lower bound for compressed sensing via conditional remote source coding. 275-279 - Junjie Ma, Li Ping:
Orthogonal AMP for compressed sensing with unitarily-invariant matrices. 280-284 - Jinfeng Du, Muriel Médard, Shlomo Shamai
Cost of local cooperation in hierarchical virtual MIMO transmission schemes. 285-289 - Maialen Larrañaga, Mohamad Assaad, Apostolos Destounis, Georgios S. Paschos:
Dynamic pilot allocation over Markovian fading channels: A restless bandit approach. 290-294 - Inaki Estella Aguerri, Abdellatif Zaidi:
Lossy compression for compute-and-forward in limited backhaul wireless relay networks. 295-299 - Paul de Kerret, David Gesbert
Optimally bridging the gap from delayed to perfect CSIT in the K-user MISO BC. 300-304 - Sheng Yang, Shlomo Shamai
On MIMO phase noise channels at high SNR. 305-309 - Ke Ye
Algorithms for structured matrix-vector product of optimal bilinear complexity. 310-314 - François Malgouyres, Joseph Landsberg:
On the identifiability and stable recovery of deep/multi-layer structured matrix factorization. 315-319 - Amirhossein Reisizadehmobarakeh, Clayton Schoeny, Chi-Yo Tsai, Lara Dolecek:
Approximate file synchronization: Upper bounds and interactive algorithms. 320-324 - Tang Liu, Daniela Tuninetti
Pliable Index COding: Novel lower bound on the fraction of satisfied clients with a single transmission and its application. 325-329 - Parastoo Sadeghi
Distributed index coding. 330-334 - Michèle A. Wigger, Roy Timo, Shlomo Shamai
Complete interference mitigation through receiver-caching in Wyner's networks. 335-339 - Stephen D. Howard, Douglas Cochran, Songsri Sirianunpiboon:
The geometry of invariants for generalized coherence tests. 340-344 - Lu Wei, Zhong Zheng, Alfred O. Hero III, Vahid Tarokh:
Scaling laws and phase transitions for target detection in MIMO radar. 345-348 - Mohamed S. Nafea, Aylin Yener:
A new multiple access wiretap channel model. 349-353 - Chung Chan
When is omniscience a rate-optimal strategy for achieving secret key capacity? 354-358 - Oliver Wilhelm Gnilke
Well-rounded lattices for reliability and security in Rayleigh fading SISO channels. 359-363 - Ligong Wang:
Optimal throughput for covert communication over a classical-quantum channel. 364-368 - Meryem Benammar, Abdellatif Zaidi:
On lossy source coding with equivocation constraints. 369-373 - Meik Dorpinghaus:
A lower bound on the entropy rate for a large class of stationary processes and its relation to the hyperplane conjecture. 374-378 - Ali Bereyhi, Ralf R. Müller, Hermann Schulz-Baldes:
RSB decoupling property of MAP estimators. 379-383 - Cheuk Ting Li, Abbas El Gamal:
A universal coding scheme for remote generation of continuous random variables. 384-388 - Vivek S. Borkar, Nikhil Karamchandani, Sharad Mirani:
Randomized Kaczmarz for rank aggregation from pairwise comparisons. 389-393 - Zheng Wang, Cong Ling:
Symmetric Metropolis-within-Gibbs algorithm for lattice Gaussian sampling. 394-398 - Yuta Sakai
A generalized erasure channel in the sense of polarization for binary erasure channels. 399-403 - William Rurik, Arya Mazumdar:
Hamming codes as error-reducing codes. 404-408 - Wael Halbawi, Zihan Liu, Babak Hassibi:
Balanced Reed-Solomon codes for all parameters. 409-413 - Siyuan Wu, Li Chen, Martin Johnston:
Low-complexity Chase decoding of algebraic-geometric codes using Koetter's interpolation. 414-418 - Yafit Feldman, Anelia Somekh-Baruch:
Channels with state information and mismatched decoding. 419-423 - Maxime Ferreira Da Costa
Achieving super-resolution in multi-rate sampling systems via efficient semidefinite programming. 424-428 - Avinash Vem, Nagaraj Thenkarai Janakiraman, Krishna R. Narayanan:
Sub-linear time compressed sensing for support recovery using left and right regular sparse-graph codes. 429-433 - Qiwen Wang, Muriel Médard, Mikael Skoglund:
Efficient compression algorithm for file updates under random insertions and deletions. 434-438 - Yuval Kochman, Gregory W. Wornell:
The dispersion of the mean excess distortion. 439-443 - Farideh Ebrahim Rezagah, Shirin Jalali, Elza Erkip
Using compression codes in compressed sensing. 444-448 - Morteza Varasteh, Borzoo Rassouli, Osvaldo Simeone, Deniz Gündüz
Zero-delay joint source-channel coding with a 1-bit ADC front end and receiver side information. 449-453 - Pin-Hsun Lin, Eduard A. Jorswieck
On ergodic fading Gaussian interference channels with statistical CSIT. 454-458 - Antonio Campello, Cong Ling, Jean-Claude Belfiore:
Algebraic lattices achieving the capacity of the ergodic fading channel. 459-463 - Alexey Buzuverov, Hussein Al-Shatri, Anja Klein:
On the achievable degrees of freedom of the MIMO X-channel with delayed CSIT. 464-468 - Adel M. Elmahdy, Amr El-Keyi, Yahya Mohasseb
Asymmetric degrees of freedom of the full-duplex MIMO 3-way channel. 469-473 - Victor Quintero
Approximate capacity of the Gaussian interference channel with noisy channel-output feedback. 474-478
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: