default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2013: Istanbul, Turkey
- Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013. IEEE 2013, ISBN 978-1-4799-0446-4
- Inaki Estella Aguerri, Deniz Gündüz
:
Systematic lossy source transmission over Gaussian time-varying channels. 1-5 - Emrah Akyol, Kumar Viswanatha, Kenneth Rose, Tor A. Ramstad:
On zero delay source-channel coding: Functional properties and linearity conditions. 6-10 - Erman Koken, Ertem Tuncel:
Gaussian HDA coding with bandwidth expansion and side information at the decoder. 11-15 - Tara Javidi, Andrea Goldsmith:
Dynamic joint source-Channel coding with feedback. 16-20 - I-Hsiang Wang, Changho Suh, Suhas N. Diggavi, Pramod Viswanath:
Bursty interference channel with feedback. 21-25 - Can Karakus, I-Hsiang Wang, Suhas N. Diggavi:
Interference channel with intermittent feedback. 26-30 - Quan Geng, Sreeram Kannan, Pramod Viswanath:
Interactive interference alignment. 31-35 - Sung Ho Chae, Changho Suh, Sae-Young Chung:
Feedback can increase the degrees of freedom of the rank-deficient interference channel. 36-40 - Sergey Loyka, Victoria Kostina, François Gagnon:
Convexity of error rates in digital communications under non-Gaussian noise. 41-45 - Tugcan Aktas, Ali Özgür Yilmaz, Emre Aktas:
Generalizing the sampling property of the Q-function for Error Rate analysis of cooperative communication in fading channels. 46-50 - Hamza Soury, Ferkan Yilmaz, Mohamed-Slim Alouini:
Exact symbol error probability of square M-QAM signaling over generalized fading channels subject to additive generalized Gaussian noise. 51-55 - Sung Sik Nam, Hong-Chuan Yang, Mohamed-Slim Alouini, Dong In Kim:
Exact capture probability analysis of GSC receivers over i.n.d. Rayleigh fading channels. 56-60 - Armand M. Makowski, Osman Yagan:
Random threshold graphs with exponential fitness: The width of the phase transition for connectivity. 61-65 - Clement Kam, Sastry Kompella, Anthony Ephremides:
Age of information under random updates. 66-70 - Abhishek Mishra, Parv Venkitasubramaniam:
Anonymity of a buffer constrained chaum mix: Optimal strategy and asymptotics. 71-75 - Chouchang Yang, Basel Alomair, Radha Poovendran:
Optimized relay-route assignment for anonymity in wireless networks. 76-80 - Jonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas:
Superposition codes for mismatched decoding. 81-85 - Jonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas:
The mismatched multiple-access channel: General alphabets. 86-90 - Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky:
The zero-undetected-error capacity of the low-noise cyclic triangle channel. 91-95 - Anelia Somekh-Baruch:
On coding schemes for channels with mismatched decoding. 96-100 - David L. Donoho, Galen Reeves:
Achieving Bayes MMSE performance in the sparse signal + Gaussian white noise model when the noise level is unknown. 101-105 - David Stotz, Erwin Riegler, Helmut Bölcskei:
Almost lossless analog signal separation. 106-110 - Shirin Jalali, Arian Maleki:
From compression to compressed sensing. 111-115 - Galen Reeves, David L. Donoho:
The minimax noise sensitivity in compressed sensing. 116-120 - Kenza Guenda, T. Aaron Gulliver, Patrick Solé:
On cyclic DNA codes. 121-125 - Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev:
Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes. 126-130 - Li Tang, Qin Huang, Zulin Wang, Zixiang Xiong:
Low-complexity encoding of binary quasi-cyclic codes based on Galois Fourier transform. 131-135 - Navin Kashyap, Gilles Zémor:
Upper bounds on the size of grain-correcting codes. 136-140 - Raffaele Mascella, Danilo Pelusi, Laura Pezza, Samir Elmougy, Luca G. Tallini, Bella Bose:
On efficient second-order spectral-null codes using sets of m1-balancing functions. 141-145 - Oleg Kurmaev, Yanxing Zeng, Sergei V. Fedorenko, Vladimir Ivanov, Jianqiang Shen:
Pseudo-ternary run-length limited spectrum shaped codes. 146-150 - Erik Ordentlich, Ron M. Roth:
Hamming-weight constrained coded arrays based on covering codes. 151-155 - Yuval Cassuto, Shahar Kvatinsky, Eitan Yaakobi:
Sneak-path constraints in memristor crossbar arrays. 156-160 - Lukas Drescher, Omar Fawzi:
On simultaneous min-entropy smoothing. 161-165 - Masahiro Takeoka, Hari Krovi, Saikat Guha:
Achieving the Holevo capacity of a pure state classical-quantum channel via unambiguous state discrimination. 166-170 - Ciara Morgan, Andreas J. Winter:
Towards a strong converse for the quantum capacity (of degradable channels). 171-175 - Alexander S. Holevo:
Capacities of Gaussian classical-quantum channels. 176-180 - Bernd Bandemer, Chao Tian, Shlomo Shamai:
Gaussian state amplification with noisy state observations. 181-185 - Behzad Ahmadi, Himanshu Asnani, Osvaldo Simeone, Haim H. Permuter:
Information embedding on actions. 186-190 - Sorina Dumitrescu, Yinghan Wan:
Bit-error resilient index assignment for multiple description scalar quantizers. 191-195 - Himanshu Asnani, Ilan Shomorony, Amir Salman Avestimehr, Tsachy Weissman:
Network compression: Worst-case analysis. 196-200 - Daniel Calabuig, Ramy H. Gohary, Halim Yanikomeroglu:
Optimum transmission through the Gaussian multiple access channel. 201-205 - Se-Young Yun, Jinwoo Shin, Yung Yi:
CSMA using the Bethe approximation for utility maximization. 206-210 - Alexey A. Frolov, Victor V. Zyablov, Vladimir Sidorenko, Robert F. H. Fischer:
On a multiple-access in a vector disjunctive channel. 211-215 - Panayotis Mertikopoulos, Aris L. Moustakas:
Riemannian-geometric optimization methods for MIMO multiple access channels. 216-220 - Maxim Raginsky, Igal Sason:
Refined bounds on the empirical distribution of good channel codes via concentration inequalities. 221-225 - Gowtham Ramani Kumar, Thomas A. Courtade:
Which Boolean functions are most informative? 226-230 - Marco Dalai:
Lovász's theta function, Rényi's divergence and the sphere-packing bound. 231-235 - Tarik Kaced:
Equivalence of two proof techniques for non-shannon-type inequalities. 236-240 - Dinesh Ramasamy, Radha Krishna Ganti, Upamanyu Madhow:
On the capacity of picocellular networks. 241-245 - Mustafa Riza Akdeniz, Sundeep Rangan:
Optimal wireless scheduling with interference cancellation. 246-250 - Xinchen Zhang, Martin Haenggi:
The aggregate throughput in random wireless networks with successive interference cancellation. 251-255 - Martin Haenggi:
Delay scaling in poisson networks. 256-260 - Vinith Misra, Tsachy Weissman:
Unsupervised learning and universal communication. 261-265 - Reihaneh Safavi-Naini, Pengwei Wang:
Codes for limited view adversarial channels. 266-270 - Farzin Haddadpour, Mahdi Jafari Siavoshani, Mayank Bakshi, Sidharth Jaggi:
On AVCs with quadratic constraints. 271-275 - Jad Hachem, I-Hsiang Wang, Christina Fragouli, Suhas N. Diggavi:
Coding with encoding uncertainty. 276-280 - David T.-H. Kao, Ashutosh Sabharwal:
An upper bound on the capacity of vector dirty paper with unknown spin and stretch. 281-285 - Jinchun Zhan, Namrata Vaswani:
Time invariant error bounds for modified-CS based sparse signal sequence recovery. 286-290 - Mehmet Akçakaya, Vahid Tarokh:
Distortion-based achievability conditions for joint estimation of sparse signals and measurement parameters from undersampled acquisitions. 291-295 - Mary Wootters, Yaniv Plan, Mark A. Davenport, Ewout van den Berg:
Lower bounds for quantized matrix completion. 296-300 - Sheng Wang, Behzad Shahrasbi, Nazanin Rahnavard:
SRL1: Structured reweighted ℓ1 minimization for compressive sampling of videos. 301-305 - Zouha Cherif, Jean-Luc Danger, Sylvain Guilley, Jon-Lark Kim, Patrick Solé:
Multiply constant weight codes. 306-310 - Fan Zhang, Hengjun Zhu:
Single-track Gray codes with non-k-spaced heads. 311-315 - Yuan Zhu, Siyun Tang:
A reduced-complexity algorithm for polynomial interpolation. 316-320 - Yeow Meng Chee, Han Mao Kiah, Hui Zhang, Xiande Zhang:
Optimal codes in the Enomoto-Katona space. 321-325 - Yongge Wang:
Array BP-XOR codes for reliable cloud storage systems. 326-330 - K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran:
A piggybacking design framework for read-and download-efficient distributed storage codes. 331-335 - Henk D. L. Hollmann, Wencin Poh:
Characterizations and construction methods for linear functional-repair storage codes. 336-340 - Chi Wan Sung, Xueqing Gong:
A ZigZag-decodable code with the MDS property for distributed storage systems. 341-345 - Winton Brown, Omar Fawzi:
Short random circuits define good quantum error correcting codes. 346-350 - Ryutaroh Matsumoto:
Improved asymptotic key rate of the B92 protocol. 351-353 - David Sutter, Joseph M. Renes, Frédéric Dupuis, Renato Renner:
Efficient quantum channel coding scheme requiring no preshared entanglement. 354-358 - Hongchao Zhou, Gregory W. Wornell:
Adaptive pulse-position modulation for high-dimensional quantum key distribution. 359-363 - Shraga I. Bross, Yaron Laufer:
Sending a bivariate Gaussian source over a Gaussian MAC with unidirectional conferencing encoders. 364-368 - Sadaf Salehkalaibar, Mohammad Reza Aref:
Joint source-channel coding for Multiple-Access Wiretap Channels. 369-373 - Lóránt Farkas, Tamás Kói:
Random access and source-channel coding error exponents for Multiple Access Channels. 374-378 - Hamidreza Ebrahimzadeh Saffar, Patrick Mitran:
Time-asynchronous Gaussian multiple access channel with correlated sources. 379-383 - Oscar Gonzalez, Ignacio Santamaría, Carlos Beltrán:
Finding the number of feasible solutions for linear interference alignment problems. 384-388 - Shaunak Mishra, I-Hsiang Wang, Suhas N. Diggavi:
Opportunistic interference management for multicarrier systems. 389-393 - Navid Naderializadeh, Amir Salman Avestimehr:
Impact of topology on interference networks with no CSIT. 394-398 - Hua Sun, Chunhua Geng, Syed Ali Jafar:
Topological interference management with alternating connectivity. 399-403 - Thomas Breuer, Imre Csiszár:
Information geometry in mathematical finance: Model risk, worst and almost worst scenarios. 404-408 - Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Information theoretic measures of distances and their econometric applications. 409-413 - Igal Sason:
Entropy bounds for discrete random variables via coupling. 414-418 - Maxim Raginsky:
Logarithmic Sobolev inequalities and strong data processing theorems for discrete channels. 419-423 - Cheol Jeong, Won-Yong Shin:
Large-scale ad hoc networks with rate-limited infrastructure: Information-theoretic operating regimes. 424-428 - Andrés Altieri, Leonardo Rey Vega, Cecilia G. Galarza, Pablo Piantanida:
Cooperative unicasting in large wireless networks. 429-433 - Alla Merzakreeva, Olivier Lévêque, Ayfer Özgür:
Telescopic beamforming for large wireless networks. 434-438 - Maksym A. Girnyk, Mikko Vehkaperä, Lars K. Rasmussen:
Large-system analysis of the K-hop AF MIMO relay channel with arbitrary inputs. 439-443 - Albert No, Tsachy Weissman:
Minimax filtering regret via relations between information and estimation. 444-448 - Jiantao Jiao, Kartik Venkat, Tsachy Weissman:
Pointwise relations between information and estimation in the Poisson channel. 449-453 - Liming Wang, Miguel R. D. Rodrigues, Lawrence Carin:
Generalized Bregman divergence and gradient of mutual information for vector Poisson channels. 454-458 - Dongning Guo:
On information-Estimation relationships over binomial and negative binomial models. 459-463 - Sameer Pawar, Kannan Ramchandran:
Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity. 464-468 - Mitra Fatemi, Martin Vetterli:
Randomized recovery for boolean compressed sensing. 469-473 - Xin-Ji Liu, Shu-Tao Xia:
Reconstruction guarantee analysis of binary measurement matrices based on girth. 474-478 - Xin-Ji Liu, Shu-Tao Xia:
Constructions of quasi-cyclic measurement matrices based on array codes. 479-483 - Matthew Thill, Babak Hassibi:
On frames from abelian group codes. 484-488 - Eldho K. Thomas, Frédérique E. Oggier:
Explicit constructions of quasi-uniform codes from groups. 489-493 - Tuvi Etzion, Alexander Vardy, Eitan Yaakobi:
Coding for the Lee and Manhattan metrics with weighing matrices. 494-498 - Yeow Meng Chee, Hui Zhang, Xiande Zhang:
Complexity of dependencies in bounded domains, Armstrong Codes, and generalizations. 499-503 - Govinda M. Kamath, Natalia Silberstein, N. Prakash, Ankit Singh Rawat, V. Lalitha, Onur Ozan Koyluoglu, P. Vijay Kumar, Sriram Vishwanath:
Explicit MBR all-symbol locality codes. 504-508 - Daniel Augot, Pierre Loidreau, Gwezheneg Robert:
Rank metric and Gabidulin codes in characteristic zero. 509-513 - Natalia Silberstein, Anna-Lena Trautmann:
New lower bounds for constant dimension codes. 514-518 - Antonia Wachter-Zeh:
Bounds on polynomial-time list decoding of rank metric codes. 519-523 - Yixuan Xie, Jinhong Yuan, Robert A. Malaney:
Quantum stabilizer codes from difference sets. 524-528 - Yun-Jiang Wang, Bei Zeng, Markus Grassl, Barry C. Sanders:
Stabilizer formalism for generalized concatenated quantum codes. 529-533 - Markus Grassl, Martin Roetteler:
Leveraging automorphisms of quantum codes for fault-tolerant quantum computation. 534-538 - Emrah Akyol, Kenneth Rose, Tamer Basar:
Gaussian sensor networks with adversarial nodes. 539-543 - Ahmad Abou Saleh, Fady Alajaji, Wai-Yip Chan:
Hybrid digital-analog coding for interference broadcast channels. 544-548 - Yonathan Murin, Ron Dabora, Deniz Gündüz:
On necessary conditions for multiple-access-relay channels with correlated sources. 549-553 - James Ho, En-Hui Yang:
Optimal multiresolution quantization with error detecting codes for broadcast channels. 554-558 - Thomas A. Courtade:
Outer bounds for multiterminal source coding via a strong data processing inequality. 559-563 - Mahdi Zamanighomi, Zhengdao Wang:
Multiple-antenna interference channel with receive antenna joint processing and real interference alignment. 564-568 - Mohsen Rezaee, Maxime Guillaud, Fredrik Lindqvist:
CSIT sharing over finite capacity backhaul for spatial interference alignment. 569-573 - Vasileios Ntranos, Viveck R. Cadambe, Bobak Nazer, Giuseppe Caire:
Integer-forcing interference alignment. 574-578 - Stefan Dierks, Gerhard Kramer, Wolfgang Zirwas:
Feasibility conditions of interference alignment via two orthogonal subcarriers. 579-583 - Hamed Farhadi, Majid Nasiri Khormuji, Chao Wang, Mikael Skoglund:
Ergodic interference alignment with noisy channel state information. 584-588 - Saeid Haghighatshoar, Emmanuel Abbe, Emre Telatar:
A new entropy power inequality for integer-valued random variables. 589-593 - Varun S. Jog, Venkat Anantharam:
The Entropy Power Inequality and Mrs. Gerber's Lemma for groups of order 2n. 594-598 - Liyao Wang, Mokshay M. Madiman:
A new approach to the entropy power inequality, via rearrangements. 599-603 - Sangwoo Park, Erchin Serpedin, Marwa K. Qaraqe:
A variational perspective over an extremal entropy inequality. 604-608