default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDITW Fall 2015: Jeju Island, South Korea
- 2015 IEEE Information Theory Workshop - Fall (ITW), Jeju Island, South Korea, October 11-15, 2015. IEEE 2015, ISBN 978-1-4673-7852-9
- Viveck R. Cadambe
, Arya Mazumdar:
Alphabet-size dependent bounds for exact repair in distributed storage. 1-3 - Chandra Thapa, Lawrence Ong, Sarah J. Johnson:
Generalized interlinked cycle cover for index coding. 4-8 - Fatemeh Arbabjolfaei, Young-Han Kim:
On critical index coding problems. 9-13 - Xiao Huang, Salim El Rouayheb:
Index coding and network coding via rank minimization. 14-18 - Wenwen Zhao, Lifeng Lai:
Distributed testing against independence with conferencing encoders. 19-23 - Jason Castiglione, Aleksandar Kavcic:
Trellis based lower bounds on capacities of channels with synchronization errors. 24-28 - Afshin Abdi, Faramarz Fekri:
Source identification and compression of mixture data from finite observations. 29-33 - Xuan Guang, Jiyong Lu, Fang-Wei Fu:
Variable-security-level secure network coding. 34-38 - Amaro Barreal, Joonas Pääkkönen, David A. Karpuk, Camilla Hollanti, Olav Tirkkonen:
A low-complexity message recovery method for Compute-and-Forward relaying. 39-43 - Congduan Li, Steven Weber, John MacLaren Walsh:
Network combination operations preserving the sufficiency of linear network codes. 44-48 - Jhordany Rodriguez Parra, Terence Chan, Ingmar Land, Siu-Wai Ho:
Authentication for two-way relay channel with Physical-Layer Network coding. 49-53 - Jung-Hyun Kim, Mi-Young Nam, Hong-Yeop Song:
Optimal binary locally repairable codes with joint information locality. 54-58 - Han Mao Kiah, Son Hoang Dau, Wentu Song, Chau Yuen:
Local codes with addition based repair. 59-63 - J. Harshan, Frédérique E. Oggier:
On Algebraic Manipulation Detection codes from linear codes and their application to storage systems. 64-68 - Jesper Pedersen, Alexandre Graell i Amat, Iryna Andriyanova, Fredrik Brannstrom:
Repair scheduling in wireless distributed storage with D2D communication. 69-73 - Wentu Song, Son Hoang Dau, Chau Yuen:
Erasure codes with symbol locality and group decodability for distributed storage. 74-78 - Sung Hoon Lim, Michael Gastpar:
Coding theorems via linear codes: Joint decoding rate regions. 79-83 - Inaki Estella Aguerri, Deniz Gündüz:
Correlated Gaussian sources over Gaussian weak interference channels. 84-88 - Victor Quintero, Samir Medina Perlaza, Jean-Marie Gorce:
Noisy channel-output feedback capacity of the linear deterministic interference channel. 89-93 - Amitalok J. Budkuley, Bikash Kumar Dey, Vinod M. Prabhakaran:
Dirty paper arbitrarily varying channel with a state-aware adversary. 94-98 - Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Exact recovery threshold in the binary censored block model. 99-103 - Nikita A. Shevchenko, Jaroslaw E. Prilepsky, Stanislav A. Derevyanko, Alex Alvarado, Polina Bayvel, Sergei K. Turitsyn:
A lower bound on the per soliton capacity of the nonlinear optical fibre channel. 104-108 - Mehrdad Tahmasbi, Faramarz Fekri:
On the capacity achieving probability measures for molecular receivers. 109-113 - Lav R. Varshney:
Toward limits of constructing reliable memories from unreliable components. 114-118 - Shounak Roy, Shayan Garani Srinivasa:
Two dimensional error-correcting codes using finite field Fourier transform. 119-123 - Liyasi Wu:
Locally correcting multiple bits and codes of high rate. 124-128 - Jin-Ho Chung, Kyeongcheol Yang:
New construction of asymptotically optimal optical orthogonal codes. 129-132 - Eirik Rosnes, Alexandre Graell i Amat:
Analysis of spatially-coupled counter braids. 133-137 - Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat:
Threshold saturation for spatially coupled turbo-like codes over the binary erasure channel. 138-142 - Min Zhu, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr., Baoming Bai:
Window decoding of Braided Convolutional Codes. 143-147 - Najeeb ul Hassan, Iryna Andriyanova, Michael Lentmaier, Gerhard P. Fettweis:
Protograph design for spatially-coupled codes to attain an arbitrary diversity order. 148-152 - Vincent Y. F. Tan:
Error and erasure exponents for the asymmetric broadcast channel. 153-157 - Sajjad Bahrami, Behrooz Razeghi, Mostafa Monemizadeh, Ghosheh Abed Hodtani:
Joint source-channel coding for broadcast channel with cooperating receivers. 158-162 - Yanlin Geng, Fan Cheng:
Duality between finite numbers of discrete multiple access and broadcast channels. 163-166 - Silas L. Fong, Vincent Y. F. Tan:
A proof of the strong converse theorem for Gaussian multiple access channels. 167-171 - Ricardo Antonio Parrao Hernandez, Brian M. Kurkoski:
The three/two Gaussian parametric LDLC decoder. 172-176 - Nan Zhang, Md. Noor-A-Rahim, Badri N. Vellambi, Khoa D. Nguyen:
Anytime properties of protograph-based repeat-accumulate codes. 177-181 - Farshid Mokhtarinezhad, Jörg Kliewer, Osvaldo Simeone:
Lossy compression with privacy constraints: Optimality of polar codes. 182-186 - Runxin Wang, Junya Honda, Hirosuke Yamamoto, Rongke Liu, Yi Hou:
Construction of polar codes for channels with memory. 187-191 - Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch:
Strong coordination over multi-hop line networks. 192-196 - Youlong Wu:
Coding schemes for discrete memoryless multicast networks with rate-limited feedback. 197-201 - Mahed Abroshan, Amin Aminzadeh Gohari, Sidharth Jaggi:
Zero error coordination. 202-206 - Maria Angeles Vázquez-Castro:
A geometric approach to dynamic network coding. 207-211 - Yuxin Chen, Changho Suh:
Top-K ranking: An information-theoretic perspective. 212-213 - Igal Sason, Sergio Verdú:
Upper bounds on the relative entropy and Rényi divergence as a function of total variation distance for finite alphabets. 214-218 - Emrah Akyol, Cedric Langbort, Tamer Basar:
Strategic compression and transmission of information. 219-223 - Jun Geng, Weiyu Xu, Lifeng Lai:
Detection of correlated components in multivariate Gaussian models. 224-228 - Ning Liang, Wenyi Zhang:
A mixed-ADC receiver architecture for massive MIMO systems. 229-233 - Ramy H. Gohary, Halim Yanikomeroglu:
The ergodic high SNR capacity of the spatially-correlated non-coherent MIMO channel within an SNR-independent gap. 234-238 - Alexey Buzuverov, Hussein Al-Shatri, Anja Klein:
On the degrees of freedom of the three-user MIMO interference channel with delayed CSIT. 239-243 - Gilwon Lee, Youngchul Sung, Junyeong Seo:
How many users are needed for non-trivial performance of random beamforming in highly-directional mm-wave MIMO downlink? 244-248 - Divesh Aggarwal, Alexander Golovnev:
A note on lower bounds for non-interactive message authentication using weak keys. 249-251 - Nima Tavangaran, Holger Boche, Rafael F. Schaefer:
Secret-Key capacity of compound source models with one-way public communication. 252-256 - Aleksandar Kavcic, Miodrag J. Mihaljevic, Kanta Matsuura:
Light-weight secrecy system using channels with insertion errors: Cryptographic implications. 257-261 - Basak Guler, Kaya Tutuncuoglu, Aylin Yener:
Maximizing recommender's influence in a social network: An information theoretic perspective. 262-266 - Seyed Pooya Shariatpanahi, Abolfazl S. Motahari, Babak Hossein Khalaj:
Content delivery via multi-server coded caching in linear networks. 267-271 - Lei Yu, Houqiang Li, Weiping Li, Zixiang Xiong, Anders Høst-Madsen:
On the energy-delay tradeoff in lossy network communications. 272-276 - Hamed Mirghasemi, Jean-Claude Belfiore:
Lattice code design criterion for MIMO wiretap channels. 277-281 - Germán Bassi, Pablo Piantanida, Shlomo Shamai:
The wiretap channel with generalized feedback: Secure communication and key generation. 282-286 - Mani Bastani Parizi, Emre Telatar:
On the secrecy exponent of the wire-tap channel. 287-291 - Ron Steinfeld, Amin Sakzad:
On massive MIMO physical layer cryptosystem. 292-296 - Renaud-Alexandre Pitaval, Lu Wei, Olav Tirkkonen, Jukka Corander:
On the exact volume of metric balls in complex Grassmann manifolds. 297-301 - Abdellatif Zaidi:
On two terminal interactive source coding for function computation with remote sources. 302-306 - Min-Hsiu Hsieh, Shun Watanabe:
Fully quantum source compression with a quantum helper. 307-311 - Tetsunao Matsuta, Tomohiko Uyematsu:
Achievable rate regions for asynchronous Slepian-Wolf coding systems. 312-316 - Pritam Mukherjee, Sennur Ulukus:
Secure degrees of freedom of the interference channel with no eavesdropper CSI. 317-321 - Ahmed A. Zewail, Aylin Yener:
The two-hop interference untrusted-relay channel with confidential messages. 322-326 - Kevin Luo, Ramy H. Gohary, Halim Yanikomeroglu:
The capacity of a broadcast channel with Gaussian jamming and a friendly eavesdropper. 327-331 - Eric Graves, Tan F. Wong:
Information integrity between correlated sources through Wyner-Ziv coding. 332-336 - Zuxing Li, Tobias J. Oechtering:
Privacy on hypothesis testing in smart grids. 337-341 - Ling Liu, Cong Ling:
Polar lattices are good for lossy compression. 342-346 - Meryem Benammar, Abdellatif Zaidi:
Rate-distortion function for a Heegard-Berger problem with two sources and degraded reconstruction sets. 347-351 - Alon Kipnis, Stefano Rini, Andrea J. Goldsmith:
The indirect rate-distortion function of a binary i.i.d source. 352-356 - Gholamreza Alirezaei, Rudolf Mathar:
Optimum one-bit quantization. 357-361 - Georg Tauböck, Erwin Riegler:
Almost lossless analog compression without phase information - complex case. 362-366
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 2025-12-02 23:33 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:
