Abstract is missing.
- An information-theoretic protocol compilerAmit Sahai. 1-4 [doi]
- To code or not to code: RevisitedVictoria Kostina, Sergio Verdú. 5-9 [doi]
- Results on combinatorial joint source-channel codingYuval Kochman, Arya Mazumdar, Yury Polyanskiy. 10-14 [doi]
- On uncoded transmission and blocklengthYuval Kochman, Gregory W. Wornell. 15-19 [doi]
- Reduced complexity window decoding schedules for coupled LDPC codesNajeeb ul Hassan, Ali Emre Pusane, Michael Lentmaier, Gerhard P. Fettweis, Daniel J. Costello Jr.. 20-24 [doi]
- A simple proof of threshold saturation for coupled vector recursionsArvind Yedla, Yung-Yih Jian, Phong S. Nguyen, Henry D. Pfister. 25-29 [doi]
- Efficient termination of spatially-coupled codesKoji Tazoe, Kenta Kasai, Kohichi Sakaniwa. 30-34 [doi]
- Common randomness amplification: A constructive viewGregory Demay, Ueli Maurer. 35-39 [doi]
- Scheduling with privacy constraintsSachin Kadloor, Negar Kiyavash, Parv Venkitasubramaniam. 40-44 [doi]
- A new achievable region for Gaussian multiple descriptions based on subset typicalityKumar Viswanatha, Emrah Akyol, Kenneth Rose. 45-49 [doi]
- On transmission of multiple Gaussian sources over a Gaussian MAC using a VQLC mappingPål Anders Floor, Anna N. Kim, Tor A. Ramstad, Ilangko Balasingham. 50-54 [doi]
- Source coding with conditionally less noisy side informationRoy Timo, Tobias J. Oechtering, Michele A. Wigger. 55-59 [doi]
- On the role of deterministic models in K × K × K wireless networksIlan Shomorony, Amir Salman Avestimehr. 60-64 [doi]
- Proof of the outage probability conjecture for MISO channelsEmmanuel Abbe, Shao-Lun Huang, Emre Telatar. 65-69 [doi]
- Source coding for dependent sourcesMichael Langberg, Michelle Effros. 70-74 [doi]
- The arithmetic codexIgnacio Cascudo, Ronald Cramer, Chaoping Xing. 75-79 [doi]
- The complexity of information theoretic secure computationYuval Ishai. 80 [doi]
- Differential privacy as a protocol constraintIlya Mironov. 81-83 [doi]
- Throughput maximization for an energy harvesting communication system with processing costOner Orhan, Deniz Gündüz, Elza Erkip. 84-88 [doi]
- Gaussian wiretap channel with a batteryless energy harvesting transmitterOmur Ozel, Ersen Ekrem, Sennur Ulukus. 89-93 [doi]
- The energy harvesting multiple access channel with energy storage lossesKaya Tutuncuoglu, Aylin Yener. 94-98 [doi]
- On secure multiparty sampling for more than two partiesManoj Prabhakaran, Vinod M. Prabhakaran. 99-103 [doi]
- Characterizing pseudoentropySalil P. Vadhan, Colin Jia Zheng. 104-108 [doi]
- Overcoming weak expectationsYevgeniy Dodis, Yu Yu. 109-113 [doi]
- Achieving the capacity of any DMC using only polar codesDavid Sutter, Joseph M. Renes, Frédéric Dupuis, Renato Renner. 114-118 [doi]
- Design of binary polar codes with arbitrary kernelVera Miloslavskaya, Peter Trifonov. 119-123 [doi]
- A Construction of lattices from polar codesYanfei Yan, Cong Ling. 124-128 [doi]
- On common information and the encoding of sources that are not successively refinableKumar Viswanatha, Emrah Akyol, Tejaswi Nanjundaswamy, Kenneth Rose. 129-133 [doi]
- On feedback, cribbing, and causal state-information on the multiple-access channelAnnina Bracher, Amos Lapidoth, Yossef Steinberg. 134-138 [doi]
- Gaussian wiretap channel with an amplitude constraintOmur Ozel, Ersen Ekrem, Sennur Ulukus. 139-143 [doi]
- Short-message noisy network coding with partial source cooperationJinfeng Du, Ming Xiao, Mikael Skoglund, Shlomo Shamai. 144-147 [doi]
- On the asymptotic spectrum of the error probability of composite networksArash Behboodi, Pablo Piantanida. 148-152 [doi]
- Secret-key agreement over a non-coherent block-fading MIMO wiretap channelMattias Andersson, Ashish Khisti, Mikael Skoglund. 153-157 [doi]
- Communication amid uncertaintyMadhu Sudan. 158-161 [doi]
- On Witsenhausen's counterexample: The asymptotic vector caseChiranjib Choudhuri, Urbashi Mitra. 162-166 [doi]
- On channels with action-dependent statesBehzad Ahmadi, Osvaldo Simeone. 167-171 [doi]
- Comments on unknown channelsKristen Ann Woyach, Kate Harrison, Gireeja Ranade, Anant Sahai. 172-176 [doi]
- Privacy amplification theorem for bounded storage eavesdropperShun Watanabe, Yasutada Oohama. 177-181 [doi]
- On vector Gaussian multiterminal source codingJia Wang, Jun Chen. 182-186 [doi]
- Worst-case source for distributed compression with quadratic distortionIlan Shomorony, Amir Salman Avestimehr, Himanshu Asnani, Tsachy Weissman. 187-191 [doi]
- MIDO space-time codes from associative and nonassociative cyclic algebrasAndrew Steele, Susanne Pumplün, Frédérique E. Oggier. 192-196 [doi]
- Irregular product codesMasoud Alipour, Omid Etesami, Ghid Maatouk, Amin Shokrollahi. 197-201 [doi]
- Constructing good QC-LDPC codes by pre-lifting protographsDavid G. M. Mitchell, Roxana Smarandache, Daniel J. Costello Jr.. 202-206 [doi]
- Full- or half-duplex? A capacity analysis with bounded radio resourcesVaneet Aggarwal, Melissa Duarte, Ashutosh Sabharwal, N. K. Shankaranarayanan. 207-211 [doi]
- Towards integrating Quantize-Map-Forward relaying into LTEEmre Atsan, Raymond Knopp, Suhas N. Diggavi, Christina Fragouli. 212-216 [doi]
- An outer bound for the memoryless two-user interference channel with general cooperationDaniela Tuninetti. 217-221 [doi]
- Derandomized sampling algorithm for lattice decodingZheng Wang, Cong Ling. 222-226 [doi]
- Combining superposition coding and binning achieves capacity for the Gaussian cognitive interference channelStefano Rini, Ernest Kurniawan, Andrea J. Goldsmith. 227-231 [doi]
- Lossy computing of correlated sources with fractional samplingXi Liu, Osvaldo Simeone, Elza Erkip. 232-236 [doi]
- Error exponents for block Markov superposition encoding with varying decoding latencyGlenn J. Bradford, J. Nicholas Laneman. 237-241 [doi]
- Robust distributed compression for cloud radio access networksSeok-Hwan Park, Osvaldo Simeone, Onur Sahin, Shlomo Shamai. 242-246 [doi]
- Multilevel 2-cell t-write codesAman Bhatia, Aravind R. Iyengar, Paul H. Siegel. 247-251 [doi]
- Bit-fixing codes for multi-level cellsAnxiao Jiang, Yue Li, Jehoshua Bruck. 252-256 [doi]
- A DC-free multi-mode run-length limited coding schemeCarl H. Heymann, Hendrik C. Ferreira, Jos H. Weber. 257-261 [doi]
- On the non-robustness of essentially conditional information inequalitiesTarik Kaced, Andrei E. Romashchenko. 262-266 [doi]
- Compact representation of polymatroid axioms for random variables with conditional independenciesSatyajit Thakor, Alex J. Grant, Terence Chan. 267-271 [doi]
- Characterizing the entropy function region via extreme raysQi Chen, Raymond W. Yeung. 272-276 [doi]
- Capacity of a class of relay channels with stateInaki Estella Aguerri, Deniz Gündüz. 277-281 [doi]
- Non-binary protograph-based LDPC codes for short block-lengthsBen-Yue Chang, Dariush Divsalar, Lara Dolecek. 282-286 [doi]
- Asynchronous control for coupled Markov decision systemsMichael J. Neely. 287-291 [doi]
- Sequential group testing with graph constraintsAmin Karbasi, Morteza Zadimoghaddam. 292-296 [doi]
- Construction of irregular histograms by penalized maximum likelihood: A comparative studyPanu Luosto, Ciprian Doru Giurcaneanu, Petri Kontkanen. 297-301 [doi]
- Comparison of dynamic model selection with infinite HMM for statistical model change detectionEiichi Sakurai, Kenji Yamanishi. 302-306 [doi]
- Coherence-based probabilistic recovery guarantees for sparsely corrupted signalsAnnina Bracher, Graeme Pope, Christoph Studer. 307-311 [doi]
- On random binning versus conditional codebook methods in multiple descriptions codingEmrah Akyol, Kumar Viswanatha, Kenneth Rose. 312-316 [doi]
- Multi-terminal source coding: Zero-rate encoders cannot enlarge the rate regionBadri N. Vellambi. 317-321 [doi]
- Characterizing the rate region of the coded side-information problemIngmar Land, Claudio Weidmann, Badri N. Vellambi. 322-326 [doi]
- Spatially coupled quantum LDPC codesIryna Andriyanova, Denise Maurice, Jean-Pierre Tillich. 327-331 [doi]
- Iterative soft-decision decoding of Hermitian codesLi Chen. 332-336 [doi]
- From channel codes to computation codesFrançois Simon. 337-341 [doi]
- Networks with in-block memoryGerhard Kramer. 342-346 [doi]
- Stability and capacity through evacuation timesLeonidas Georgiadis, Georgios S. Paschos, Leandros Tassiulas, Lavy Libman. 347-351 [doi]
- Capacity region of two symmetric nearby erasure channels with channel state feedbackChih-Chun Wang. 352-356 [doi]
- Bounds on the belief propagation threshold of non-binary LDPC codesLeonid Geller, David Burshtein. 357-361 [doi]
- Extending monte carlo methods to factor graphs with negative and complex factorsMehdi Molkaraie, Hans-Andrea Loeliger. 362-366 [doi]
- Suppressing pseudocodewords by penalizing the objective of LP decodingXishuo Liu, Stark C. Draper, Benjamin Recht. 367-371 [doi]
- On multicasting nested message sets over combination networksShirin Saeedi Bidokhti, Vinod M. Prabhakaran, Suhas N. Diggavi. 372-376 [doi]
- Achieving the capacity of the N-relay Gaussian diamond network within logn bitsBobbie Chern, Ayfer Özgür. 377-380 [doi]
- Optimizing Quantize-Map-and-Forward relaying for Gaussian diamond networksAyan Sengupta, I-Hsiang Wang, Christina Fragouli. 381-385 [doi]
- Derivative of the relative entropy over the poisson and Binomial channelCamilo G. Taborda, Fernando Pérez-Cruz. 386-390 [doi]
- Optimal reliability over a class of binary-input channels with feedbackMohammad Naghshvar, Michele A. Wigger, Tara Javidi. 391-395 [doi]
- On channel capacity of communication via antenna arrays with receiver noise matchingRalf R. Müller, Bruhtesfa E. Godana, Mohammad Ali Sedaghat, Johannes B. Huber. 396-400 [doi]
- Expurgation exponent of leaked information in privacy amplification for binary sourcesShun Watanabe. 401-405 [doi]
- Secure channel simulationAmin Gohari, Mohammad Hossein Yassaee, Mohammad Reza Aref. 406-410 [doi]
- Lattice coding for multiple access channels with common message and additive interferenceMohammad Farzad Pourbabaee, Mohammad Javad Emadi, Arash Gholami Davoodi, Mohammad Reza Aref. 412-416 [doi]
- Analysis of lattice codes for the many-to-one interference channelMaría Constanza Estela, Laura Luzzi, Cong Ling, Jean-Claude Belfiore. 417-421 [doi]
- Integer low-density lattices based on construction ANicola di Pietro, Joseph Jean Boutros, Gilles Zémor, Loïc Brunel. 422-426 [doi]
- Reference based genome compressionBobbie Chern, Idoia Ochoa, Alexandros Manolakos, Albert No, Kartik Venkat, Tsachy Weissman. 427-431 [doi]
- A theoretical approach to gene network identificationJean-Camille Birget, Desmond S. Lun, Anthony Wirth, Dawei Hong. 432-436 [doi]
- Molecular communication between two populations of bacteriaArash Einolghozati, Mohsen Sardari, Faramarz Fekri. 437-441 [doi]
- Grassmannian signalling achieves the ergodic high SNR capacity of the non-coherent MIMO relay channel within an SNR-independent gapRamy H. Gohary, Halim Yanikomeroglu. 442-446 [doi]
- Achievable sum-rates in Gaussian multiple-access channels with MIMO-AF-relay and direct linksFrederic Knabe, Omar Mohamed, Carolin Huppert. 447-451 [doi]
- Two-source extractors for leaky sourcesYu Yu, Xiangxue Li, Haifeng Qian. 452-456 [doi]
- Decode-and-forward for the Gaussian relay channel via standard AWGN coding and decodingAnatoly Khina, Or Ordentlich, Uri Erez, Yuval Kochman, Gregory W. Wornell. 457-461 [doi]
- LDPC-based coded cooperative jamming codesAlexandre J. Pierrot, Matthieu R. Bloch. 462-466 [doi]
- Secret key agreement using correlated sources over the generalized multiple access channelSomayeh Salimi, Mikael Skoglund. 467-471 [doi]
- On function computation over a cascade networkMilad Sefidgaran, Aslan Tchamkerten. 472-476 [doi]
- Chernoff bounds for analysis of rate-compatible sphere-packing with numerous transmissionsTsung-Yi Chen, Dariush Divsalar, Richard D. Wesel. 477-481 [doi]
- The combinatorial structure of linear deterministic interference channelsSuvarup Saha, Randall A. Berry. 482-486 [doi]
- Approaching maximum likelihood decoding of finite length LDPC codes via FAID diversityDavid Declercq, Erbao Li, Bane V. Vasic, Shiva Kumar Planjery. 487-491 [doi]
- Finite-length performance of spatially-coupled LDPC codes under TEP decodingPablo M. Olmos, Fernando Pérez-Cruz, Luis Salamanca, Juan José Murillo-Fuentes. 492-496 [doi]
- On locality in distributed storage systemsAnkit Singh Rawat, Sriram Vishwanath. 497-501 [doi]
- Superposition coding for linear operator channels over finite fieldsShenghao Yang. 502-506 [doi]
- Network coding with computation alignmentNaveen Goela, Changho Suh, Michael Gastpar. 507-511 [doi]
- On the hardness of entropy minimization and related problemsMladen Kovacevic 0001, Ivan Stanojevic, Vojin Senk. 512-516 [doi]
- Information theoretic cutting of a cakePayam Delgosha, Amin Aminzadeh Gohari. 517-521 [doi]
- On the estimation of entropy for unknown support sizeSteffen Schober, Ahmed Mansour. 522-526 [doi]
- Fundamental limits on power consumption for lossless signal reconstructionPulkit Grover. 527-531 [doi]
- Improved joint turbo decoding and physical-layer network codingMaria Cláudia Ferrari de Castro, Bartolomeu F. Uchôa Filho, Tiago T. V. Vinhoza, Mario de Noronha-Neto, João Barros. 532-536 [doi]
- On the additive complexity of the cyclotomic FFT algorithmPeter Trifonov. 537-541 [doi]
- On the entropy of sums of Bernoulli random variables via the Chen-Stein methodIgal Sason. 542-546 [doi]
- Sequential normalized maximum likelihood in log-loss predictionWojciech Kotlowski, Peter Grünwald. 547-551 [doi]
- On cascade source coding with a side information "vending machine"Behzad Ahmadi, Osvaldo Simeone, Chiranjib Choudhuri, Urbashi Mitra. 552-556 [doi]
- An MDL-based change-detection algorithm with its applications to learning piecewise stationary memoryless sourcesHiroki Kanazawa, Kenji Yamanishi. 557-561 [doi]
- Relative information loss in the PCABernhard C. Geiger, Gernot Kubin. 562-566 [doi]
- A robust RFPI-based 1-bit compressive sensing reconstruction algorithmAmin Movahed, Ashkan Panahi, Giuseppe Durisi. 567-571 [doi]
- Diversity versus channel knowledge at finite block-lengthWei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy. 572-576 [doi]
- Degrees of freedom of MISO broadcast channel with perfect delayed and imperfect current CSITSheng Yang, Mari Kobayashi, David Gesbert, Xinping Yi. 577-581 [doi]
- Refined analysis of the Poisson channel in the high-photon-efficiency regimeLigong Wang, Gregory W. Wornell. 582-586 [doi]
- Coded cooperative data exchange for multiple unicastsShahriar Etemadi Tajbakhsh, Parastoo Sadeghi. 587-591 [doi]
- Two-way communication with energy exchangePetar Popovski, Osvaldo Simeone. 592-596 [doi]
- Retargeting LT codes using XORs at the relayShirish Karande. 597-601 [doi]
- An extension to the chain graph representation of an achievable schemeStefano Rini. 602-606 [doi]
- Uniform random number generation by using sparse matrixJun Muramatsu, Shigeki Miyake. 607-611 [doi]
- Recurrent AMS one-sided channelsFrançois Simon. 612-616 [doi]
- Strong secrecy in arbitrarily varying wiretap channelsIgor Bjelakovic, Holger Boche, Jochen Sommerfeld. 617-621 [doi]
- Equivocations for the simple substitution cipher with erasure-prone ciphertextWillie K. Harrison, Steven W. McLaughlin. 622-626 [doi]
- Simultaneously generating multiple keys and multi-commodity flow in networksLifeng Lai, Siu-Wai Ho. 627-631 [doi]
- Analog network coding in general SNR regime: Performance of network simplificationSamar Agnihotri, Sidharth Jaggi, Minghua Chen. 632-636 [doi]
- Golay meets Hadamard: Golay-paired Hadamard matrices for fast compressed sensingLu Gan, Kezhi Li, Cong Ling. 637-641 [doi]
- Compressing multisets using triesVincent Gripon, Michael G. Rabbat, Vitaly Skachek, Warren J. Gross. 642-646 [doi]
- Analysis of sparse representations using bi-orthogonal dictionariesMikko Vehkaperä, Yoshiyuki Kabashima, Saikat Chatterjee, Erik Aurell, Mikael Skoglund, Lars K. Rasmussen. 647-651 [doi]
- Aspect of security in the cognitive relay assisted interference channelsMd. Zahurul I. Sarkar, Tharmalingam Ratnarajah. 652-656 [doi]
- On the achievable rate region of a new Gaussian wiretap channel with side informationHamid G. Bafghi, Babak Seyfe, Mahtab Mirmohseni, Mohammad Reza Aref. 657-661 [doi]
- Gaussian wiretap lattice codes from binary self-dual codesFuchun Lin, Frédérique E. Oggier. 662-666 [doi]
- Limited feedback for interference alignment in the K-user MIMO Interference ChannelMohsen Rezaee, Maxime Guillaud. 667-671 [doi]
- Uniform and non-uniform delay-rate tradeoffs in partial ergodic interference alignmentHenning Maier, Rudolf Mathar. 672-676 [doi]
- Achievable rate regions for compound multiple access channel with channel state informationMostafa Monemizadeh, Ghosheh Abed Hodtani. 677-681 [doi]
- The analog formulation of sparsity implies infinite divisibility and rules out Bernoulli-Gaussian priorsArash Amini, Ulugbek Kamilov, Michael Unser. 682-686 [doi]