default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDITW 2017: Kaohsiung, Taiwan
- 2017 IEEE Information Theory Workshop, ITW 2017, Kaohsiung, Taiwan, November 6-10, 2017. IEEE 2017, ISBN 978-1-5090-3097-2
- Yi-Peng Wei, Sennur Ulukus:
Novel decentralized coded caching through coded prefetching. 1-5 - Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Communication-optimal coding designs for caching networks. 6-10 - Sarah Kamel, Michèle A. Wigger, Mireille Sarkiss
:
Coded caching for wiretap broadcast channels. 11-15 - Joan S. Pujol Roig, Abolfazl Seyed Motahari, Filippo Tosato, Deniz Gündüz:
Fundamental limits of latency in a cache-aided 4×4 interference channel. 16-20 - Qingyu Liu, Lei Deng, Haibo Zeng, Minghua Chen:
On the min-max-delay problem: NP-completeness, algorithm, and integrality gap. 21-25 - Stanislav Kruglik, Marina Dudina, Valeriya Potapova, Alexey A. Frolov:
On one generalization of LRC codes with availability. 26-30 - Jie Hao, Shu-Tao Xia, Bin Chen, Fang-Wei Fu:
On the weight hierarchy of locally repairable codes. 31-35 - Chi Wan Sung, Kenneth W. Shum, Quan Yu, Guangping Xu:
Maximally recoverable codes: Connections to generic network coding and maximal matching. 36-40 - Kaveh Mahdaviani, Soheil Mohajer, Ashish Khisti:
Product matrix minimum storage regenerating codes with flexible number of helpers. 41-45 - Vitaly Abdrashitov, N. Prakash, Muriel Médard:
The storage vs repair bandwidth trade-off for multiple failures in clustered storage networks. 46-50 - Harout K. Aydinian, Holger Boche:
Fractional repetition codes based on partially ordered sets. 51-55 - Bing Zhu, Kenneth W. Shum, Hui Li:
On the duality of fractional repetition codes. 56-60 - Jad Hachem, Nikhil Karamchandani, Sharayu Moharir, Suhas N. Diggavi:
Caching with partial matching under Zipf demands. 61-65 - Hari Hara Suthan C, Ishani Chugh, Prasad Krishnan:
An improved secretive coded caching scheme exploiting common demands. 66-70 - Qiwen Wang, Mikael Skoglund:
Linear symmetric private information retrieval for MDS coded distributed storage with colluding servers. 71-75 - Silas L. Fong, Vincent Y. F. Tan:
A tight upper bound on the second-order coding rate of parallel Gaussian channels with feedback. 76-80 - Shun Watanabe:
A converse bound on Wyner-Ahlswede-Körner Network via Gray-Wyner network. 81-85 - Stefan M. Moser, Ligong Wang, Michèle A. Wigger:
Asymptotic high-SNR capacity of MISO optical intensity channels. 86-90 - Sara Shahi, Daniela Tuninetti, Natasha Devroye:
On the capacity of the slotted strongly asynchronous channel with a bursty user. 91-95 - Christos K. Kourtellaris, Ioannis Tzortzis, Charalambos D. Charalambous:
Two-letter capacity formula for channels with memory and feedback. 96-100 - Meryem Benammar, Valerio Bioglio, Frederic Gabry, Ingmar Land:
Multi-kernel polar codes: Proof of polarization and error exponents. 101-105 - Mine Alsan, Vincent Y. F. Tan:
Robust decoding schemes for polar coding over compound channels. 106-110 - Haiyang Liu, Li Ping:
Low-rate regular concatenated zigzag codes are capacity-approaching over the BEC. 111-115 - Lev Yohananov, Eitan Yaakobi:
Codes for erasures over directed graphs. 116-120 - Avinash Vem, Krishna R. Narayanan, Jun Cheng, Jean-François Chamberland:
A user-independent serial interference cancellation based coding scheme for the unsourced random access Gaussian channel. 121-125 - Shiyuan Mo, Li Chen:
Improved sliding window decoding of spatially coupled low-density parity-check codes. 126-130 - Gou Hosoya, Hiroyuki Yashima:
Spatially-coupled LDPC codes for two dimensional erasure channel. 131-135 - Michael X. Cao, Pascal O. Vontobel:
Double-edge factor graphs: Definition, properties, and examples. 136-140 - Marco Ferrari, Alessandro Tomasoni, Sandro Bellini:
Analysis of practical LDPC decoders in tanner graphs with absorbing sets. 141-145 - Dongming Yuan, Lu Li, Yuanan Liu:
Lowering the error floors of low-density parity-check codes with additional check nodes. 146-150 - Sarit Buzaglo, Paul H. Siegel:
Weakly constrained codes via row-by-row coding. 151-155 - Ori Rottenstreich, Yuval Cassuto:
Optimal compression of element pairs in fixed-width memories. 156-160 - Yeow Meng Chee, Han Mao Kiah, Alexander Vardy, Van Khu Vu, Eitan Yaakobi:
Codes correcting position errors in racetrack memories. 161-165 - Clayton Schoeny, Frederic Sala, Mark Gottscho, Irina Alam, Puneet Gupta, Lara Dolecek:
Context-aware resiliency: Unequal message protection for random-access memories. 166-170 - Seok-Hwan Park, Osvaldo Simeone, Shlomo Shamai:
Uplink sum-rate analysis of C-RAN with interconnected radio units. 171-175 - Qizhong Yao, Zhengchuan Chen, Howard H. Yang, Tony Q. S. Quek:
Delay-aware massive random access: Adaptive framing and successive decoding. 176-180 - Morteza Varasteh, Borzoo Rassouli, Bruno Clerckx:
Wireless information and power transfer over an AWGN channel: Nonlinearity and asymmetric Gaussian signaling. 181-185 - Aleksey V. Reznichenko, Ivan S. Terekhov:
Channel capacity and simple correlators for nonlinear communication channel at large SNR and small dispersion. 186-190 - Shiuan-Hao Kuo, Zhen-U. Liu, Jeff Yang:
On practical LDPC code construction for NAND flash applications. 191-195 - Tingjun Xie, Ying Y. Tai, Jiangli Zhu:
Polar codes for NAND-based SSD systems: A joint source channel coding perspective. 196-200 - Wei Lin, Yu-Cheng Hsu, Tsai-Hao Kuo, Yu-Siang Yang, Szu-Wei Chen, Chun-Wei Tsao, An-Chang Liu, Lih-Yuarn Ou, Tien-Ching Wang, Shao-Wei Yen, Yu-Hsiang Lin, Kuo-Hsin Lai, Chi-Heng Yang, Li-Chun Liang, Pei-Jung Hsu:
3X endurance enhancement by advanced signal processor for 3D NAND flash memory. 201-203 - Huang-Chang Lee, Jieng-Heng Shy, Yen-Ming Chen, Yeong-Luh Ueng:
LDPC coded modulation for TLC flash memory. 204-208 - Haoyu Qi, Qingle Wang, Mark M. Wilde:
Applications of position-based coding to classical communication over quantum channels. 209-213 - Anurag Anshu:
An upper bound on quantum capacity of unital quantum channels. 214-218 - Priya J. Nadkarni, Shayan Srinivasa Garani:
Entanglement assisted binary quantum tensor product codes. 219-223 - Guanghui Song, Kui Cai, Jun Cheng:
Union bound analysis of multilevel flash memory channels. 224-228 - Ahmed H. Hareedy, Homa Esfahanizadeh, Lara Dolecek:
High performance non-binary spatially-coupled codes for flash memories. 229-233 - Siyi Yang, Clayton Schoeny, Lara Dolecek:
Order-optimal permutation codes in the generalized cayley metric. 234-238 - Akira Yamawaki, Hiroshi Kamabe, Shan Lu:
Construction of parallel RIO codes using coset coding with hamming codes. 239-243 - Kenta Kasai, Akiyoshi Hashimoto:
LDPC turbo decoder using generalized belief propagation over two-dimensional inter-symbol interference channel. 244-248 - Koutaro Okada, Hiroki Koga:
A construction of the progressive (3, n)-threshold visual cryptography using a BIBD and analysis of its optimality. 249-253 - Tetsunao Matsuta, Tomohiko Uyematsu:
On the minimum worst-case cost and the minimum average cost to erase information. 254-258 - Junji Shikata:
Tighter bounds on entropy of secret keys in authentication codes. 259-263 - Deepesh Data, Vinod M. Prabhakaran:
Secure computation of randomized functions: Further results. 264-268 - Zheng Wang, Cong Ling:
On the geometric ergodicity of Gibbs algorithm for lattice Gaussian sampling. 269-273 - Sudheer Poojary, Sanidhay Bhambay, Parimal Parag:
Real-time status updates for correlated source. 274-278 - Yahya H. Ezzeldin, Mohammed Karmoose, Christina Fragouli:
Communication vs distributed computation: An alternative trade-off curve. 279-283 - Tang Liu, Daniela Tuninetti:
Information theoretic converse proofs for some PICOD problems. 284-288 - Linqi Song, Sundara Rajan Srinivasavaradhan, Christina Fragouli:
The benefit of being flexible in distributed computation. 289-293 - Mahesh Babu Vaddi, B. Sundar Rajan:
On the capacity of index coding problems with symmetric neighboring interference. 294-298 - Keerthi Suria Kumar Arumugam, Matthieu R. Bloch:
Covert communication over broadcast channels. 299-303 - Mehrdad Tahmasbi, Matthieu R. Bloch, Vincent Y. F. Tan:
Error exponent for covert communications over discrete memoryless channels. 304-308 - Xuan Guang, Raymond W. Yeung:
Alphabet size reduction for secure network coding. 309-313 - Wasim Huleihel, Muriel Médard:
Privacy through familiarity. 314-318 - Matthew P. Johnson, Liang Zhao, Supriyo Chakraborty:
Computing messages that reveal selected inferences while protecting others. 319-323 - Martin Damrath, H. Birkan Yilmaz, Chan-Byoung Chae, Peter Adam Hoeher:
Spatial coding techniques for molecular MIMO. 324-328 - Yuting Fang, Adam Noel, Yiran Wang, Nan Yang:
Simplified cooperative detection for multi-receiver molecular communication. 329-333 - Adam Noel, Yuting Fang, Nan Yang, Dimitrios Makrakis, Andrew W. Eckford:
Effect of local population uncertainty on cooperation in bacteria. 334-338 - Afshin Abdi, Arash Einolghozati, Faramarz Fekri:
Computing framework in biological cells via stochastic methods. 339-343 - I-Hsiang Wang, Yu-Chih Huang, Shih-Chun Lin:
Role of feedback in modulo-sum computation over K-user erasure multiple-access channels. 344-348 - Yigit Ugur, Inaki Estella Aguerri, Abdellatif Zaidi:
A generalization of blahut-arimoto algorithm to compute rate-distortion regions of multiterminal source coding under logarithmic loss. 349-353 - Jian-Jia Weng, Fady Alajaji, Tamás Linder:
Lossy transmission of correlated sources over two-way channels. 354-358 - Shan Lu, Hiroshi Kamabe, Jun Cheng:
Codes for T-user asymmetric multiple-access channel with independent sources. 359-363 - Stefano Rini, Shlomo Shamai:
The approximate capacity for the 3-receiver writing on random dirty paper channel. 364-368 - Sadaf Salehkalaibar, Michèle A. Wigger, Ligong Wang:
Hypothesis testing over cascade channels. 369-373 - Anusha Lalitha, Tara Javidi:
Learning via active hypothesis testing over networks. 374-378 - Hang Zhang, Afshin Abdi, Faramarz Fekri:
Recovery of sign vectors in quadratic compressed sensing. 379-383 - Chun Lam Chan, Nicolas Macris:
Stability threshold and phase transition of generalized censored block models. 384-388 - Hang Zhang, Afshin Abdi, Faramarz Fekri:
Compressive sensing with energy constraint. 389-393 - Yanling Chen, Onur Ozan Koyluoglu, A. J. Han Vinck:
Joint secrecy over the K-transmitter multiple access channel. 394-398 - Selma Belhadj Amor, Vincent Y. F. Tan:
On the Gaussian MAC with degraded message sets and long-term power constraints. 399-403 - Qianqian Yang, Pablo Piantanida, Deniz Gündüz:
The multi-layer information bottleneck problem. 404-408 - Vincent Y. F. Tan, Cheng-Hsiung Liu, I-Hsiang Wang:
Delay scaling laws of random wireless networks: Impact of blocklength. 409-413 - Ayse Ünsal, Jean-Marie Gorce:
The dispersion of superposition coding for Gaussian broadcast channels. 414-418 - Ling-Hua Chang, Carol Wang, Po-Ning Chen, Yunghsiang S. Han, Vincent Y. F. Tan:
Distance spectrum formula for the largest minimum hamming distance of finite-length binary block codes. 419-423 - Ilya Soloveychik, Yu Xiang, Vahid Tarokh:
Explicit symmetric pseudo-random matrices. 424-428 - Jun'ichi Takeuchi, Hiroshi Nagaoka:
Information geometry of the family of Markov kernels defined by a context tree. 429-433 - Shao-Lun Huang, Lin Zhang, Lizhong Zheng:
An information-theoretic approach to unsupervised feature selection for high-dimensional data. 434-438 - Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu:
Rumor source detection in unicyclic graphs. 439-443 - Kai Wan, Mingyue Ji, Pablo Piantanida, Daniela Tuninetti:
Novel outer bounds for combination networks with end-user-caches. 444-448 - Mahed Abroshan, Ramji Venkataramanan, Albert Guillen i Fabregas:
Multilayer codes for synchronization from deletions. 449-453 - Pengfei Huang, Yi Liu, Xiaojie Zhang, Paul H. Siegel, Erich F. Haratsch:
Syndrome-coupled rate-compatible error-correcting codes. 454-458 - Sneh Gupta, V. Lalitha:
Locality-aware hybrid coded MapReduce for server-rack architecture. 459-463 - Albin Severinson, Alexandre Graell i Amat, Eirik Rosnes:
Block-diagonal coding for distributed computing with straggling servers. 464-468 - Masahito Hayashi:
Asymptotic analysis for hidden Markovian process with quantum hidden system. 469-473 - Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Achievability bounds on quantum state redistribution using convex split and position based decoding. 474-478 - Hao-Chung Cheng, Min-Hsiu Hsieh, Marco Tomamichel:
Sphere-packing bound for classical-quantum channels. 479-483 - Felix Leditzky, Debbie W. Leung, Graeme Smith:
Quantum and private capacities of low-noise channels. 484-488 - Francesco Buscemi:
Comparison of noisy channels and reverse data-processing theorems. 489-493 - Chao He, Sheng Yang:
On the two-user erasure broadcast channel with one-sided feedback. 494-498 - Zheng Li, Chao He, Sheng Yang:
On the capacity of the two-user erasure broadcast channel with mixed CSIT. 499-503 - Alessandro Nordio, Carla-Fabiana Chiasserini, Emanuele Viterbo:
Optimal transmission strategy in full-duplex relay networks. 504-508 - Ori Shmuel, Asaf Cohen, Omer Gurewitz:
The necessity of scheduling in compute-and-forward. 509-513 - Mohammed Karmoose, Linqi Song, Martina Cardone, Christina Fragouli:
Preserving privacy while broadcasting: K-limited-access schemes. 514-518 - Hirosuke Yamamoto, Ken-ichi Iwata:
An iterative algorithm to construct optimal binary AIFV-m codes. 519-523 - Huihui Wu, Sorina Dumitrescu:
Design of optimal entropy-constrained scalar quantizer for sequential coding of correlated sources. 524-528 - Anatoly Khina, Victoria Kostina, Ashish Khisti, Babak Hassibi:
Sequential coding of Gauss-Markov sources with packet erasures and feedback. 529-530 - Photios A. Stavrou, Jan Østergaard, Charalambos D. Charalambous, Milan S. Derpich:
An upper bound to zero-delay rate distortion via Kalman filtering for vector Gaussian sources. 534-538 - Ruiyang Song, Stefano Rini, Alon Kipnis, Andrea J. Goldsmith:
Compress-and-estimate source coding for a vector Gaussian source. 539-543 - Sharu Theresa Jose, Ankur A. Kulkarni:
Linear programming based finite blocklength converses for some network-like problems. 544-548 - Luca Barletta, Flaminio Borgonovo:
The stability of exponential backoff protocols for Slotted-Aloha with saturated queues. 549-553 - Carol Wang, Mehul Motani:
Coding for the binary energy harvesting channel with finite battery. 554-558 - Shakeel Salamat Ullah, Gianluigi Liva, Soung Chang Liew:
Physical-layer network coding: A random coding error exponent perspective. 559-563 - Renming Qi, Chen Feng, Yu-Chih Huang:
A simpler proof for the existence of capacity-achieving nested lattice codes. 564-568 - Elad Domanovitz, Uri Erez:
Explicit lower bounds on the outage probability of integer forcing over Nr × 2 channels. 569-573 - Elad Domanovitz, Uri Erez:
Outage probability bounds for integer-forcing source coding. 574-578 - Congduan Li, Fangwei Ye, Xuan Guang, Zhiheng Zhou, Chee-Wei Tan, Raymond W. Yeung:
On independent distributed source coding problems with exact repair. 579-583 - Shai Ginzach, Neri Merhav, Igal Sason:
Random-coding error exponent of variable-length codes with a single-bit noiseless feedback. 584-588 - Ryo Nomura, Hideki Yagi:
Overflow probability of variable-length codes allowing non-vanishing error probability. 589-593 - Shuiyin Liu, Yi Hong, Emanuele Viterbo:
XY precoder for MIMO systems. 594-598 - Stefano Rini, Luca Barletta, Yonina C. Eldar, Elza Erkip:
A general framework for MIMO receivers with low-resolution quantization. 599-603 - Khac-Hoang Ngo, Sheng Yang, Maxime Guillaud:
An achievable DoF region for the two-user non-coherent MIMO broadcast channel with statistical CSI. 604-608 - Yao-Shan Hsiao, I-Hsiang Wang:
On the benefit of delayed CSIT in fading MIMO broadcast channel with CSIR locality. 609-613 - Luca Barletta, Stefano Rini:
Capacity outer bound and degrees of freedom of Wiener phase noise channels with oversampling. 614-618
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-11-07 00:40 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:
