Table of Contents

• How to design an efficient lattice coding schemeRam Zamir. 1-4 [doi]
• Compute-and-forward for discrete memoryless networksBobak Nazer, Michael Gastpar. 5-9 [doi]
• Lattices from codes for harnessing interference: An overview and generalizationsYu-Chih Huang, Krishna R. Narayanan. 10-14 [doi]
• Generalized low-density (GLD) latticesJoseph Jean Boutros, Nicola di Pietro, Nour Basha. 15-19 [doi]
• Message variance convergence condition for generalizations of LDLC latticesBrian M. Kurkoski, Ricardo Antonio Parrao Hernandez. 20-24 [doi]
• The multiple access channel with an untrusted relayAhmed A. Zewail, Aylin Yener. 25-29 [doi]
• Reliable deniable communication with channel uncertaintyPak Hou Che, Mayank Bakshi, Chung Chan, Sidharth Jaggi. 30-34 [doi]
• A new upperbound for the oblivious transfer capacity of discrete memoryless channelsK. Sankeerth Rao, Vinod M. Prabhakaran. 35-39 [doi]
• An efficient code for Adversarial Wiretap channelPengwei Wang, Reihaneh Safavi-Naini. 40-44 [doi]
• Interactive code to correct and detect omniscient Byzantine adversariesZhiqing Xiao, Yunzhou Li, Ming Zhao, Jing Wang. 45-49 [doi]
• Linear programming bounds for robust locally repairable storage codesMohammad Ali Tebbi, Terence H. Chan, Chi Wan Sung. 50-54 [doi]
• A code design framework for multi-rack distributed storageMohammad Ali Tebbi, Terence H. Chan, Chi Wan Sung. 55-59 [doi]
• Locally Repairable RapidRAID Systematic Codes - One simple convoluted way to get it allAnwitaman Datta. 60-64 [doi]
• The fundamental theorem of distributed storage systems revisitedPing Hu, Kenneth W. Shum, Chi Wan Sung. 65-69 [doi]
• Locally repairable codes over a networkQuan Yu, Chi Wan Sung, Terence H. Chan. 70-74 [doi]
• Reductions techniques for establishing equivalence between different classes of network and index coding problemsAlex Sprintson. 75-76 [doi]
• A few meta-theorems in network information theoryYu Xiang, Young Han Kim. 77-81 [doi]
• Is there a canonical network for network information theory?Michelle Effros, Michael Langberg. 82-86 [doi]
• Cyclic interference alignment and cancellation in 3-user X- networks with minimal backhaulHenning Maier, Rudolf Mathar. 87-91 [doi]
• Symmetric Degrees of Freedom of the MIMO 3-way channel with MT × MR antennasHenning Maier, Anas Chaaban, Rudolf Mathar. 92-96 [doi]
• On achievable degrees of freedom of 3-user MIMO interference channelsLu Yang, Wei Zhang. 97-101 [doi]
• On feasibility of linear interference alignment with symbol extension for two-cell MIMO interfering multiple access channelEdin Zhang, Chiachi Huang. 102-106 [doi]
• Enabling the multi-user generalized degrees of freedom in the Gaussian cellular channelRick Fritschek, Gerhard Wunder. 107-111 [doi]
• The semantic secrecy rate of the lattice Gaussian coding for the Gaussian wiretap channelHamed Mirghasemi, Jean-Claude Belfiore. 112-116 [doi]
• Construction and secrecy gain of a family of 5-modular latticesXiaolu Hou, Fuchun Lin, Frédérique E. Oggier. 117-121 [doi]
• Arithmetic geometry of compute and forwardM. A. Vazquez-Castro. 122-126 [doi]
• Shaping low-density lattice codes using Voronoi integersNuwan S. Ferdinand, Brian M. Kurkoski, Behnaam Aazhang, Matti Latva-aho. 127-131 [doi]
• On the Ice-Wine problem: Recovering linear combination of codewords over the Gaussian Multiple Access ChannelShahab Ghasemi-Goojani, Hamid Behroozi. 132-136 [doi]
• Relative generalized Hamming weights of one-point algebraic geometric codesOlav Geil, Stefano Martin, Ryutaroh Matsumoto, Diego Ruano, Yuan Luo. 137-141 [doi]
• Rank weight hierarchy of some classes of cyclic codesJérôme Ducoat, Frédérique E. Oggier. 142-146 [doi]
• Gilbert-Varshamov-like lower bounds for deletion-correcting codesFrederic Sala, Ryan Gabrys, Lara Dolecek. 147-151 [doi]
• Repeated deletion channelsBernhard Haeupler, Michael Mitzenmacher. 152-156 [doi]
• A complete MacWilliams theorem for convolutional codesChing-Yi Lai, Min-Hsiu Hsieh, Hsiao-feng Lu. 157-161 [doi]
• Syndrome decoding of symbol-pair codesMasanori Hirotomo, Makoto Takita, Masakatu Morii. 162-166 [doi]
• Feedback systems using non-binary LDPC codes with a limited number of transmissionsKasra Vakilinia, Adam R. Williamson, Sudarsan Vasista Srinivasan Ranganathan, Dariush Divsalar, Richard D. Wesel. 167-171 [doi]
• Quantum synchronizable codes from quadratic residue codes and their supercodesYixuan Xie, Jinhong Yuan, Yuichiro Fujiwara. 172-176 [doi]
• On the capacity and the zero-error capacity of k-resilient AND anti-collusion codesHiroki Koga. 177-181 [doi]
• Haplotype assembly: An information theoretic viewHongbo Si, Haris Vikalo, Sriram Vishwanath. 182-186 [doi]
• Spatially-coupled counter braidsEirik Rosnes. 187-191 [doi]
• S-AMP: Approximate message passing for general matrix ensemblesBurak Çakmak, Ole Winther, Bernard H. Fleury. 192-196 [doi]
• Variable-length lossy source code using a constrained-random-number generatorJun Muramatsu. 197-201 [doi]
• Revisiting the rate-distortion theory using smooth max Rényi divergenceTomohiko Uyematsu, Tetsunao Matsuta. 202-206 [doi]
• Delay exponent of variable-length random binning for point-to-point transmissionNan Zhang, Badri N. Vellambi, Khoa D. Nguyen. 207-211 [doi]
• Fundamental limits of universal lossless one-to-one compression of parametric sourcesAhmad Beirami, Faramarz Fekri. 212-216 [doi]
• Using T-codes as locally decodable source codesUlrich Speidel, T. Aaron Gulliver, Ali Makhdoumi, Muriel Médard. 217-221 [doi]
• Stochastic Complexity for tree modelsJun-ichi Takeuchi, Andrew R. Barron. 222-226 [doi]
• Reliable, deniable and hidable communication: A quick surveyPak Hou Che, Swanand Kadhe, Mayank Bakshi, Chung Chan, Sidharth Jaggi, Alex Sprintson. 227-231 [doi]
• Coding for wiretap channels: Channel resolvability and semantic securityAndrew Thangaraj. 232-236 [doi]
• On the oblivious transfer capacity region of the binary erasure broadcast channelManoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran, Suhas N. Diggavi. 237-241 [doi]
• Under the radar attacks in dynamical systems: Adversarial privacy utility tradeoffsParth Pradhan, Parv Venkitasubramaniam. 242-246 [doi]
• On generalized active attacks by causal adversaries in networksOliver Kosut, Li-Wei Kao. 247-251 [doi]
• An exploration of the role of principal inertia components in information theoryFlávio du Pin Calmon, Mayank Varia, Muriel Médard. 252-256 [doi]
• Rényi entropy and quantization for densitiesChristoph Bunte, Amos Lapidoth. 257-261 [doi]
• Capacity bounds for certain channels with states and the energy harvesting channelWei Mao, Babak Hassibi. 262-266 [doi]
• Searching with measurement dependent noiseYonatan Kaspi, Ofer Shayevitz, Tara Javidi. 267-271 [doi]
• Correlation between channel state and information source with empirical coordination constraintMaël Le Treust. 272-276 [doi]
• Unitary precoding for integer-forcing MIMO linear receiversAmin Sakzad, Emanuele Viterbo. 277-281 [doi]
• Performance of precoded integer-forcing for closed-loop MIMO multicastElad Domanovitz, Uri Erez. 282-286 [doi]
• Multi-dimensional and non-uniform constellation optimization via the special orthogonal groupDavid A. Karpuk, Camilla Hollanti. 287-291 [doi]
• Effects of mobility on user energy consumption and total throughput in a massive MIMO systemAris L. Moustakas, Luca Sanguinetti, Mérouane Debbah. 292-296 [doi]
• Multicell coordinated scheduling with multiuser ZF beamforming: Policies and performance boundsMin Li, Iain B. Collings, Stephen V. Hanly, Chunshan Liu, Phil Whiting. 297-301 [doi]
• Sparse Bayesian learning approach for streaming signal recoveryUditha L. Wijewardhana, Marian Codreanu. 302-306 [doi]
• Codes for wireless wiretap channelsJean-Claude Belfiore. 307-308 [doi]
• On measures of information theoretic securityShuiyin Liu, Yi Hong, Emanuele Viterbo. 309-310 [doi]
• Superposition lattice coding for Gaussian broadcast channel with confidential messageLi-Chia Choo, Cong Ling. 311-315 [doi]
• A USRP implementation of wiretap lattice codesJinlong Lu, J. Harshan, Frédérique E. Oggier. 316-320 [doi]
• Key capacity region for a cellular source modelHuishuai Zhang, Yingbin Liang, Lifeng Lai. 321-325 [doi]
• Max-min fair wireless energy transfer for secure multiuser communication systemsDerrick Wing Kwan Ng, Robert Schober. 326-330 [doi]
• Capacity of the energy harvesting channel with energy arrival information at the receiverOmur Ozel, Kaya Tutuncuoglu, Sennur Ulukus, Aylin Yener. 331-335 [doi]
• State amplification and state masking for the binary energy harvesting channelKaya Tutuncuoglu, Omur Ozel, Aylin Yener, Sennur Ulukus. 336-340 [doi]
• Recent advances in joint wireless energy and information transferSuzhi Bi, Chin Keong Ho, Rui Zhang 0006. 341-345 [doi]
• Inferring the dynamic range of electrode current by using an information theoretic model of cochlear implant stimulationXiao Gao, David B. Grayden, Mark D. McDonnell. 346-350 [doi]
• On ℓp-norm computation over multiple-access channelsSteffen Limmer, Slawomir Stanczak. 351-355 [doi]
• Can we measure the difficulty of an optimization problem?Tansu Alpcan, Tom Everitt, Marcus Hutter. 356-360 [doi]
• Secure degrees of freedom region of the Gaussian interference channel with secrecy constraintsJianwei Xie, Sennur Ulukus. 361-365 [doi]
• Polarization as a novel architecture to boost the classical mismatched capacity of B-DMCsMine Alsan, Emre Telatar. 366-370 [doi]
• Universal polar decoding with channel knowledge at the encoderMine Alsan. 371-375 [doi]
• Sequential decoding of polar codes with arbitrary binary kernelVera Miloslavskaya, Peter Trifonov. 376-380 [doi]
• A new multiple folded successive cancellation decoder for polar codesHarish Vangala, Emanuele Viterbo, Yi Hong. 381-385 [doi]
• Successive cancellation permutation decoding of Reed-Solomon codesPeter Trifonov. 386-390 [doi]
• Decoding delay reduction in network coded cooperative systems with intermittent status updateMohammad S. Karim, Neda Aboutorab, Ali A. Nasir, Parastoo Sadeghi. 391-395 [doi]
• Locality-preserving secure network codingXuan Guang, Jiyong Lu, Fang-Wei Fu. 396-400 [doi]
• Inter-session network coding for transmitting multiple layered streams over single-hop wireless networksMohammad Esmaeilzadeh, Neda Aboutorab. 401-405 [doi]
• From LDPC to chunked network codesShenghao Yang, Bin Tang. 406-410 [doi]
• Feedback enhances the security of degraded broadcast channels with confidential messages and causal channel state informationBin Dai, Zheng Ma. 411-415 [doi]
• Secure communication of correlated sources over broadcast channelsFei Lang, Zhixiang Deng, Bao-Yun Wang. 416-420 [doi]
• On the secrecy capacity region of the Wiretap Broadcast ChannelMeryem Benammar, Pablo Piantanida. 421-425 [doi]
• Secrecy measures for broadcast channels with receiver side information: Joint vs individualAhmed S. Mansour, Rafael F. Schaefer, Holger Boche. 426-430 [doi]
• Capacity estimation of two-dimensional channels using Sequential Monte CarloChristian Andersson Naesseth, Fredrik Lindsten, Thomas B. Schön. 431-435 [doi]
• Explicit constructions for type-1 QC-LDPC codes with girth at least tenJuhua Wang, Guohua Zhang, Quan Zhou, Yang Yang, Rong Sun. 436-440 [doi]
• LT code design for inactivation decodingFrancisco Lazaro Blasco, Gianluigi Liva, Gerhard Bauch. 441-445 [doi]
• Non-uniform spatial couplingFanny Jardel, Joseph J. Boutros. 446-450 [doi]
• Delay-exponent of bilayer anytime codeMd. Noor-A.-Rahim, Khoa D. Nguyen, Gottfried Lechner. 451-455 [doi]
• Optimization of graph based codes for belief propagation decodingSachini Jayasooriya, Sarah J. Johnson, Lawrence Ong, Regina Berretta. 456-460 [doi]
• Design of non-binary quasi-cyclic LDPC codes by absorbing set removalBehzad Amiri, Jorge Arturo Flores Castro, Lara Dolecek. 461-465 [doi]
• Low-complexity channel resolvability codes for the symmetric multiple-access channelRemi A. Chou, Matthieu R. Bloch, Jörg Kliewer. 466-470 [doi]
• Enhanced trellis coded multiple access (ETCMA)Alberto G. Perotti, Branislav M. Popovic. 471-475 [doi]
• Posterior matching scheme for Gaussian multiple access channel with feedbackLan V. Truong. 476-480 [doi]
• Linearly-coupled fountain codes for network-coded multiple accessShenghao Yang, Soung Chang Liew, Lizhao You, Yi Chen. 481-485 [doi]
• On the adaptive capacity region of fading MACs with distributed CSISreejith Sreekumar, Sibi Raj B. Pillai, Bikash Kumar Dey. 486-490 [doi]
• The capacity of the Multiple Access Channel under distributed scheduling and MMSE decodingJoseph Kampeas, Asaf Cohen, Omer Gurewitz. 491-495 [doi]
• How to securely compute the modulo-two sum of binary sourcesDeepesh Data, Bikash Kumar Dey, Manoj Mishra, Vinod M. Prabhakaran. 496-500 [doi]
• From the Information Bottleneck to the Privacy FunnelAli Makhdoumi, Salman Salamatian, Nadia Fawaz, Muriel Médard. 501-505 [doi]
• Distributed storage for data securityAnnina Bracher, Eran Hof, Amos Lapidoth. 506-510 [doi]
• A new model of Client-Server Communications under information theoretic securityMitsugu Iwamoto, Tsukasa Omino, Yuichi Komano, Kazuo Ohta. 511-515 [doi]
• Efficient secret sharing schemes achieving optimal information rateYongge Wang, Yvo Desmedt. 516-520 [doi]
• An elementary completeness proof for secure two-party computation primitivesYe Wang, Prakash Ishwar, Shantanu Rane. 521-525 [doi]
• A recursive coding algorithm for two-unicast-Z networksWeifei Zeng, Viveck R. Cadambe, Muriel Médard. 526-530 [doi]
• A matrix completion approach to linear index coding problemHoma Esfahanizadeh, Farshad Lahouti, Babak Hassibi. 531-535 [doi]
• On deterministic linear network coded broadcast and its relation to matroid theoryMingchao Yu, Parastoo Sadeghi, Neda Aboutorab. 536-540 [doi]
• On index coding and graph homomorphismJavad B. Ebrahimi, Mahdi Jafari Siavoshani. 541-545 [doi]
• On the solvability of three-pair networks with common bottleneck linksKai Cai, Guangyue Han. 546-550 [doi]
• Dirty interference cancellation for Gaussian broadcast channelsRuchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai. 551-555 [doi]
• Distributed decode-forward for broadcastSung-Hoon Lim, Kwang Taik Kim, Young Han Kim. 556-560 [doi]
• On capacity of the dirty paper channel with fading dirt in the strong fading regimeStefano Rini, Shlomo Shamai. 561-565 [doi]
• Multiple description coding for the Compound Broadcast ChannelMeryem Benammar, Pablo Piantanida, Shlomo Shamai. 566-570 [doi]
• Coding schemes for a class of receiver message side information in AWGN broadcast channelsBehzad Asadi, Lawrence Ong, Sarah J. Johnson. 571-575 [doi]
• Concatenated permutation block codes for correcting single transposition errorsReolyn Heymann, Jos H. Weber, Theo G. Swart, Hendrik C. Ferreira. 576-580 [doi]
• Iterative list-decoding of Gabidulin codes via Gröbner based interpolationMargreta Kuijper, Anna-Lena Trautmann. 581-585 [doi]
• Achieving positive rates over AWGN channels with quantized feedback and linear processingStefan Farthofer, Andreas Winkelbauer, Gerald Matz. 586-590 [doi]
• A new construction of zero correlation zone sequences from generalized reed-muller codesZi-Long Liu, Yong Liang Guan, Udaya Parampalli. 591-595 [doi]
• Insertion and deletion errors with a forbidden symbolAnkur A. Kulkarni. 596-600 [doi]
• Construction of random input-output codes with moderate block lengthsRavi Motwani, Eitan Yaakobi. 601-605 [doi]
• Local rank modulation for flash memoriesMichal Horovitz, Tuvi Etzion. 606-610 [doi]
• Quasi-primitive block-wise concatenated BCH codes for NAND flash memoriesDaesung Kim, Jeongseok Ha. 611-615 [doi]
• Set avoidance probabilities and bounds on the reliability of erasure coded storage systemsAntonio C. de A. Campello Jr., Vinay A. Vaishampayan. 616-620 [doi]
• Almost affine locally repairable codes and matroid theoryThomas Westerbäck, Toni Ernvall, Camilla Hollanti. 621-625 [doi]
• Secure degrees of freedom for the MIMO wiretap channel with a multiantenna cooperative jammerMohamed S. Nafea, Aylin Yener. 626-630 [doi]
• From ordinary AWGN codes to optimal MIMO wiretap schemesAnatoly Khina, Yuval Kochman, Ashish Khisti. 631-635 [doi]
• Unshared secret key cryptography: Achieving Shannon's ideal secrecy and perfect secrecyShuiyin Liu, Yi Hong, Emanuele Viterbo. 636-640 [doi]
• The role of artificial noise in multi-antenna fading wiretap channels: Useful or harmful?Ramanan Subramanian, Ingmar Land. 641-645 [doi]
• Strong coordination over a three-terminal relay networkMatthieu R. Bloch, Jörg Kliewer. 646-650 [doi]
• On the multiway relay channel with direct linksAnne Savard, Claudio Weidmann. 651-655 [doi]
• Switched local schedules for diamond networksSiddhartha Brahma, Ayan Sengupta, Christina Fragouli. 656-660 [doi]
• The diversity multiplexing tradeoff of the half-duplex relay networkSanjay Karmakar, Mahesh K. Varanasi. 661-665 [doi]
• Wireless-powered cooperative communications via a hybrid relayHe Chen, Xiangyun Zhou, Yonghui Li, Peng Wang, Branka Vucetic. 666-670 [doi]