default search action
ISIT 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
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
Dynamic joint source-Channel coding with feedback. 16-20 - I-Hsiang Wang, Changho Suh
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
Feedback can increase the degrees of freedom of the rank-deficient interference channel. 36-40 - Sergey Loyka, Victoria Kostina
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
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
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
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
Optimized relay-route assignment for anonymity in wireless networks. 76-80 - Jonathan Scarlett, Alfonso Martinez
Superposition codes for mismatched decoding. 81-85 - Jonathan Scarlett, Alfonso Martinez
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
On efficient second-order spectral-null codes using sets of m1-balancing functions. 141-145 - Oleg Kurmaev, Yanxing Zeng, Sergei V. Fedorenko
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
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
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
On a multiple-access in a vector disjunctive channel. 211-215 - Panayotis Mertikopoulos
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
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
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
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
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
Characterizations and construction methods for linear functional-repair storage codes. 336-340 - Chi Wan Sung
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
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
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
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
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
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
Explicit constructions of quasi-uniform codes from groups. 489-493 - Tuvi Etzion, Alexander Vardy
Coding for the Lee and Manhattan metrics with weighing matrices. 494-498 - Yeow Meng Chee
Complexity of dependencies in bounded domains, Armstrong Codes, and generalizations. 499-503 - Govinda M. Kamath, Natalia Silberstein, N. Prakash
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
Quantum stabilizer codes from difference sets. 524-528 - Yun-Jiang Wang, Bei Zeng, Markus Grassl
Stabilizer formalism for generalized concatenated quantum codes. 529-533 - Markus Grassl
Leveraging automorphisms of quantum codes for fault-tolerant quantum computation. 534-538 - Emrah Akyol
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
CSIT sharing over finite capacity backhaul for spatial interference alignment. 569-573 - Vasileios Ntranos, Viveck R. Cadambe
Integer-forcing interference alignment. 574-578 - Stefan Dierks, Gerhard Kramer
Feasibility conditions of interference alignment via two orthogonal subcarriers. 579-583 - Hamed Farhadi
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 - Hon Fah Chong, Ying-Chang Liang
A new extremal entropy inequality with applications. 609-613 - Yang Li, Aria Nosratinia
Pilot-based product superposition for downlink multiuser MIMO. 614-618 - Junyoung Nam, Jae Young Ahn:
Joint spatial division and multiplexing - Benefits of antenna correlation in multi-user MIMO. 619-623 - Paul de Kerret, Xinping Yi, David Gesbert
On the degrees of freedom of the K-user time correlated broadcast channel with delayed CSIT. 624-628 - Yohan Lejosne, Dirk T. M. Slock, Yi Yuan-Wu:
NetDoFs of the MISO broadcast channel with delayed CSIT feedback for Finite Rate of innovation channel models. 629-633 - Gadiel Seroussi, Marcelo J. Weinberger:
Twice-universal fixed to variable-length random number generators for finite memory sources. 634-638 - Gadiel Seroussi, Marcelo J. Weinberger:
Universal variable to fixed-length random number generators for finite memory sources. 639-643 - Joe Suzuki:
Universal Bayesian measures. 644-648 - Oliver Kosut, Lalitha Sankar:
Universal fixed-to-variable source coding in the finite blocklength regime. 649-653 - Amir Ingber, Thomas A. Courtade, Tsachy Weissman:
Compression for exact match identification. 654-658 - Florent Krzakala
Phase diagram and approximate message passing for blind calibration and dictionary learning. 659-663 - Sundeep Rangan, Philip Schniter, Erwin Riegler, Alyson K. Fletcher, Volkan Cevher
Fixed points of generalized approximate message passing with arbitrary matrices. 664-668 - Ayaka Sakata
Sample complexity of Bayesian optimal dictionary learning. 669-673 - Hugo Reboredo, Francesco Renna
Compressive classification. 674-678 - Tianyi Zhou
k-bit Hamming compressed sensing. 679-683 - Lin Sok, Patrick Solé, Aslan Tchamkerten:
Lattice based codes for insertion and deletion channels. 684-688 - Ryan Gabrys, Eitan Yaakobi, Lara Dolecek:
Correcting grain-errors in magnetic media. 689-693 - Luca G. Tallini, Bella Bose:
On L1 metric asymmetric/unidirectional error control codes, constrained weight codes and σ-codes. 694-698 - Daniel Cullina
An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codes. 699-703 - Eyal En Gad, Eitan Yaakobi, Anxiao Andrew Jiang, Jehoshua Bruck
Rank-modulation rewriting codes for flash memories. 704-708 - Kees A. Schouhamer Immink:
Coding schemes for multi-level channels with unknown gain and/or offset. 709-713 - Evyatar Hemo, Yuval Cassuto:
Adaptive threshold read algorithms in multi-level non-volatile memories. 714-718 - Minghai Qin, Anxiao Andrew Jiang, Paul H. Siegel:
Parallel programming of rank modulation. 719-723 - Sarit Buzaglo, Eitan Yaakobi, Tuvi Etzion, Jehoshua Bruck
Error-correcting codes for multipermutations. 724-728 - Ranjith Nair
A realizable receiver for discriminating arbitrary coherent states near the quantum limit. 729-733 - Holger Boche, Janis Nötzel:
Arbitrarily small amounts of correlation for arbitrarily varying quantum channels. 734-738 - Helen Ebbe, Stefan Wolf
Distillation of multi-party non-locality with and without partial communication. 739-743 - Alberto Montina
Classical communication rates for simulating quantum resources. 744-748 - Martina Cardone, Daniela Tuninetti
The capacity to within a constant gap of the Gaussian half-duplex relay channel. 749-753 - Martina Cardone, Daniela Tuninetti
The symmetric sum-capacity of the Gaussian half-duplex causal cognitive interference channel to within a constant gap. 754-758 - Reza Khosravi-Farsani:
The capacity region of the wireless ergodic fading Interference Channel with partial CSIT to within one bit. 759-763 - Michael Farag, Bobak Nazer:
The symmetric ergodic capacity of phase-fading interference channels to within a constant gap: 3 users in the strong and very strong regimes. 764-768 - Joseph Jean Boutros, Ezio Biglieri:
Polarization of quasi-static fading channels. 769-773 - Mine Alsan, Emre Telatar:
Polarization improves E0. 774-778 - Saeid Haghighatshoar, Emmanuel Abbe:
Polarization of the Rényi information dimension for single and multi terminal analog compression. 779-783 - Mani Bastani Parizi, Emre Telatar:
On the correlation between polarized BECs. 784-788 - Chung Chan
Cyclic linking network. 789-793 - Shao-Lun Huang, Changho Suh
Euclidean information theory of networks. 794-798 - Suvarup Saha, Randall A. Berry
Parallel linear deterministic interference channels with feedback: Combinatorial structure and separability. 799-803 - Ahmed A. Zewail, Yahya Mohasseb
The deterministic multicast capacity of 4-node relay networks. 804-808 - Emmanuel Baccelli, Philippe Jacquet, Bernard Mans
Multi-lane vehicle-to-vehicle networks with time-varying radio ranges: Information propagation speed properties. 809-813 - Shaoquan Zhang, Minghua Chen
Optimal distributed broadcasting with per-neighbor queues in acyclic overlay networks with arbitrary underlay capacity constraints. 814-818 - Jeongho Jeon, Anthony Ephremides, Marian Codreanu
On hybrid access for cognitive radio systems with time-varying connectivity. 819-823 - Huazi Zhang, Zhaoyang Zhang, Huaiyu Dai:
Mobile conductance and gossip-based information spreading in mobile networks. 824-828 - Giuseppa Alfano
Output statistics of MIMO channels with general input distribution. 829-833 - Marc Desgroseilliers, Olivier Lévêque, Emmanuel Preissmann:
Spatial degrees of freedom of MIMO systems in line-of-sight environment. 834-838 - Apostolos Karadimitrakis, Aris L. Moustakas:
Large deviation approach to the outage optical MIMO capacity. 839-843 - Aris L. Moustakas, Nicholas Bambos:
Power optimization on a random wireless network. 844-848 - Kiryung Lee, Yoram Bresler
Oblique pursuits for compressed sensing with random anisotropic measurements. 849-853 - Suhyuk Kwon, Jian Wang, Byonghyo Shim
Sparse signal recovery via multipath matching pursuit. 854-858 - Jingbo Liu, Jian Jin, Yuantao Gu:
Relation between exact and robust recovery for F-minimization: A topological viewpoint. 859-863 - Chenlu Qiu, Namrata Vaswani:
Recursive sparse recovery in large but structured noise - Part 2. 864-868 - Josep Rifà
Biembeddings of small order hamming STS(n) and APN monomial power permutations. 869-873 - Eitan Yaakobi, Moshe Schwartz
Sequence reconstruction for Grassmann graphs and permutations. 874-878 - George K. Guskov, Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Rank spectrum of propelinear perfect binary codes. 879-881 - Johan Sebastian Rosenkilde Nielsen
Generalised Multi-sequence Shift-Register synthesis using module minimisation. 882-886 - Eyal En Gad, Robert Mateescu, Filip Blagojevic, Cyril Guyot, Zvonimir Bandic:
Repair-optimal MDS array codes over GF(2). 887-891 - Lluis Pamies-Juarez, Henk D. L. Hollmann
Locally repairable codes with multiple repair alternatives. 892-896 - Oliver Kosut:
Polytope codes for distributed storage in the presence of an active omniscient adversary. 897-901 - Yi-Hsuan Kao, Alexandros G. Dimakis, Derek Leong
Distributed storage allocations and a hypergraph conjecture of Erdős. 902-906 - Denise Maurice, Jean-Pierre Tillich, Iryna Andriyanova:
A family of quantum codes with performances close to the hashing bound under iterative decoding. 907-911 - Sangjun Lee, Andreas Klappenecker:
Subsystem codes over nice nearrings. 912-916 - Nicolas Delfosse:
Tradeoffs for reliable quantum information storage in surface codes and color codes. 917-921 - Martianus Frederic Ezerman
Asymmetric quantum codes detecting a single amplitude error. 922-926 - Reza Khosravi-Farsani:
Capacity bounds for wireless ergodic fading Broadcast Channels with partial CSIT. 927-931 - Hon Fah Chong, Ying-Chang Liang
The capacity region of a class of two-user degraded compound broadcast channels. 932-936 - Bo Yang, Desheng Wang, Jun Sun, Yingzhuang Liu:
On the Degrees of Freedom region of general MIMO Broadcast Channel with mixed CSIT. 937-941 - Yuanpeng Liu, Elza Erkip
Bounds on the capacity region of a class of Gaussian broadcast interference channels. 942-946 - Jing Guo, Albert Guillen i Fabregas
Fixed-threshold polar codes. 947-951 - Hessam Mahdavifar, Mostafa El-Khamy
On the construction and decoding of concatenated polar codes. 952-956 - Alptekin Pamuk, Erdal Arikan:
A two phase successive cancellation decoder architecture for polar codes. 957-961 - Fatemeh Arbabjolfaei, Bernd Bandemer, Young-Han Kim, Eren Sasoglu, Lele Wang:
On the capacity region for index coding. 962-966 - Michelle Effros, Salim Y. El Rouayheb, Michael Langberg:
An equivalence between network coding and index coding. 967-971 - Ming Fai Wong, Michael Langberg, Michelle Effros:
On a capacity equivalence between network and index coding and the edge removal problem. 972-976 - Yu-Pin Hsu
The Index Coding problem: A game-theoretical perspective. 977-981 - Abdellatif Zaidi, Shlomo Shamai
On cooperative multiple access channels with delayed CSI. 982-986 - Xinping Yi, David Gesbert
Degrees of freedom of time-correlated broadcast channels with delayed CSIT: The MIMO case. 987-991 - Jinyuan Chen, Petros Elia
MISO broadcast channel with delayed and evolving CSIT. 992-996 - Jinyuan Chen, Sheng Yang, Petros Elia
On the fundamental feedback-vs-performance tradeoff over the MISO-BC with imperfect and delayed CSIT. 997-1001 - Ahmed Badr, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos:
Robust streaming erasure codes based on deterministic channel approximations. 1002-1006 - Cheuk Ting Li, Shenghao Yang, Raymond W. Yeung:
Multi-rate sequential data transmission. 1007-1011 - Derek Leong
On coding for real-time streaming under packet erasures. 1012-1016 - Konstantinos Poularakis, Leandros Tassiulas:
Exploiting user mobility for wireless content delivery. 1017-1021 - Kishore Jaganathan, Samet Oymak, Babak Hassibi:
Sparse phase retrieval: Convex algorithms and limitations. 1022-1026 - Zongming Ma, Yihong Wu:
Volume ratio, sparsity, and minimaxity under unitarily invariant norms. 1027-1031 - Yuxin Chen, Andrea J. Goldsmith, Yonina C. Eldar:
Minimax universal sampling for compound multiband channels. 1032-1036 - Nirav Bhan, Luca Baldassarre, Volkan Cevher
Tractability of interpretability via selection of group-sparse models. 1037-1041 - Yong Jiang, Shu-Tao Xia, Xin-Ji Liu, Fang-Wei Fu:
Incorrigible set distributions and unsuccessful decoding probability of linear codes. 1042-1046 - Olga Kapralova, Ilya Dumer
Spherically punctured Reed-Muller codes. 1047-1051 - Wenhui Li, Vladimir Sidorenko
On decoding Interleaved Chinese Remainder codes. 1052-1056 - Zhiying Wang
Codes for network switches. 1057-1061 - Amit Berman
Retired-page utilization in write-once memory - A coding perspective. 1062-1066 - Anxiao Andrew Jiang, Yue Li, Eyal En Gad, Michael Langberg, Jehoshua Bruck
Joint rewriting and error correction in write-once memories. 1067-1071 - Hidetoshi Ustunomiya, Hiroshi Kamabe:
Constructions of multiple error correcting WOM-Code. 1072-1076 - Mohammad Ali Maddah-Ali, Urs Niesen:
Fundamental limits of caching. 1077-1081 - Farzad Farnoud Hassanzadeh
Building consensus via iterative voting. 1082-1086 - Eitan Yaakobi, Michael Langberg, Jehoshua Bruck
Information-theoretic study of voting systems. 1087-1091 - Saber Salehkaleybar
Averaging consensus over erasure channels via local synchronization. 1092-1096 - Ruchen Duan, Yingbin Liang, Shlomo Shamai
On the capacity region of Gaussian interference channels with state. 1097-1101 - Jung Hyun Bae, Jungwon Lee, Inyup Kang:
The GDOF of 3-user MIMO Gaussian interference channel. 1102-1106 - Jianwei Xie, Sennur Ulukus:
Unified secure DoF analysis of K-user Gaussian interference channels. 1107-1111 - Liang Zhou, Kalle Ruttik, Olav Tirkkonen
Interference canceling power control games in Gaussian interference channels. 1112-1116 - Eren Sasoglu, Alexander Vardy
A new polar coding scheme for strong security on wiretap channels. 1117-1121 - Saygun Onay:
Successive cancellation decoding of polar codes for the two-user binary-input MAC. 1122-1126 - Naveen Goela, Emmanuel Abbe, Michael Gastpar:
Polar codes for broadcast channels. 1127-1131 - Semih Cayci, Orhan Arikan
Lossless polar compression of g-ary sources. 1132-1136 - Sinem Unal, Aaron B. Wagner:
General index coding with side information: Three decoder case. 1137-1141 - Siddhartha Brahma, Christina Fragouli:
Pliable Index Coding: The multiple requests case. 1142-1146 - Lawrence Ong
The multi-sender multicast index coding. 1147-1151 - Karthikeyan Shanmugam
Local graph coloring and index coding. 1152-1156 - Min Li
Distributed base station cooperation with finite alphabet and QoS constraints. 1157-1161 - Gil Katz, Benjamin M. Zaidel, Shlomo Shamai
On layered transmission in clustered cooperative cellular architectures. 1162-1166 - Holger Paul Keeler, Bartlomiej Blaszczyszyn, Mohamed Kadhem Karray:
SINR-based k-coverage probability in cellular networks with arbitrary shadowing. 1167-1171 - Roy Karasik, Osvaldo Simeone
Robust uplink communications over fading channels with variable backhaul connectivity. 1172-1176 - Vahid Aref, Nicolas Macris, Marc Vuffray:
Approaching the rate-distortion limit by spatial coupling with belief propagation and decimation. 1177-1181 - Ramji Venkataramanan, Tuhin Sarkar, Sekhar Tatikonda:
Lossy compression via sparse linear regression: Computationally efficient encoding and decoding. 1182-1186 - Adam Mashiach, Ram Zamir:
Noise-shaped quantization for nonuniform sampling. 1187-1191 - Kasper F. Trillingsgaard, Osvaldo Simeone
Blahut-Arimoto algorithm and code design for action-dependent source coding problems. 1192-1196 - Onkar Dabeer:
Adaptive collaborating filtering: The low noise regime. 1197-1201 - Theodoros Tsiligkaridis, Alfred O. Hero III:
Low separation rank covariance estimation using Kronecker product expansions. 1202-1206 - Navid Tafaghodi Khajavi, Anthony Kuh:
First order Markov chain approximation of microgrid renewable generators covariance matrix. 1207-1211 - Jiun-Hung Yu
Reverse Berlekamp-Massey decoding. 1212-1216 - Ron M. Roth, Pascal O. Vontobel:
Coding for combined block-symbol error correction. 1217-1221 - Li Chen, Xiao Ma:
Iterative soft-decision decoding of Reed-Solomon convolutional concatenated codes. 1222-1226 - Peter Beelen
On the dimension of graph codes with Reed-Solomon component codes. 1227-1231 - John Tadrous, Atilla Eryilmaz, Hesham El Gamal:
Proactive Content Distribution for dynamic content. 1232-1236 - Jaume Pernas, Chau Yuen, Bernat Gastón
Non-homogeneous two-rack model for distributed storage systems. 1237-1241 - Satyajit Thakor
Symmetry in distributed storage systems. 1242-1246 - Toni Ernvall, Salim El Rouayheb, Camilla Hollanti, H. Vincent Poor
Capacity and security of heterogeneous distributed storage systems. 1247-1251 - Farzad Farhadzadeh, Frans M. J. Willems, Sviatoslav Voloshynovskiy
Fundamental limits of identification: Identification rate, search and memory complexity trade-off. 1252-1256 - Mark M. Christiansen, Ken R. Duffy
Brute force searching, the typical set and Guesswork. 1257-1261 - Mohammad Naghshvar, Tara Javidi
Two-dimensional visual search. 1262-1266 - Arun Kumar Singh
Rate-reliability-complexity tradeoff for ML and lattice decoding of full-rate codes. 1267-1271 - Venkat Anantharam, Amin Aminzadeh Gohari
Improved cardinality bounds on the auxiliary random variables in Marton's inner bound. 1272-1276 - Arun Padakandla, S. Sandeep Pradhan:
Achievable rate region for three user discrete broadcast channel based on coset codes. 1277-1281 - Lanying Zhao, Sae-Young Chung:
Marton-Marton coding for a broadcast relay network. 1282-1286 - Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari
A technique for deriving one-shot achievability results in network information theory. 1287-1291 - Yanfei Yan, Cong Ling, Xiaofu Wu:
Polar lattices: Where Arıkan meets Forney. 1292-1296 - Rajai Nasser, Emre Telatar:
Polarization theorems for arbitrary DMCs. 1297-1301 - Mathis Seidl, Andreas Schenk, Clemens Stierstorfer, Johannes B. Huber:
Multilevel polar-coded modulation. 1302-1306 - Woomyoung Park, Alexander Barg:
Controlled polarization for q-ary alphabets. 1307-1311 - Yiwei Song, Natasha Devroye, Huai-Rong Shao, Chiu Ngo:
Lattice coding for the Two-way Two-relay channel. 1312-1316 - Xiaojun Yuan, Tao Yang
Asymptotic sum-capacity of MIMO two-way relay channels within 1/2 log 5/4 bit per user-antenna. 1317-1321 - Michael Heindlmaier, Onurcan Iscan
Scalar Quantize-and-Forward for symmetric half-duplex Two-Way Relay Channels. 1322-1326 - Mohammad Shaqfeh, Ammar Zafar, Hussein M. Alnuweiri, Mohamed-Slim Alouini
Joint opportunistic scheduling and network coding for bidirectional relay channel. 1327-1331 - Inaki Esnaola
A statistical physics approach to the wiretap channel. 1332-1336 - Jianwei Xie, Sennur Ulukus:
Secure degrees of freedom of the Gaussian multiple access wiretap channel. 1337-1341 - Holger Boche, Rafael F. Schaefer:
Capacity results, coordination resources, and super-activation in wiretap channels. 1342-1346 - Pritam Mukherjee, Sennur Ulukus:
Fading wiretap channel with no CSI anywhere. 1347-1351 - Yonatan Kaspi, Neri Merhav:
The zero-delay Wyner-Ziv problem. 1352-1356 - Shun Watanabe
Universal Wyner-Ziv coding for distortion constrained general side-information. 1357-1361 - Farhad Shirani Chaharsooghi
Distributed source coding in absence of common components. 1362-1366 - Kumar Viswanatha, Emrah Akyol
On the role of common codewords in quadratic Gaussian multiple descriptions coding. 1367-1371 - Yinfei Xu, Qiao Wang:
A perturbation proof of the vector Gaussian one-help-one problem. 1372-1376 - Erik Ordentlich:
Denoising as well as the best of any two denoisers. 1377-1381 - Reinhard Heckel, Helmut Bölcskei:
Noisy subspace clustering via thresholding. 1382-1386 - Yuval Lomnitz, Meir Feder:
A universal probability assignment for prediction of individual sequences. 1387-1391 - Daniil Ryabko:
Time-series information and learning. 1392-1395 - Yoshinari Takeishi, Masanori Kawakita, Jun'ichi Takeuchi:
Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity. 1396-1400 - Arya Mazumdar, Yury Polyanskiy, Barna Saha:
On Chebyshev radius of a set in Hamming space and the closest string problem. 1401-1405 - Chin-Fu Liu, Hsiao-feng Francis Lu, Po-Ning Chen
Analysis and practice of uniquely decodable one-to-one code. 1406-1410 - Arnold Filtser, Jiaxi Jin, Aryeh Kontorovich, Ari Trachtenberg:
Efficient determination of the unique decodability of a string. 1411-1415 - Cong Ling, Jean-Claude Belfiore:
Achieving the AWGN channel capacity with lattice Gaussian coding. 1416-1420 - Onur Ozan Koyluoglu, Ankit Singh Rawat
The secrecy capacity of minimum bandwidth cooperative regenerating codes. 1421-1425 - Chao Tian:
Rate region of the (4, 3, 3) exact-repair regenerating codes. 1426-1430 - Chao Tian, Vaneet Aggarwal
Exact-repair regenerating codes via layered erasure correction and block designs. 1431-1435 - Yunghsiang S. Han, Hung-Ta Pai, Rong Zheng, Pramod K. Varshney:
Update-efficient regenerating codes with minimum per-node storage. 1436-1440 - Junyu Chen, Kenneth W. Shum:
Repairing multiple failures in the Suh-Ramchandran regenerating codes. 1441-1445 - Jung Hyun Bae, Jungwon Lee, Inyup Kang:
On the achievable region with point-to-point codes for generalized interference networks. 1446-1450 - Georgios Rodolakis:
Information theoretic cut-set bounds on the capacity of poisson wireless networks. 1451-1455 - Jinfeng Du
Lower bounding models for wireless networks. 1456-1460 - Mingyue Ji, Giuseppe Caire, Andreas F. Molisch:
Optimal throughput-outage trade-off in wireless one-hop caching networks. 1461-1465 - Shaofeng Zou, Yingbin Liang, Shlomo Shamai
Multiple access channel with state uncertainty at transmitters. 1466-1470 - Sreejith Sreekumar, Bikash Kumar Dey, Sibi Raj B. Pillai:
On the adaptive sum-capacity of fading MACs with distributed CSI and non-identical links. 1471-1475 - Yanying Chen, Yiwei Song, Natasha Devroye:
The capacity region of three user Gaussian inverse-compute-and-forward channels. 1476-1480 - Kamyar Moshksar, Babak Mamandipoor, Amir K. Khandani:
On Orthogonal signalling in Gaussian Multiple Access Channel with peak constraints. 1481-1485 - Louay Bazzi, Badih Ghazi, Rüdiger L. Urbanke:
Linear programming decoding of spatially coupled codes. 1486-1490 - Michael Helmling, Stefan Ruzika:
Towards combinatorial LP turbo decoding. 1491-1495 - Shrinivas Kudekar, Jason K. Johnson, Misha Chertkov
Improved linear programming decoding using frustrated cycles. 1496-1500 - Xiaojie Zhang, Paul H. Siegel:
Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers. 1501-1505 - Wataru Kumagai, Masahito Hayashi:
Second order asymptotics for random number generation. 1506-1510 - Rana Ali Amjad, Georg Böcherer:
Fixed-to-variable length distribution matching. 1511-1515 - Peter Harremoës:
Extendable MDL. 1516-1520 - Gaurav Pandey, Ambedkar Dukkipati:
Minimum description length principle for maximum entropy model selection. 1521-1525 - Jakob Hoydis, Romain Couillet, Pablo Piantanida:
Bounds on the second-order coding rate of the MIMO Rayleigh block-fading channel. 1526-1530 - Wei Yang, Giuseppe Durisi
Quasi-static SIMO fading channels at finite blocklength. 1531-1535 - Marco Tomamichel
A tight upper bound for the third-order asymptotics of discrete memoryless channels. 1536-1540 - Pierre Moulin:
Asymptotic Neyman-Pearson games for converse to the channel coding theorem. 1541-1545 - Chinthani Uduwerelle, Terence Chan
The Kraft inequality for EPS systems. 1546-1550 - Daniel Augot, Matthieu Finiasz:
Exhaustive search for small dimension recursive MDS diffusion layers for block ciphers and hash functions. 1551-1555 - Grégory Demay, Ueli Maurer:
Unfair coin tossing. 1556-1560 - Ido Tal, Alexander Vardy
Channel upgrading for semantically-secure encryption on wiretap channels. 1561-1565 - Mohammad Javad Abdoli, Amir Salman Avestimehr:
On degrees of freedom scaling in layered interference networks with delayed CSI. 1566-1570 - Namyoon Lee
Degrees of freedom of completely-connected multi-way interference networks. 1571-1575 - Ye Tian, Aylin Yener:
Degrees of freedom for the MIMO multi-way relay channel. 1576-1580 - Anas Chaaban, Karlheinz Ochs
The degrees of freedom of the MIMO Y-channel. 1581-1585 - Masoud Badiei Khuzani, Hamidreza Ebrahimzadeh Saffar, Ehsan Haj Mirza Alian, Patrick Mitran:
On optimal online power policies for energy harvesting with finite-state Markov channels. 1586-1590 - Kaya Tutuncuoglu, Omur Ozel, Aylin Yener, Sennur Ulukus:
Binary energy harvesting channel with finite energy storage. 1591-1595 - Oner Orhan, Elza Erkip
Throughput maximization for energy harvesting two-hop networks. 1596-1600 - Pol Blasco, Deniz Gündüz
Low-complexity scheduling policies for energy harvesting communication networks. 1601-1605 - Govinda M. Kamath, N. Prakash
Codes with local regeneration. 1606-1610 - Birenjith Sasidharan
High-rate regenerating codes through layering. 1611-1615 - Sreechakra Goparaju, A. Robert Calderbank:
A new sub-packetization bound for minimum storage regenerating codes. 1616-1620 - Hanxu Hou, Kenneth W. Shum, Minghua Chen
BASIC regenerating code: Binary addition and shift for exact repair. 1621-1625 - Xin Yin, Zhao Song, Karin S. Dorman
PREMIER - PRobabilistic error-correction using Markov inference in errored reads. 1626-1630 - Xiaohu Shen, Manohar Shamaiah, Haris Vikalo:
Message passing algorithm for inferring consensus sequence from next-generation sequencing data. 1631-1634 - Soheil Mohajer, Abolfazl S. Motahari, David Tse:
Reference-based DNA shotgun sequencing: Information theoretic limits. 1635-1639 - Abolfazl S. Motahari, Kannan Ramchandran, David Tse, Nan Ma:
Optimal DNA shotgun sequencing: Noisy reads are as good as noiseless reads. 1640-1644 - Mainak Chowdhury, Andrea Goldsmith, Tsachy Weissman:
Reliable uncoded communication in the SIMO MAC via low-complexity decoding. 1645-1649 - Yasutada Oohama:
Converse coding theorems for identification via multiple access channels. 1650-1654 - Shan Lu, Jun Cheng, Wei Hou, Yoichiro Watanabe:
Generalized construction of signature code for multiple-access adder channel. 1655-1659 - Gozde Ozcan, Mustafa Cenk Gursoy:
Achievable rate regions of cognitive multiple access channel with sensing errors. 1660-1664 - Ehsan Nekouei
Distributed cognitive multiple access networks: Power control, scheduling and multiuser diversity. 1665-1669 - Ian P. Mulholland, Mark F. Flanagan
Minimum distance distribution of irregular generalized LDPC code ensembles. 1670-1674 - Nicola di Pietro
New results on Construction A lattices based on very sparse parity-check matrices. 1675-1679 - Asit Kumar Pradhan, Arunkumar Subramanian, Andrew Thangaraj
Deterministic constructions for large girth protograph LDPC codes. 1680-1684 - Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Correcting combinations of errors and erasures with Euclidean geometry LDPC codes. 1685-1689 - Min Jang
Asymptotic analysis of LDPC codes with depth-2 connectivity distributions over BEC. 1690-1694 - Anagnostis Tsiatmas, Frans M. J. Willems, Constant P. M. J. Baggen:
Square Root approximation to the Poisson Channel. 1695-1699 - Kobra Akbari Dadamahalleh, Ghosheh Abed Hodtani
A general upper bound for FSO channel capacity with input-dependent Gaussian noise and the corresponding optimal input distribution. 1700-1704 - Mansoor I. Yousefi, Frank R. Kschischang
Integrable communication channels and the nonlinear fourier transform. 1705-1709 - Mansoor I. Yousefi, Frank R. Kschischang
Communication over fiber-optic channels using the nonlinear Fourier transform. 1710-1714 - Boulat A. Bash, Saikat Guha, Dennis Goeckel, Don Towsley
Quantum noise limited optical communication with low probability of detection. 1715-1719 - Yanina Shkel
Converse bounds for assorted codes in the finite blocklength regime. 1720-1724 - Eli Haim, Yuval Kochman, Uri Erez:
The importance of tie-breaking in finite-blocklength bounds. 1725-1729 - Gonzalo Vazquez-Vilar, Adrià Tauste Campo
The meta-converse bound is tight. 1730-1733 - Victoria Kostina
Channels with cost constraints: Strong converse and dispersion. 1734-1738 - Ioannis Kontoyiannis, Sergio Verdú:
Optimal lossless compression: Source varentropy and dispersion. 1739-1743 - Yucel Altug, Aaron B. Wagner, Ioannis Kontoyiannis:
Lossless compression with moderate error probability. 1744-1748 - Michael B. Baer:
On the redundancy of Huffman codes with exponential objectives. 1749-1753 - Takahiro Ota, Hiroyoshi Morita:
On antidictionary coding based on compacted substring automaton. 1754-1758 - Hirosuke Yamamoto
Almost instantaneous FV codes. 1759-1763 - Ravi Tandon, Syed Ali Jafar
Two-user MISO broadcast channel: Synergistic benefits of alternating CSIT. 1764-1768 - Song-Nam Hong
Generalized degrees of freedom for network-coded cognitive interference channel. 1769-1773 - Gokul Sridharan, Wei Yu:
Degrees of freedom of MIMO cellular networks with two cells and two users per cell. 1774-1778 - Mehdi Ashraphijuo, Vaneet Aggarwal
Generalized degrees of freedom region for MIMO interference channel with feedback. 1779-1783 - Omur Ozel, Khurram Shahzad, Sennur Ulukus:
Optimal scheduling for energy harvesting transmitters with hybrid energy storage. 1784-1788 - Wei Mao, Babak Hassibi:
On the capacity of a communication system with energy harvesting and a limited battery. 1789-1793 - Oner Orhan, Deniz Gündüz
Delay-constrained distortion minimization for energy harvesting transmission over a fading channel. 1794-1798 - Hajar Mahdavi-Doost, Roy D. Yates:
Energy harvesting receivers: Finite battery capacity. 1799-1803 - G. Vignesh, Andrew Thangaraj
Quasi-cyclic regenerating codes for distributed storage: Existence and near-MSR examples. 1804-1808 - Terence H. Chan
Robust multiple description coding - Joint Coding for source and storage. 1809-1813 - Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Optimal locally repairable codes and connections to matroid theory. 1814-1818 - Natalia Silberstein, Ankit Singh Rawat
Optimal locally repairable codes via rank-metric codes. 1819-1823 - Jie Xing, Toby Berger:
Energy efficient neurons with generalized inverse Gaussian conditional and marginal hitting times. 1824-1828 - Hui Li, Dongning Guo:
On the capacity-achieving input for additive inverse Gaussian channels. 1829-1833 - Andrew W. Eckford, Peter J. Thomas:
Capacity of a simple intercellular signal transduction channel. 1834-1838 - Christopher Rose
Signaling with identical tokens: Lower bounds with energy constraints. 1839-1843 - Arash Einolghozati, Mohsen Sardari, Faramarz Fekri
Relaying in diffusion-based molecular communication. 1844-1848 - Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari
Non-asymptotic output statistics of Random Binning and its applications. 1849-1853 - Sy-Quoc Le, Vincent Yan Fu Tan, Mehul Motani
On the dispersions of the discrete memoryless interference channel. 1859-1863 - Ramanan Subramanian, Badri N. Vellambi
An improved bound on information loss due to finite block length in a Gaussian line network. 1864-1868 - Lai Wei, Daniel J. Costello Jr., Thomas E. Fuja:
Coded cooperation using rate-compatible spatially-coupled codes. 1869-1873 - David G. M. Mitchell
On the minimum distance of generalized spatially coupled LDPC codes. 1874-1878 - Alan Jule, Iryna Andriyanova:
Performance bounds for spatially-coupled LDPC codes over the block erasure channel. 1879-1883 - Dmitri V. Truhachev:
Universal multiple access via spatially coupling data transmission. 1884-1888 - Son Hoang Dau
Balanced Sparsest generator matrices for MDS codes. 1889-1893 - Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Separating redundancy of linear MDS codes. 1894-1898 - Sheng Lin, Kai Shi, Douglas S. Stones, Guangping Xu
New pattern erasure codes. 1899-1903 - Srikanth Pai Bantwal, B. Sundar Rajan:
A lattice singleton bound. 1904-1908 - Flemming Topsøe:
Universal coding in order structures and isotone regression. 1909-1913 - Jie Zhang, En-Hui Yang, John C. Kieffer:
Redundancy analysis in lossless compression of a binary tree via its minimal DAG representation. 1914-1918 - Neri Merhav, Wojciech Szpankowski:
Average redundancy of the Shannon code for Markov sources. 1919-1923 - Luciana Vitale, Alvaro Martín, Gadiel Seroussi:
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation. 1924-1928 - Apostolos Destounis, Mohamad Assaad, Mérouane Debbah, Bessem Sayadi:
A randomized probing scheme for increasing the stability region of multicarrier systems. 1929-1933 - Matthew Johnston, Eytan H. Modiano, Isaac Keslassy
Channel probing in communication systems: Myopic policies are not always optimal. 1934-1938 - Javad Behrouzi Moghaddam, Amir K. Khandani:
Energy efficiency of Gaussian channel with random data arrival. 1939-1943 - Dilip Bethanabhotla, Giuseppe Caire, Michael J. Neely:
Utility optimal scheduling and admission control for adaptive video streaming in small cell networks. 1944-1948 - Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr:
On efficient min-cut approximations in half-duplex relay networks. 1949-1953 - Mohit Thakur, Gerhard Kramer
Relay positioning for multicast relay networks. 1954-1958 - Milos Jorgovanovic, Matthew Weiner, David Tse, Borivoje Nikolic
Relay scheduling and interference cancellation for quantize-map-and-forward cooperative relaying. 1959-1963 - Muhammad Mehboob Fareed, Mohamed-Slim Alouini
Efficient incremental relaying. 1964-1668 - M. Oguzhan Külekci
Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees. 1969-1973 - Ryo Nomura
Second-order Slepian-Wolf coding theorems for non-mixed and mixed sources. 1974-1978 - Remi A. Chou
Data compression with nearly uniform output. 1979-1983 - Sheng Huang, Mikael Skoglund:
On achievability of linear source coding over finite rings. 1984-1988 - Li Peng, Albert Guillen i Fabregas
Improved exponents and rates for bit-interleaved coded modulation. 1989-1993 - Daiki Yoda, Hideki Ochiai
A reduced-complexity multilevel coded modulation for APSK signaling. 1994-1998 - Rudolf Mathar, Meik Dorpinghaus:
Threshold optimization for capacity-achieving discrete input one-bit output quantization. 1999-2003 - Jacob Goldberger:
Improved MIMO detection based on successive tree approximations. 2004-2008 - Hon Fah Chong, Ying-Chang Liang
Secrecy capacity region of a class of two-user Gaussian MIMO BC with degraded message sets. 2009-2013 - David A. Karpuk, Iván Blanco-Chacón, Camilla Hollanti:
Probability bounds for an eavesdropper's correct decision over a MIMO wiretap channel. 2014-2018 - Sergey Loyka, Charalambos D. Charalambous
Further results on optimal signaling over secure MIMO channels. 2019-2023 - Onur Güngör, Can Emre Koksal, Hesham El Gamal:
On secrecy outage capacity of fading channels under relaxed delay constraints. 2024-2028 - Reza Khosravi-Farsani:
The K-user interference channel: Strong interference regime. 2029-2033 - Diana Maamari, Daniela Tuninetti
On the K-user cognitive interference channel with cumulative message sharing sum-capacity. 2034-2038 - Alex Dytso
On the capacity of interference channels with partial codebook knowledge. 2039-2043 - Mohammad Kazemi, Azadeh Vosoughi:
On the capacity of the state-dependent cognitive interference channel. 2044-2048 - Nan Liu, Wei Kang:
A new outer bound on the capacity region of a class of Z-interference channels. 2049-2053 - Xiao Ma, Chulong Liang, Kechao Huang, Qiutao Zhuang:
Obtaining extra coding gain for short codes by block Markov superposition transmission. 2054-2058 - Roxana Smarandache:
Pseudocodewords from Bethe permanents. 2059-2063 - Alberto Tarable, Alessandro Nordio
Anytime reliable LDPC convolutional codes for networked control over wireless channel. 2064-2068 - Rafael Misoczki, Jean-Pierre Tillich, Nicolas Sendrier, Paulo S. L. M. Barreto:
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes. 2069-2073 - Wessam Mesbah
Rate maximization of multilayer transmission over Rayleigh fading channels. 2074-2078 - Alberto Gil C. P. Ramos, Miguel R. D. Rodrigues:
Characterization and optimization of the constrained capacity of coherent fading channels driven by arbitrary inputs: A Mellin transform based asymptotic approach. 2079-2083 - Günther Koliander
Generic correlation increases noncoherent MIMO capacity. 2084-2088 - Adriano Pastore, Jakob Hoydis, Javier Rodríguez Fonollosa
Sharpened capacity lower bounds of fading MIMO channels with imperfect CSI. 2089-2093 - Martin Mittelbach, Eduard A. Jorswieck
Information regular and ψ-mixing channels. 2094-2098 - Daphney-Stavroula Zois
Non-linear smoothers for discrete-time, finite-state Markov chains. 2099-2103 - Meysam Asadi, Ramezan Paravi Torghabeh, Narayana P. Santhanam:
Estimation in slow mixing, long memory channels. 2104-2108 - Guangyue Han:
A randomized approach to the capacity of finite-state channels. 2109-2113 - Yonglong Li, Guangyue Han:
Concavity of mutual information rate of finite-state channels. 2114-2118 - Olga Galinina
Stabilizing multi-channel slotted aloha for machine-type communications. 2119-2123 - David Morales-Jiménez
Ergodic sum-rate of proportional fair scheduling with multiple antennas. 2124-2128 - Yue Ling Che, Rui Zhang
On spatial capacity in Ad-Hoc networks with threshold based scheduling. 2129-2133 - Arash Saber Tehrani, Alexandros G. Dimakis, Giuseppe Caire:
Optimal measurement matrices for neighbor discovery. 2134-2138 - Sang-Woon Jeon, Chien-Yi Wang, Michael Gastpar:
Computation over Gaussian networks with orthogonal components. 2139-2143 - Arun Padakandla:
Computing sum of sources over an arbitrary multiple access channel. 2144-2148 - Ali Bereyhi, Mohsen Bahrami, Mahtab Mirmohseni, Mohammad Reza Aref:
Empirical coordination in a triangular multiterminal network. 2149-2153 - Chien-Yi Wang, Sang-Woon Jeon, Michael Gastpar:
Multi-round computation of type-threshold functions in collocated Gaussian networks. 2154-2158 - Behzad Ahmadi, Osvaldo Simeone
Two-way communication with adaptive data acquisition. 2159-2163 - Badri N. Vellambi
Conveying discrete memoryless sources over networks: When are zero-rate edges dispensable? 2164-2168 - Farrokh Etezadi, Ashish Khisti:
Real-time streaming of Gauss-Markov sources over sliding window burst-erasure channels. 2169-2173 - Mojtaba Vaezi, Fabrice Labeau
Extended subspace error localization for rate-adaptive distributed source coding. 2174-2178 - Ayse Ünsal, Raymond Knopp:
Distributed sensing and transmission of sporadic random samples. 2179-2183 - Nikhil Karamchandani, Massimo Franceschetti:
Rumor source detection under probabilistic sampling. 2184-2188 - Berkan Dulek
Optimal channel switching in the presence of stochastic signaling. 2189-2193 - Steffen Schober:
Some worst-case bounds for Bayesian estimators of discrete distributions. 2194-2198 - Sirin Nitinawarat, Venugopal V. Veeravalli:
Controlled sensing for multihypothesis testing based on Markovian observations. 2199-2203 - Yeow-Khiang Chia, Kittipong Kittichokechai
On secure source coding with side information at the encoder. 2204-2208 - Kittipong Kittichokechai
Secure source coding with a public helper. 2209-2213 - Siu-Wai Ho
Source coding with side information for error free perfect secrecy systems. 2214-2218 - Curt Schieler, Paul Cuff:
Rate-distortion theory for secrecy systems. 2219-2223 - Ankit Singh Rawat
Secure locally repairable codes for distributed storage systems. 2224-2228 - Song-Nam Hong
Structured lattice codes for 2×2×2 MIMO interference channel. 2229-2233 - Jingge Zhu
Lattice codes for many-to-one cognitive interference networks. 2234-2238 - María Constanza Estela, Cong Ling, Jean-Claude Belfiore:
Barnes-Wall lattices for the symmetric interference channel. 2239-2243 - Tanumay Datta, A. Chockalingam, Emanuele Viterbo
Gaussian sampling based lattice decoding. 2244-2248 - Andrew E. Gelfand, Jinwoo Shin, Michael Chertkov
Belief Propagation for Linear Programming. 2249-2253 - Christopher J. Quinn, Jalal Etesami, Negar Kiyavash, Todd P. Coleman:
Robust directed tree approximations for networks of stochastic processes. 2254-2258 - Sanggyun Kim, Rui Ma, Diego Mesa, Todd P. Coleman:
Efficient Bayesian inference methods via convex optimization and optimal transport. 2259-2263 - Christopher J. Quinn, Ali Pinar, Negar Kiyavash:
Optimal bounded-degree approximations of joint distributions of networks of stochastic processes. 2264-2268 - Yuan-Zhu Guo, Hsuan-Yin Lin, Stefan M. Moser:
The asymptotic capacity of noncoherent single-input multiple-output fading channels with memory and feedback. 2269-2273 - Alex Alvarado
High-SNR asymptotics of mutual information for discrete constellations. 2274-2278 - Hassan Ghozlan, Gerhard Kramer
On Wiener phase noise channels at high Signal-to-Noise Ratio. 2279-2283 - Luca Barletta, Maurizio Magarini, Arnaldo Spalvieri:
Tight upper and lower bounds to the information rate of the phase noise channel. 2284-2288 - Philippe Jacquet, Dimitris Milioris, Wojciech Szpankowski:
Classification of Markov sources through joint string complexity: Theory and experiments. 2289-2293 - Amichai Painsky, Saharon Rosset, Meir Feder:
Memoryless representation of Markov processes. 2294-2298 - Paul Tune, Hung X. Nguyen, Matthew Roughan
Hidden Markov model identifiability via tensors. 2299-2303 - Mehdi Molkaraie, Hans-Andrea Loeliger:
Partition function of the Ising model via factor graph duality. 2304-2308 - Ibrahim Issa, Silas L. Fong
Two-hop interference channels: Impact of linear time-varying schemes. 2309-2313 - Henning Maier, Rudolf Mathar:
Cyclic Interference Neutralization on the full-duplex relay-interference channel. 2309-2313 - Matthew S. Nokleby, Bobak Nazer:
Amplify-and-compute: Function computation over layered networks. 2314-2318 - Matthieu R. Bloch, Jörg Kliewer:
Strong coordination over a line network. 2319-2323 - Arash Behboodi, Pablo Piantanida:
Mixed Noisy Network Coding. 2324-2328 - Changho Suh
Interactive function computation. 2329-2333 - Sreeram Kannan, Pramod Viswanath:
Multi-terminal function multicasting in undirected graphs. 2334-2338 - Jasper Goseling, Michael Gastpar, Jos H. Weber:
Physical-layer network coding on the random-access channel. 2339-2343 - Zhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar:
Compute-and-Forward: Multiple bi-directional sessions on the line network. 2344-2348 - Naci Saldi
Randomized quantization and optimal design with a marginal constraint. 2349-2353 - Jun Muramatsu
Lossy source code using a constrained random number generator. 2354-2358 - Vinith Misra, Krishnamurthy Viswanathan:
Sequential functional quantization. 2359-2363 - John Z. Sun, Vivek K. Goyal
Rate loss in distributed functional source coding. 2364-2368 - Eitan Yaakobi, Anxiao Andrew Jiang, Jehoshua Bruck
In-memory computing of Akers logic array. 2369-2373 - Yongjune Kim
Redundancy allocation of partitioned linear block codes. 2374-2378 - Ori Rottenstreich, Amit Berman
Compression for fixed-width memories. 2379-2383 - Qian Guo
An efficient interpolation-based systematic encoder for low-rate Blaum-Roth codes. 2384-2388 - B. Santhana Krishnan, Ayalvadi Ganesh, D. Manjunath:
On connectivity thresholds in superposition of random key graphs on random geometric graphs. 2389-2393 - Lifeng Lai, Lauren M. Huie:
Simultaneously generating multiple keys in many to one networks. 2394-2398 - Shaunak Mishra, Christina Fragouli, Vinod M. Prabhakaran, Suhas N. Diggavi:
Using feedback for secrecy over graphs. 2399-2403 - Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran:
Secure network coding for distributed secret sharing with low communication cost. 2404-2408 - Daniel Zahavi, Ron Dabora:
On the sum-rate capacity of the phase fading z-interference channel with a relay in the weak interference regime. 2414-2418 - Byungjun Kang, Si-Hyeon Lee, Sae-Young Chung, Changho Suh
A new achievable scheme for interference relay channels. 2419-2423 - Mohammad Kazemi, Azadeh Vosoughi:
On the capacity region of the partially cooperative relay cognitive interference channel. 2424-2427 - Daniel Zahavi, Lili Zhang, Ivana Maric, Ron Dabora, Andrea J. Goldsmith, Shuguang Cui
Diversity-multiplexing tradeoff for the interference channel with a relay. 2428-2432 - Naruomi Obata, Yung-Yih Jian, Kenta Kasai, Henry D. Pfister
Spatially-coupled multi-edge type LDPC codes with bounded degrees that achieve capacity on the BEC under BP decoding. 2433-2437 - Kosuke Sakata, Kenta Kasai, Kohichi Sakaniwa:
Spatially-coupled precoded rateless codes. 2438-2442 - Andrei Giurgiu, Nicolas Macris, Rüdiger L. Urbanke:
And now to something completely different: Spatial coupling as a proof technique. 2443-2447 - Ryunosuke Ohashi, Kenta Kasai, Keigo Takeuchi:
Multi-dimensional spatially-coupled codes. 2448-2452 - Seyed Hamed Hassani, Nicolas Macris, Rüdiger L. Urbanke:
The space of solutions of coupled XORSAT formulae. 2453-2457 - Vincent Y. F. Tan:
A formula for the capacity of the general Gel'fand-Pinsker channel. 2458-2462 - Jun Muramatsu
Channel code using a constrained Random number generator. 2463-2467 - Yuguang Gao, Aaron B. Wagner:
Achieving capacity of large alphabet discrete memoryless channels. 2468-2472 - Tetsunao Matsuta, Tomohiko Uyematsu:
A general formula for capacity of channels with action-dependent states. 2473-2477 - Lan V. Truong
Capacity of a Structural Binary Symmetric Channel. 2478-2482 - Ying Liu, Alan S. Willsky:
Recursive FMP for distributed inference in Gaussian graphical models. 2483-2487 - Vincent Gripon, Michael G. Rabbat:
Reconstructing a graph from path traces. 2488-2492 - Rashish Tandon, Pradeep Ravikumar:
On the difficulty of learning power law graphical models. 2493-2497 - Ying Liu, Oliver Kosut, Alan S. Willsky:
Sampling from Gaussian graphical models using subgraph perturbations. 2498-2502 - Nima Soltani, Andrea Goldsmith:
Inferring neural connectivity via measured delay in directed information estimates. 2503-2507 - Nan Jiang, Yang Yang, Anders Høst-Madsen, Zixiang Xiong:
On the minimum energy of sending Gaussian multiterminal sources over the Gaussian MAC. 2508-2512 - Pulkit Grover
"Information-friction" and its impact on minimum energy per communicated bit. 2513-2517 - Aslan Tchamkerten, Venkat Chandar, Giuseppe Caire:
Energy and sampling constrained asynchronous communication. 2518-2522 - Zouheir Rezki
On the capacity of multiple access and broadcast fading Channels with full channel state information at low power regime. 2523-2527 - Vitaly Abdrashitov, Muriel Médard, Dana Moshkovitz:
Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel. 2528-2523 - Shunsuke Ihara:
Upper bounds on error probabilities for continuous-time white Gaussian channels with feedback. 2533-2537 - Himanshu Asnani, Haim H. Permuter
Capacity of a POST channel with and without feedback. 2538-2542 - Bo Bernhardsson:
Using a Gaussian channel Twice. 2543-2546 - Tsung-Yi Chen, Adam R. Williamson, Richard D. Wesel:
Variable-length coding with feedback: Finite-length codewords and periodic decoding. 2547-2551 - Adam R. Williamson, Tsung-Yi Chen, Richard D. Wesel:
Reliability-based error detection for feedback communication with low latency. 2552-2556 - Kazuho Watanabe
Rate-distortion function for gamma sources under absolute-log distortion measure. 2557-2561 - Da Wang, Arya Mazumdar, Gregory W. Wornell:
A rate-distortion theory for permutation spaces. 2562-2566 - Eva C. Song, Paul Cuff, H. Vincent Poor
A bit of secrecy for Gaussian source compression. 2567-2571 - Jesús Gómez-Vilardebó
Privacy of smart meter systems with an alternative energy source. 2572-2576 - Photios A. Stavrou, Charalambos D. Charalambous
Variational equalities of directed information and applications. 2577-2581 - Jun Geng, Weiyu Xu, Lifeng Lai:
Quickest search over multiple sequences with mixed observations. 2582-2586 - Taposh Banerjee, Venugopal V. Veeravalli, Alexander G. Tartakovsky
Decentralized data-efficient quickest change detection. 2587-2591 - Yasin Yilmaz, Xiaodong Wang:
Asymptotically optimal and bandwith-efficient decentralized detection. 2592-2596 - Yasin Yilmaz, George V. Moustakides, Xiaodong Wang:
Optimal sequential parameter estimation. 2597-2601 - Joong Bum Rhim, Vivek K. Goyal
Social teaching: Being informative vs. being right in sequential decision making. 2602-2606 - Hongchao Zhou, Venkat Chandar, Gregory W. Wornell:
Low-density random matrices for secret key extraction. 2607-2611 - Wittawat Kositwattanarerk, Soon Sheng Ong, Frédérique E. Oggier:
Wiretap encoding of lattices from number fields using codes over Fp. 2612-2616 - Julia Pinchak:
Wiretap codes: Families of lattices satisfying the Belfiore-Solé secrecy function conjecture. 2617-2620 - Cong Ling, Laura Luzzi, Matthieu R. Bloch:
Secret key generation from Gaussian sources using lattice hashing. 2621-2625 - Kamal Singh, Sibi Raj B. Pillai, Bikash Kumar Dey:
On fading MAC channels with asymmetric CSI. 2626-2630 - Ashish Khisti, Amos Lapidoth:
Multiple access channels with intermittent feedback and side information. 2631-2635 - Mohammad Osmani-Bojd, Assadallah Sahebalam, Ghosheh Abed Hodtani
Multiple-access relay channels with non-causal side information at the relay. 2636-2640 - Arun Padakandla, S. Sandeep Pradhan:
Achievable rate region based on coset codes for multiple access channel with states. 2641-2645 - Ali Talari, Nazanin Rahnavard:
LT-AF codes: LT codes with Alternating Feedback. 2646-2650 - Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson:
Combinatorial optimization for improving QC LDPC codes performance. 2651-2655 - Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A revolving iterative algorithm for decoding algebraic quasi-cyclic LDPC codes. 2656-2660 - Kyung-Joong Kim, Jin-Ho Chung, Kyeongcheol Yang:
Necessary conditions for quasi-cyclic LDPC codes to have a given girth. 2661-2665 - Yun Li, Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal outlier hypothesis testing. 2666-2670 - Wenxiang Dong
Rooting out the rumor culprit from suspects. 2671-2675 - Leonardo Baldassini, Oliver Johnson, Matthew Aldridge
The capacity of adaptive group testing. 2676-2680 - Tadashi Wadayama:
An analysis on non-adaptive group testing based on sparse pooling graphs. 2681-2685 - Yin Sun, Can Emre Koksal, Ness B. Shroff:
Capacity of compound MIMO Gaussian channels with additive uncertainty. 2686-2690 - Stefano Rini, Andrea Goldsmith:
On the capacity of the MIMO cognitive interference channel. 2691-2695 - Zhixiang Deng, Fei Lang, Bao-Yun Wang, Shengmei Zhao:
Capacity of a class of relay channel with orthogonal components and non-causal channel state. 2696-2700 - Sundar R. Krishnamurthy, Syed Ali Jafar
Precoding based network Alignment and the capacity of a finite field X channel. 2701-2705 - Christian Matt
The one-time pad revisited. 2706-2710 - Ueli Maurer:
Authentication amplification by synchronization. 2711-2714 - Shun Watanabe
Non-asymptotic analysis of privacy amplification via Rényi entropy and inf-spectral entropy. 2715-2719 - Junji Shikata:
Formalization of information-theoretic security for key agreement, revisited. 2720-2724 - Ziyu Shao, Shuo-Yen Robert Li:
Distributed optimization for wireless networks with inter-session network coding. 2725-2729 - Ming He, Zongpeng Li, Chuan Wu
On uniform matroidal networks. 2730-2734 - Sudeep U. Kamath, David N. C. Tse:
On the Generalized Network Sharing bound and edge-cut bounds for network coding. 2735-2739 - Gauri Joshi, Emina Soljanin
Round-robin overlapping generations coding for fast content download. 2740-2744 - A. Taufiq Asyhari
GMI and mismatched-CSI outage exponents in MIMO block-fading channels. 2745-2749 - Ritesh Kolte
Generalized diversity-multiplexing tradeoff of half-duplex relay networks. 2750-2754 - Ali Sekmen, Akram Aldroubi
Nonlinear approximations for motion and subspace segmentation. 2755-2759 - Fardad Raisali, Farzad Farnoud Hassanzadeh
Weighted rank aggregation via relaxed integer programming. 2765-2769 - Arnob Ghosh, Saswati Sarkar:
Quality sensitive price competition in spectrum oligopoly. 2770-2774 - V. Shashank, Navin Kashyap:
Lattice coding for strongly secure compute-and-forward in a bidirectional relay. 2775-2779 - Eric Graves, Tan F. Wong:
A coding approach to guarantee information integrity against a Byzantine relay. 2780-2784 - Liang Chen:
Cooperation with an untrusted relay in broadcast channels. 2785-2789 - Jun Zhao
Secure k-connectivity in wireless sensor networks under an on/off channel model. 2790-2794 - Lav R. Varshney:
Two way communication over exponential family type channels. 2795-2799 - Seyed Ershad Banijamali, Kamyar Moshksar, Amir K. Khandani:
On The effect of self-interference in Gaussian two-way channels with erased outputs. 2800-2804 - Khoa D. Nguyen
Delay-exponent of decode-forward streaming. 2805-2809 - Vincent Y. F. Tan:
Error exponents for the relay channel. 2810-2814 - Behzad Amiri, Jörg Kliewer, Lara Dolecek:
Analysis and enumeration of absorbing sets for non-binary graph-based codes. 2815-2819 - Yuta Tsujii, Guanghui Song, Jun Cheng, Yoichiro Watanabe:
Approaching multiple-access channel capacity by nonbinary coding-spreading. 2820-2824 - Takayuki Nozaki
Message passing algorithm with MAP decoding on zigzag cycles for non-binary LDPC codes. 2825-2829 - Takayuki Nozaki
Weight distribution for non-binary cluster LDPC code ensemble. 2830-2834 - Neri Merhav:
Exponential error bounds on Parameter Modulation-Estimation for Memoryless Channels. 2835-2839 - Yu Xiang, Young-Han Kim:
Interactive hypothesis testing against independence. 2840-2844 - Minhua Chen, John D. Lafferty:
Mismatched estimation and relative entropy in vector Gaussian channels. 2845-2849 - Kartik Venkat, Tsachy Weissman, Yair Carmon, Shlomo Shamai
The role of lookahead in estimation under Gaussian noise. 2850-2854 - Xuanxuan Lu, Tiffany Jing Li, Yang Liu:
Soft-encoding distributed coding for parallel relay systems. 2855-2859 - Jesper H. Sørensen, Cedomir Stefanovic
Coded splitting tree protocols. 2860-2864 - Yuksel Ozan Basciftci, Can Emre Koksal, Füsun Özgüner:
To obtain or not to obtain CSI in the presence of hybrid adversary. 2865-2869 - Yeow Meng Chee
Matrix codes and multitone frequency shift keying for power line communications. 2870-2874 - Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Tight bounds for universal compression of large alphabets. 2875-2879 - Siddharth Jain, Rakesh Kumar Bansal:
On large deviation property of recurrence times. 2880-2884 - Siddharth Jain, Rakesh Kumar Bansal:
On match lengths and the asymptotic behavior of Sliding Window Lempel-Ziv algorithm for zero entropy sequences. 2885-2889 - Chen Feng
Communication over finite-ring matrix channels. 2890-2894 - Yuki Fujii, Tadashi Wadayama:
An analysis on minimum s-t cut capacity of random graphs with specified degree distribution. 2895-2899 - Chih-Chun Wang:
Linear network coding capacity for broadcast erasure channels with feedback, receiver coordination, and arbitrary security requirement. 2900-2904 - Sophia Athanasiadou, Marios Gatzianas
Stable and capacity achieving XOR-based policies for the Broadcast Erasure Channel with feedback. 2905-2909 - K. Pavan Srinath, B. Sundar Rajan:
Fast-decodable MIDO codes with large coding gain. 2910-2914 - Lakshmi Prasad Natarajan, B. Sundar Rajan:
Full-rate, full-diversity, finite feedback space-time schemes with minimum feedback and transmission duration. 2915-2919 - Erdem Koyuncu
Variable-length channel quantizers for maximum diversity and array gains. 2920-2924 - Frederic Sala, Lara Dolecek:
Counting sequences obtained from the synchronization channel. 2925-2929 - Nicolas Bitouze, Lara Dolecek:
Synchronization from insertions and deletions under a non-binary, non-uniform source. 2930-2934 - Yu-Chih Huang
Energy-efficient communication in the presence of synchronization errors. 2935-2939 - Mojtaba Rahmati, Tolga M. Duman:
An upper bound on the capacity of non-binary deletion channels. 2940-2944 - Pak Hou Che, Mayank Bakshi
Reliable deniable communication: Hiding messages in noise. 2945-2949 - Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik:
Artificial intersymbol interference (ISI) to exploit receiver imperfections for secrecy. 2950-2954 - Sanket Satpathy, Paul Cuff:
Secure cascade channel synthesis. 2955-2959 - Samir Medina Perlaza
On the impact of network-state knowledge on the Feasibility of secrecy. 2960-2964 - Yossef Steinberg
The degraded broadcast channel with non-causal action-dependent side information. 2965-2969 - Lele Wang, Eren Sasoglu, Bernd Bandemer, Young-Han Kim:
A comparison of superposition coding schemes. 2970-2974 - Shirin Saeedi Bidokhti, Vinod M. Prabhakaran, Suhas N. Diggavi:
A block Markov encoding scheme for broadcasting nested message sets. 2975-2979 - Seckin Anil Yildirim
Cooperative broadcasting with successive refinement based compression. 2980-2984 - Roy Timo, Tobias J. Oechtering
Successive refinement with conditionally less noisy side information. 2985-2989 - Luis Salamanca, Juan José Murillo-Fuentes
Improving the BP estimate over the AWGN channel using Tree-structured expectation propagation. 2990-2994 - Mohamad Mostafa, Werner G. Teich, Jürgen Lindner:
Comparison of belief propagation and iterative threshold decoding based on dynamical systems. 2995-2999 - Henry D. Pfister
On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes. 3000-3004 - Irina E. Bocharova, Boris D. Kudryashov, Nikolay I. Makarov, Rolf Johannesson:
Near maximum-likelihood decoding of Generalized LDPC and woven graph codes. 3005-3009 - Chu-Hsiang Huang, Yao Li, Lara Dolecek:
Gallager B LDPC Decoder with Transient and permanent errors. 3010-3014 - Po-Ning Chen
Equidistant codes meeting the Plotkin bound are Not optimal on the binary symmetric channel. 3015-3019 - Dariush Divsalar:
Extending Divsalar's bound to nonbinary codes with two dimensional constellations. 3020-3024 - Marco Dalai
An "Umbrella" bound of the Lovász-Gallager type. 3025-3029 - Daichi Yugawa, Tadashi Wadayama:
Finite length analysis on listing failure probability of Invertible Bloom Lookup Tables. 3030-3034 - Kalle Lähetkangas, Marian Codreanu
Energy efficient power allocation for MIMO multihop networks. 3035-3039 - Benjamin Larrousse, Samson Lasaulce:
Coded power control: Performance analysis. 3040-3044 - Wonseok Jeon, Sae-Young Chung:
The capacity of wireless channels: A physical approach. 3045-3049 - Amir K. Khandani:
Media-based modulation: A new approach to wireless transmission. 3050-3054 - Shun Watanabe
Non-asymptotic and second-order achievability bounds for source coding with side-information. 3055-3059 - Osvaldo Simeone
Source coding with in-block memory and controllable causal side information. 3060-3064 - Thomas Laich, Michèle A. Wigger:
Utility of encoder side information for the lossless Kaspi/Heegard-B erger problem. 3065-3069 - Naqueeb Ahmad Warsi:
One-shot source coding with coded side information available at the decoder. 3070-3074 - Wei Kang, Nan Liu:
The Ahlswede-Han conjecture on channel with coded side information at the decoder. 3075-3079 - Christian Koller, Martin Haenggi
Joint channel/network coding for star networks. 3080-3084 - Weifei Zeng, Viveck R. Cadambe
On the tightness of the generalized network sharing bound for the two-unicast-Z network. 3085-3089 - Mingchao Yu, Neda Aboutorab, Parastoo Sadeghi
Rapprochement between instantly decodable and random linear network coding. 3090-3094 - Neda Aboutorab, Parastoo Sadeghi
Instantly decodable network coding for delay reduction in cooperative data exchange systems. 3095-3099 - Ralph Tanbourgi, Holger Jaekel, Friedrich K. Jondral:
Cooperative relaying in a poisson field of interferers: A diversity order analysis. 3100-3104 - Mehdi M. Molu, Norbert Goertz:
Optimality range of Largest Eigenmode Relaying with partial channel state information in the relay. 3105-3109 - Koralia N. Pappi, George K. Karagiannidis
How sensitive is compute-and-forward to channel estimation errors? 3110-3114 - Mohammad Reza Heidarpour, Murat Uysal
Fractionally spaced equalization for broadband amplify-and-forward cooperative systems. 3115-3119 - Vladimir Edemskiy
Autocorrelation and linear complexity of quaternary sequences of period 2p based on cyclotomic classes of order four. 3120-3124 - Zi Long Liu
On optimal binary Z-complementary pair of odd period. 3125-3129 - Zi Long Liu
Quadratic weight vector for tighter aperiodic Levenshtein bound. 3130-3134 - Guang Gong, Fei Huo, Yang Yang:
Large zero correlation zone of Golay pairs and QAM Golay pairs. 3135-3139 - Tae-Kyo Lee, Jin-Ho Chung, Kyeongcheol Yang:
An upper bound on the partial-period correlation of Zadoff-Chu sequences. 3140-3144 - Lav R. Varshney:
To surprise and inform. 3145-3149 - Ueli Maurer:
Conditional equivalence of random systems and indistinguishability proofs. 3150-3154 - Vinod M. Prabhakaran, Anand D. Sarwate
Assisted sampling of correlated sources. 3155-3159 - Ye Wang, Prakash Ishwar
Information-theoretically secure three-party computation with One corrupted party. 3160-3164 - Himanshu Tyagi, Prakash Narayan:
How many queries will resolve common randomness? 3165-3169
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-12-26 00:34 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: