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