default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2018: Vail, CO, USA
- 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018. IEEE 2018, ISBN 978-1-5386-4781-3
- Wentu Song, Kui Cai:
Generalized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices. 1-5 - Christian Senger, Rohit Bohara:
A Linear Algebraic Approach to Subfield Subcodes of GRS Codes. 6-10 - Jiongyue Xing, Li Chen, Martin Bossert:
Progressive Algebraic Soft Decoding of Reed-Solomon Codes Using Module Minimization. 11-15 - Hikmet Yildiz, Babak Hassibi:
Further Progress on the GM-MDS Conjecture for Reed-Solomon Codes. 16-20 - Yaniv Fogel, Meir Feder:
Universal Batch Learning with Log-Loss. 21-25 - Zhaoqiang Liu, Vincent Y. F. Tan:
The Informativeness of k-Means for Learning Mixture Models. 26-30 - Zhinus Marzi, Soorya Gopalakrishnan, Upamanyu Madhow, Ramtin Pedarsani:
Sparsity-based Defense Against Adversarial Attacks on Linear Classifiers. 31-35 - Akshay Rangamani, Anirbit Mukherjee, Amitabh Basu
, Ashish Arora, Tejaswini Ganapathi, Sang (Peter) Chin, Trac D. Tran:
Sparse Coding and Autoencoders. 36-40 - Ratheesh Kumar Mungara, Giuseppe Caire, Ozgun Y. Bursalioglu, Chenwei Wang, Haralabos C. Papadopoulos:
Fog Massive MIMO with On-the-Fly Pilot Contamination Control. 41-45 - Chang-Sik Choi, François Baccelli:
Coverage Analysis in Cellular Networks with Planar and Vehicular Base Stations. 46-50 - Saeede Enayati, Hamid Saeedi, Hossein Pishro-Nik:
Trajectory Processes that Preserve Uniformity: A Stochastic Geometry Perspective. 51-55 - Ahmad AlAmmouri, Jeffrey G. Andrews, François Baccelli:
Asymptotic Analysis of Area Spectral Efficiency in Dense Cellular Networks. 56-60 - Junhan Kim, Byonghyo Shim:
Multiple Orthogonal Least Squares for Joint Sparse Recovery. 61-65 - Xiao-Wen Chang, Victor Jukic Prevost:
Success Probability of a Suboptimal Solution to the Sparse MAP Detection. 66-70 - Alon Kipnis, Galen Reeves, Yonina C. Eldar:
Single Letter Formulas for Quantized Compressed Sensing with Gaussian Codebooks. 71-75 - Weiyu Xu, Jirong Yi, Soura Dasgupta, Jian-Feng Cai, Mathews Jacob, Myung Cho:
Sep]ration-Free Super-Resolution from Compressed Measurements is Possible: an Orthonormal Atomic Norm Minimization Approach. 76-80 - Manabu Hagiwara, Justin Kong:
Descent Moment Distributions for Permutation Deletion Codes via Levenshtein Codes. 81-85 - Tomohiro Hayashi, Kenji Yasunaga:
On the List Decodability of Insertions and Deletions. 86-90 - Mahed Abroshan, Ramji Venkataramanan, Albert Guillén i Fàbregas:
Efficient Systematic Encoding of Non-binary VT Codes. 91-95 - Yeow Meng Chee, Han Mao Kiah, Alexander Vardy, Van Khu Vu, Eitan Yaakobi:
Codes Correcting Limited-Shift Errors in Racetrack Memories. 96-100 - Erwin Riegler, Helmut Bölcskei, Günther Koliander:
Rate-Distortion Theory for General Sets and Measures. 101-105 - Xiaoqing Fan, Aaron B. Wagner:
Variable Packet-Error Coding: the Point-to-Point Case. 106-110 - Mari Kobayashi, Giuseppe Caire, Gerhard Kramer:
Joint State Sensing and Communication: Optimal Tradeoff for a Memoryless Case. 111-115 - Mustafa Sungkar, Toby Berger:
Discrete Reconstruction Alphabets in Discrete Memoryless Source Rate-Distortion Problems. 116-120 - Ziv Goldfeld, Haim H. Permuter:
A Useful Analogy Between Wiretap and Gelfand - Pinsker Channels. 121-125 - Jake B. Perazzone, Eric Graves, Paul L. Yu, Rick S. Blum:
Inner Bound for the Capacity Region of Noisy Channels with an Authentication Requirement. 126-130 - Hao Wang, Berk Ustun, Flávio P. Calmon:
On the Direction of Discrimination: An Information-Theoretic Analysis of Disparate Impact in Machine Learning. 126-130 - Chong Li, Yingbin Liang, H. Vincent Poor, Shlomo Shamai:
A Coding Scheme for Colored Gaussian Wiretap Channels with Feedback. 131-135 - Alexander Bunin, Ziv Goldfeld, Haim H. Permuter, Shlomo Shamai, Paul Cuff, Pablo Piantanida:
Key-Message Security over State-Dependent Wiretap Channels. 136-140 - Pradeep Kr. Banerjee, Johannes Rauh, Guido Montúfar:
Computing the Unique Information. 141-145 - Yuta Sakai, Ken-ichi Iwata:
Dynamic Programming Approach of Optimal Upgradation Algorithm for an Auxiliary Random Variable of a Bernoulli Random Variable. 146-150 - Badri N. Vellambi, Jörg Kliewer:
New Results on the Equality of Exact and Wyner Common Information Rates. 151-155 - Lei Yu, Vincent Y. F. Tan:
Wyner's Common Information under Renyi Divergence Measures. 156-160 - Jun Chen, Li Xie, Yameng Chang, Jia Wang, Yizhong Wang:
Symmetric Generalized Gaussian Multiterminal Source Coding. 161-165 - Pierre Escamilla, Michèle A. Wigger, Abdellatif Zaidi:
Distributed Hypothesis Testing with Concurrent Detections. 166-170 - Omer Bilgen, Aaron B. Wagner:
The Quadratic Gaussian One-Help-Two Source-Coding Problem with Markovity. 171-175 - AmirEmad Ghassami, Sajad Khodadadian, Negar Kiyavash:
Fairness in Supervised Learning: An Information Theoretic Approach. 176-180 - Sreejith Sreekumar, Deniz Gündüz:
Testing Against Conditional Independence Under Security Constraints. 181-185 - Mehrdad Showkatbakhsh, Can Karakus, Suhas N. Diggavi:
Privacy-Utility Trade-off of Linear Regression under Random Projections and Additive Noise. 186-190 - Philipp Walk, Urbashi Mitra:
Physical Layer Secure Communications over Wireless Channels via Common Zeros. 191-195 - Gaurav Kumar Agarwal, Yahya H. Ezzeldin, Christina Fragouli, Martina Cardone:
Secure Communication over 1-2-1 Networks. 196-200 - Mohamed Seif, Ravi Tandon, Ming Li:
On the Secure Degrees of Freedom of the K-user Interference Channel with Delayed CSIT. 201-205 - Yanina Shkel, Maxim Raginsky, Sergio Verdú:
Universal Compression, List Decoding, and Logarithmic Loss. 206-210 - Changlong Wu, Maryam Hosseini, Narayana Santhanam:
Redundancy of Unbounded Memory Markov Classes with Continuity Conditions. 211-215 - Kedar Tatwawadi, Jiantao Jiao, Tsachy Weissman:
Minimax Redundancy for Markov Chains with Large State Space. 216-220 - Farhad Shirani, Siddharth Garg, Elza Erkip:
Typicality Matching for Pairs of Correlated Graphs. 221-225 - Sergey Tridenski, Ram Zamir:
Channel Input Adaptation via Natural Type Selection. 226-230 - Robert Graczyk, Amos Lapidoth:
Variations on the Guessing Problem. 231-235 - Niranjana Ambadi:
Multicast Networks Solvable over Every Finite Field. 236-240 - Tuvi Etzion, Hui Zhang:
Grassmannian Codes with New Distance Measures for Network Coding. 241-245 - Kai Cai, Guangyue Han:
On the Langberg-Médard k-Unicast Conjecture with $k=3, 4$. 246-250 - Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh, Peter W. Shor:
Superadditivity in Trade-Off Capacities of Quantum Channels. 251-255 - Holger Boche, Rafael F. Schaefer, H. Vincent Poor:
Identification over Channels with Feedback: Discontinuity Behavior and Super-Activation. 256-260 - Yuuya Yoshida, Masahito Hayashi:
Asymptotically Decoupling and Mixing Properties in Quantum System. 261-265 - Jiange Li, Muriel Médard:
Boolean Functions: Noise Stability, Non-Interactive Correlation, and Mutual Information. 266-270 - Nir Weinberger, Ofer Shayevitz:
Guessing with a Boolean Helper. 271-275 - Nir Weinberger, Ofer Shayevitz:
Self-Predicting Boolean Functions. 276-280 - Meysam Asadi, Kenneth Palacio-Baus, Natasha Devroye:
A Relaying Graph and Special Strong Product for Zero-Error Problems in Primitive Relay Channels. 281-285 - Carol Wang, Mladen Kovacevic, Vincent Y. F. Tan:
Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback. 286-290 - Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Separable Codes for the Symmetric Multiple-Access Channel. 291-295 - Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Javier R. Fonollosa:
One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels. 296-300 - Ajay Mohanan, Aswin Rajagopalan, Andrew Thangaraj:
Dual Capacity Upper Bounds for Binary-input ISI and Constrained BIBO Channels. 301-305 - Erixhen Sula, Michael Gastpar, Gerhard Kramer:
Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels with Feedback. 306-310 - S. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke:
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels. 311-315 - Elad Domanovitz, Uri Erez:
Diversity Combining via Universal Dimension-Reducing Space-Time Transformations. 316-320 - Sung-En Chiu, Anusha Lalitha, Tara Javidi:
Bit-wise Sequential Coding with Feedback. 321-325 - Jayadev Acharya, Yelun Bao, Yuheng Kang, Ziteng Sun:
Improved Bounds for Minimax Risk of Estimating Missing Mass. 326-330 - Sara Shahi, Daniela Tuninetti, Natasha Devroye:
On Identifying a Massive Number of Distributions. 331-335 - Ayush Bhandari, Felix Krahmer, Ramesh Raskar:
Unlimited Sampling of Sparse Sinusoidal Mixtures. 336-340 - Daewon Seo, Avhishek Chatterjee, Lav R. Varshney:
On Multiuser Systems with Queue-Length Dependent Service Quality. 341-345 - Tao Guo, Raymond W. Yeung:
The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding. 346-350 - Marco Mondelli, S. Hamed Hassani, Rüdiger L. Urbanke:
A New Coding Paradigm for the Primitive Relay Channel. 351-355 - Jonathan Ponniah, Liang-Liang Xie:
A Multi-Hop Framework for Multi-Source Multi-Relay All-Cast Channels. 356-360 - Simon Mak, Yao Xie:
Maximum Entropy Low-Rank Matrix Recovery. 361-365 - Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Low Permutation-Rank Matrices: Structural Properties and Noisy Completion. 366-370 - Mohammadreza Soltani, Chinmay Hegde:
Fast Low-Rank Matrix Estimation for Ill-Conditioned Matrices. 371-375 - Praneeth Narayanamurthy, Namrata Vaswani:
Provable Dynamic Robust PCA or Robust Subspace Tracking. 376-380 - Saeid Haghighatshoar, Peter Jung, Giuseppe Caire:
Improved Scaling Law for Activity Detection in Massive MIMO Systems. 381-385 - Saeid Haghighatshoar, Mahdi Barzegar Khalilsarai, Giuseppe Caire:
Multi-Band Covariance Interpolation with Applications in Massive MIMO. 386-390 - Thomas L. Marzetta:
Spatially-Stationary Propagating Random Field Model for Massive MIMO Small-Scale Fading. 391-395 - Jiwook Choi, Namyoon Lee, Song-Nam Hong, Giuseppe Caire:
Joint User Scheduling, Power Allocation, and Precoding Design for Massive MIMO Systems: A Principal Component Analysis Approach. 396-400 - Toshiyuki Tanaka:
Performance Analysis of L1-Norm Minimization for Compressed Sensing with Non-Zero-Mean Matrix Elements. 401-405 - K. Pavan Srinath, Ramji Venkataramanan:
Empirical Bayes Estimators for Sparse Sequences. 406-410 - Tom Morgan, Jelani Nelson:
A Note on Reductions Between Compressed Sensing Guarantees. 411-415 - Shirin Jalali, Xin Yuan:
Compressive Imaging Via One-Shot Measurements. 416-420 - Jin Sima, Netanel Raviv, Jehoshua Bruck:
Two Deletion Correcting Codes from Indicator Vectors. 421-425 - Ryan Gabrys, Frederic Sala:
Codes Correcting Two Deletions. 426-430 - Khodakhast Bibak, Olgica Milenkovic:
Weight Enumerators of Some Classes of Deletion Correcting Codes. 431-435 - Sundara Rajan Srinivasavaradhan, Michelle Du, Suhas N. Diggavi, Christina Fragouli:
On Maximum Likelihood Reconstruction over Multiple Deletion Channels. 436-440 - Suman Ghosh, Lakshmi Prasad Natarajan:
Linear Codes for Broadcasting with Noisy Side Information: Bounds and Code Constructions. 441-445 - Lakshmi Prasad Natarajan, Prasad Krishnan, V. Lalitha:
On Locally Decodable Index Codes. 446-450 - Yu-Chih Huang, Yi Hong, Emanuele Viterbo, Lakshmi Prasad Natarajan:
Layered Space- Time Index Coding. 451-455 - Yucheng Liu, Parastoo Sadeghi, Fatemeh Arbabjolfaei, Young-Han Kim:
Simplified Composite Coding for Index Coding. 456-460 - Uzi Pereg, Yossef Steinberg:
The Arbitrarily Varying Relay Channel. 461-465 - Dan He, Yuan Luo, Wangmei Guo:
Arbitrarily Varying Wiretap Channel: a New Scheme for the Proof of Strong Secrecy. 466-470 - Fatemeh Hosseinigoki, Oliver Kosut:
Capacity of the Gaussian Arbitrarily-Varying Channel with List Decoding. 471-475 - Remi A. Chou:
Explicit Codes for the Wiretap Channel with Uncertainty on the Eavesdropper's Channel. 476-480 - Daniel Rohweder, Jürgen Freudenberger, Sergo Shavgulidze:
Low-Density Parity-Check Codes over Finite Gaussian Integer Fields. 481-485 - Sunghye Cho, Kyungwhoon Cheun, Kyeongcheol Yang:
A Message-Passing Algorithm for Counting Short Cycles in Nonbinary LDPC Codes. 486-490 - Po-Chun Yang, Chung-Hsuan Wang, Chi-Chao Chao:
Rank Analysis of Parity-Check Matrices for Quasi-Cyclic LDPC Codes. 491-495 - Arti D. Yardi, Iryna Andriyanova, Charly Poulliat:
EBP-GEXIT Charts Over the Binary-Input AWGN Channel for Generalized and Doubly-Generalized LDPC Codes. 496-500 - Anshuka Rangi, Massimo Franceschetti, Stefano Maranò:
Decentralized Chernoff Test in Sensor Networks. 501-505 - Yanjun Han, Pritam Mukherjee, Ayfer Özgür, Tsachy Weissman:
Distributed Statistical Estimation of High-Dimensional and Nonparametric Distributions. 506-510 - Uri Hadar, Ofer Shayevitz:
Distributed Estimation of Gaussian Correlations. 511-515 - Anit Kumar Sahu, Dusan Jakovetic, Soummya Kar:
CREDO: A Communication-Efficient Distributed Estimation Algorithm. 516-520 - Or Ordentlich, Yury Polyanskiy:
Entropy Under Additive Bernoulli and Spherical Noises. 521-525 - Georg Pichler, Günther Koliander:
Information Bottleneck on General Alphabets. 526-530 - Hsiang Hsu, Shahab Asoodeh, Salman Salamatian, Flávio P. Calmon:
Generalizing Bottleneck Problems. 531-535 - Xiaoke Yang, Khalil Elkhalil, Abla Kammoun, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini:
Regularized Discriminant Analysis: A Large Dimensional Study. 536-540 - Cheuk Ting Li, Xiugang Wu, Ayfer Özgür, Abbas El Gamal:
Minimax Learning for Remote Prediction. 541-545 - Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Generalization Error Bounds for Noisy, Iterative Algorithms. 546-550 - Arpan Chattopadhyay, Urbashi Mitra:
Optimal Active Sensing for Process Tracking. 551-555 - Wasim Huleihel, Ziv Goldfeld, Tobias Koch, Mokshay M. Madiman, Muriel Médard:
Design of Discrete Constellations for Peak-Power-Limited complex Gaussian Channels. 556-560 - Emmanuel Abbe, João M. Pereira, Amit Singer:
Estimation in the Group Action Channel. 561-565 - Igal Sason, Sergio Verdú:
Improved Bounds on Guessing Moments via Rényi Measures. 566-570 - Atin Gayen, M. Ashok Kumar:
Generalized Estimating Equation for the Student-t Distributions. 571-575 - Ibrahim Issa, Michael Gastpar:
Computable Bounds on the Exploration Bias. 576-580 - Yasutada Oohama, Bagus Santoso:
Information Theoretical Analysis of Side-Channel Attacks to the Shannon Cipher System. 581-585 - Dawei Ding, Saikat Guha:
Noisy Feedback and Loss Unlimited Private Communication. 586-590 - Gowtham R. Kurri, Vinod M. Prabhakaran, Jithin Ravi:
The Role of Interaction and Common Randomness in Two-User Secure Computation. 591-595 - Varun Narayanan, Vinod M. Prabhakaran, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani:
Private Index Coding. 596-600 - Mahesh Babu Vaddi, B. Sundar Rajan:
A New Upperbound on the Broadcast Rate and Near-Optimal Vector Linear Codes for Index Coding Problems with Symmetric Neighboring Interference. 601-605 - Mahesh Babu Vaddi, B. Sundar Rajan:
On the Conjectures on Optimality of Index Codes from Interlinked Cycle Cover Scheme. 606-610 - Yihan Zhang, Shashank Vatedka, Sidharth Jaggi, Anand D. Sarwate:
Quadratically Constrained Myopic Adversarial Channels. 611-615 - Amitalok J. Budkuley, Sidharth Jaggi:
Communication over an Arbitrarily Varying Channel under a State-Myopic Encoder. 616-620 - Tongxin Li, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Quadratically Constrained Channels with Causal Adversaries. 621-625 - Paulo Ricardo Branco da Silva, Danilo Silva:
Low-Complexity Multilevel LDPC Lattices and a a Generalization of Construction $\mathrm{D}^{\prime}$. 626-630