Abstract is missing.
- Alphabet-size dependent bounds for exact repair in distributed storageViveck R. Cadambe, Arya Mazumdar. 1-3 [doi]
- Generalized interlinked cycle cover for index codingChandra Thapa, Lawrence Ong, Sarah J. Johnson. 4-8 [doi]
- On critical index coding problemsFatemeh Arbabjolfaei, Young Han Kim. 9-13 [doi]
- Index coding and network coding via rank minimizationXiao Huang, Salim El Rouayheb. 14-18 [doi]
- Distributed testing against independence with conferencing encodersWenwen Zhao, Lifeng Lai. 19-23 [doi]
- Trellis based lower bounds on capacities of channels with synchronization errorsJason Castiglione, Aleksandar Kavcic. 24-28 [doi]
- Source identification and compression of mixture data from finite observationsAfshin Abdi, Faramarz Fekri. 29-33 [doi]
- Variable-security-level secure network codingXuan Guang, Jiyong Lu, Fang-Wei Fu. 34-38 [doi]
- A low-complexity message recovery method for Compute-and-Forward relayingAmaro Barreal, Joonas Pääkkönen, David A. Karpuk, Camilla Hollanti, Olav Tirkkonen. 39-43 [doi]
- Network combination operations preserving the sufficiency of linear network codesCongduan Li, Steven Weber, John MacLaren Walsh. 44-48 [doi]
- Authentication for two-way relay channel with Physical-Layer Network codingJhordany Rodriguez Parra, Terence Chan, Ingmar Land, Siu-Wai Ho. 49-53 [doi]
- Optimal binary locally repairable codes with joint information localityJung-Hyun Kim, Mi Young Nam, Hong-Yeop Song. 54-58 [doi]
- Local codes with addition based repairHan Mao Kiah, Son Hoang Dau, Wentu Song, Chau Yuen. 59-63 [doi]
- On Algebraic Manipulation Detection codes from linear codes and their application to storage systemsJ. Harshan, Frédérique E. Oggier. 64-68 [doi]
- Repair scheduling in wireless distributed storage with D2D communicationJesper Pedersen, Alexandre Graell i Amat, Iryna Andriyanova, Fredrik Brannstrom. 69-73 [doi]
- Erasure codes with symbol locality and group decodability for distributed storageWentu Song, Son Hoang Dau, Chau Yuen. 74-78 [doi]
- Coding theorems via linear codes: Joint decoding rate regionsSung-Hoon Lim, Michael Gastpar. 79-83 [doi]
- Correlated Gaussian sources over Gaussian weak interference channelsInaki Estella Aguerri, Deniz Gündüz. 84-88 [doi]
- Noisy channel-output feedback capacity of the linear deterministic interference channelVictor Quintero, Samir Medina Perlaza, Jean-Marie Gorce. 89-93 [doi]
- Dirty paper arbitrarily varying channel with a state-aware adversaryAmitalok J. Budkuley, Bikash Kumar Dey, Vinod M. Prabhakaran. 94-98 [doi]
- Exact recovery threshold in the binary censored block modelBruce E. Hajek, Yihong Wu, Jiaming Xu. 99-103 [doi]
- A lower bound on the per soliton capacity of the nonlinear optical fibre channelNikita A. Shevchenko, Jaroslaw E. Prilepsky, Stanislav A. Derevyanko, Alex Alvarado, Polina Bayvel, Sergei K. Turitsyn. 104-108 [doi]
- On the capacity achieving probability measures for molecular receiversMehrdad Tahmasbi, Faramarz Fekri. 109-113 [doi]
- Toward limits of constructing reliable memories from unreliable componentsLav R. Varshney. 114-118 [doi]
- Two dimensional error-correcting codes using finite field Fourier transformShounak Roy, Shayan Garani Srinivasa. 119-123 [doi]
- Locally correcting multiple bits and codes of high rateLiyasi Wu. 124-128 [doi]
- New construction of asymptotically optimal optical orthogonal codesJin-Ho Chung, Kyeongcheol Yang. 129-132 [doi]
- Analysis of spatially-coupled counter braidsEirik Rosnes, Alexandre Graell i Amat. 133-137 [doi]
- Threshold saturation for spatially coupled turbo-like codes over the binary erasure channelSaeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat. 138-142 [doi]
- Window decoding of Braided Convolutional CodesMin Zhu, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr., Baoming Bai. 143-147 [doi]
- Protograph design for spatially-coupled codes to attain an arbitrary diversity orderNajeeb ul Hassan, Iryna Andriyanova, Michael Lentmaier, Gerhard P. Fettweis. 148-152 [doi]
- Error and erasure exponents for the asymmetric broadcast channelVincent Y. F. Tan. 153-157 [doi]
- Joint source-channel coding for broadcast channel with cooperating receiversSajjad Bahrami, Behrooz Razeghi, Mostafa Monemizadeh, Ghosheh Abed Hodtani. 158-162 [doi]
- Duality between finite numbers of discrete multiple access and broadcast channelsYanlin Geng, Fan Cheng. 163-166 [doi]
- A proof of the strong converse theorem for Gaussian multiple access channelsSilas L. Fong, Vincent Y. F. Tan. 167-171 [doi]
- The three/two Gaussian parametric LDLC decoderRicardo Antonio Parrao Hernandez, Brian M. Kurkoski. 172-176 [doi]
- Anytime properties of protograph-based repeat-accumulate codesNan Zhang, Md. Noor-A.-Rahim, Badri N. Vellambi, Khoa D. Nguyen. 177-181 [doi]
- Lossy compression with privacy constraints: Optimality of polar codesFarshid Mokhtarinezhad, Jörg Kliewer, Osvaldo Simeone. 182-186 [doi]
- Construction of polar codes for channels with memoryRunxin Wang, Junya Honda, Hirosuke Yamamoto, Rongke Liu, Yi Hou. 187-191 [doi]
- Strong coordination over multi-hop line networksBadri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch. 192-196 [doi]
- Coding schemes for discrete memoryless multicast networks with rate-limited feedbackYoulong Wu. 197-201 [doi]
- Zero error coordinationMahed Abroshan, Amin Aminzadeh Gohari, Sidharth Jaggi. 202-206 [doi]
- A geometric approach to dynamic network codingMaria Angeles Vázquez-Castro. 207-211 [doi]
- Top-K ranking: An information-theoretic perspectiveYuxin Chen, Changho Suh. 212-213 [doi]
- Upper bounds on the relative entropy and Rényi divergence as a function of total variation distance for finite alphabetsIgal Sason, Sergio Verdú. 214-218 [doi]
- Strategic compression and transmission of informationEmrah Akyol, Cedric Langbort, Tamer Basar. 219-223 [doi]
- Detection of correlated components in multivariate Gaussian modelsJun Geng, Weiyu Xu, Lifeng Lai. 224-228 [doi]
- A mixed-ADC receiver architecture for massive MIMO systemsNing Liang, Wenyi Zhang. 229-233 [doi]
- The ergodic high SNR capacity of the spatially-correlated non-coherent MIMO channel within an SNR-independent gapRamy H. Gohary, Halim Yanikomeroglu. 234-238 [doi]
- On the degrees of freedom of the three-user MIMO interference channel with delayed CSITAlexey Buzuverov, Hussein Al-Shatri, Anja Klein 0002. 239-243 [doi]
- How many users are needed for non-trivial performance of random beamforming in highly-directional mm-wave MIMO downlink?Gilwon Lee, Youngchul Sung, Junyeong Seo. 244-248 [doi]
- A note on lower bounds for non-interactive message authentication using weak keysDivesh Aggarwal, Alexander Golovnev. 249-251 [doi]
- Secret-Key capacity of compound source models with one-way public communicationNima Tavangaran, Holger Boche, Rafael F. Schaefer. 252-256 [doi]
- Light-weight secrecy system using channels with insertion errors: Cryptographic implicationsAleksandar Kavcic, Miodrag J. Mihaljevic, Kanta Matsuura. 257-261 [doi]
- Maximizing recommender's influence in a social network: An information theoretic perspectiveBasak Guler, Kaya Tutuncuoglu, Aylin Yener. 262-266 [doi]
- Content delivery via multi-server coded caching in linear networksSeyed Pooya Shariatpanahi, Abolfazl S. Motahari, Babak Hossein Khalaj. 267-271 [doi]
- On the energy-delay tradeoff in lossy network communicationsLei Yu, Houqiang Li, Weiping Li, Zixiang Xiong, Anders Høst-Madsen. 272-276 [doi]
- Lattice code design criterion for MIMO wiretap channelsHamed Mirghasemi, Jean-Claude Belfiore. 277-281 [doi]
- The wiretap channel with generalized feedback: Secure communication and key generationGermán Bassi, Pablo Piantanida, Shlomo Shamai. 282-286 [doi]
- On the secrecy exponent of the wire-tap channelMani Bastani Parizi, Emre Telatar. 287-291 [doi]
- On massive MIMO physical layer cryptosystemRon Steinfeld, Amin Sakzad. 292-296 [doi]
- On the exact volume of metric balls in complex Grassmann manifoldsRenaud-Alexandre Pitaval, Lu Wei, Olav Tirkkonen, Jukka Corander. 297-301 [doi]
- On two terminal interactive source coding for function computation with remote sourcesAbdellatif Zaidi. 302-306 [doi]
- Fully quantum source compression with a quantum helperMin-Hsiu Hsieh, Shun Watanabe. 307-311 [doi]
- Achievable rate regions for asynchronous Slepian-Wolf coding systemsTetsunao Matsuta, Tomohiko Uyematsu. 312-316 [doi]
- Secure degrees of freedom of the interference channel with no eavesdropper CSIPritam Mukherjee, Sennur Ulukus. 317-321 [doi]
- The two-hop interference untrusted-relay channel with confidential messagesAhmed A. Zewail, Aylin Yener. 322-326 [doi]
- The capacity of a broadcast channel with Gaussian jamming and a friendly eavesdropperKevin Luo, Ramy H. Gohary, Halim Yanikomeroglu. 327-331 [doi]
- Information integrity between correlated sources through Wyner-Ziv codingEric Graves, Tan F. Wong. 332-336 [doi]
- Privacy on hypothesis testing in smart gridsZuxing Li, Tobias J. Oechtering. 337-341 [doi]
- Polar lattices are good for lossy compressionLing Liu, Cong Ling. 342-346 [doi]
- Rate-distortion function for a Heegard-Berger problem with two sources and degraded reconstruction setsMeryem Benammar, Abdellatif Zaidi. 347-351 [doi]
- The indirect rate-distortion function of a binary i.i.d sourceAlon Kipnis, Stefano Rini, Andrea J. Goldsmith. 352-356 [doi]
- Optimum one-bit quantizationGholamreza Alirezaei, Rudolf Mathar. 357-361 [doi]
- Almost lossless analog compression without phase information - complex caseGeorg Tauböck, Erwin Riegler. 362-366 [doi]