default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2017: Aachen, Germany
- 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017. IEEE 2017, ISBN 978-1-5090-4096-4
- Ryan Gabrys, Eitan Yaakobi, Mario Blaum, Paul H. Siegel:
Constructions of partial MDS codes over small fields. 1-5 - Irene Marquez Corbella
, Jean-Pierre Tillich:
Attaining capacity with iterated (U|U + V) codes based on AG codes and Koetter-Vardy soft decoding. 6-10 - Anoosheh Heidarzadeh, Alex Sprintson:
An algebraic-combinatorial proof technique for the GM-MDS conjecture. 11-15 - Igor V. Zhilin, Alexey Kreshchuk, Victor V. Zyablov:
On the code distance of a woven block code construction. 16-20 - Sara D. Cardell, Marcelo Firer, Diego Napp:
Generalized column distances for convolutional codes. 21-25 - Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat:
A unified ensemble of concatenated convolutional codes. 26-30 - Ido B. Gattegno, Haim H. Permuter, Shlomo Shamai, Ayfer Özgür:
Cooperative binning for semi-deterministic channels with non-causal state information. 31-35 - Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
A new achievable rate region for multiple-access channel with states. 36-40 - Parham Noorzad, Michelle Effros, Michael Langberg:
The benefit of encoder cooperation in the presence of state information. 41-45 - Arnaud Marsiglietti, Victoria Kostina:
A lower bound on the differential entropy for log-concave random variables with applications to rate-distortion theory. 46-50 - Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
H(X) vs. H(f(X)). 51-55 - Thomas A. Courtade:
Concavity of entropy power: Equivalent formulations and generalizations. 56-60 - Alexander Span, Vahid Aref, Henning Bülow, Stephan ten Brink:
On time-bandwidth product of multi-soliton pulses. 61-65 - Kamran Keykhosravi, Erik Agrell:
A novel demodulation scheme for a memoryless optical interference channel. 66-70 - Yerzhan Sapenov, Anas Chaaban, Zouheir Rezki, Mohamed-Slim Alouini:
Optical MISO IM/DD channels: Optimality of spatial repetition codes among DC-offset STBCs. 71-75 - Mingming Cai, J. Nicholas Laneman, Bertrand M. Hochwald:
Beamforming codebook compensation for beam squint with channel capacity constraint. 76-80 - Ali Bereyhi, Mohammad Ali Sedaghat, Ralf R. Müller:
Asymptotics of nonlinear LSE precoders with applications to transmit antenna selection. 81-85 - Wassim Tabikh, Dirk T. M. Slock, Yi Yuan-Wu:
MIMO IBC beamforming with combined channel estimate and covariance CSIT. 86-90 - Wasim Huleihel, Or Ordentlich:
How to quantize n outputs of a binary symmetric channel to n - 1 bits? 91-95 - Bobak Nazer, Or Ordentlich, Yury Polyanskiy:
Information-distilling quantizers. 96-100 - Shraga I. Bross, Hagai Zalach:
Distortion bounds for source broadcasting and asymmetric data transmission with bandwidth expansion. 101-105 - Meryem Benammar, Abdellatif Zaidi:
Rate-distortion region of a gray-wyner problem with side-information. 106-110 - Georg Pichler, Pablo Piantanida, Gerald Matz:
A multiple description CEO problem with log-loss distortion. 111-115 - Shun Watanabe:
Neyman-Pearson test for zero-rate multiterminal hypothesis testing. 116-120 - Boris Ryabko, Andrey Guskov, Irina Selivanova:
Using data-compressors for statistical analysis of problems on homogeneity testing and classification. 121-125 - Te Sun Han, Ryo Nomura:
First- and second-order hypothesis testing for mixed memoryless sources with general mixture. 126-130 - Elie Najm, Roy D. Yates, Emina Soljanin:
Status updates through M/G/1/1 queues with HARQ. 131-135 - Clement Kam, Sastry Kompella, Gam D. Nguyen, Jeffrey E. Wieselthier, Anthony Ephremides:
Information freshness and popularity in mobile caching. 136-140 - Roy D. Yates, Philippe Ciblat, Aylin Yener, Michèle Angela Wigger:
Age-optimal constrained cache updating. 141-145 - Simon R. Blackburn, Tuvi Etzion, Maura B. Paterson:
PIR schemes with small download complexity and low storage requirements. 146-150 - Hilal Asi, Eitan Yaakobi:
Nearly optimal constructions of PIR and batch codes. 151-155 - Christian Schindelhauer, Andreas Jakoby, Sven Köhler:
Cyclone codes. 156-160 - Haobo Wang, Sudarsan V. S. Ranganathan, Richard D. Wesel:
Approaching capacity using incremental redundancy without feedback. 161-165 - Swanand Kadhe, A. Robert Calderbank:
Rate optimal binary linear locally repairable codes with small availability. 166-170 - Jie Hao, Shu-Tao Xia, Bin Chen:
On optimal ternary locally repairable codes. 171-175 - M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
A study on the impact of locality in the decoding of binary cyclic codes. 176-180 - Mostafa Shahabinejad, Majid Khabbazian, Masoud Ardakani:
Locally repairable codes with the optimum average information locality. 181-185 - Lan V. Truong, Vincent Y. F. Tan:
Error exponent of the common-message broadcast channel with variable-length feedback. 186-190 - Ran Averbuch, Neri Merhav:
Exact random coding exponents and universal decoders for the degraded broadcast channel. 191-195 - Kasper Fløe Trillingsgaard, Wei Yang, Giuseppe Durisi, Petar Popovski:
Feedback halves the dispersion for some two-user broadcast channels with common message. 196-200 - Chih-Hua Chang, Chih-Chun Wang:
A new capacity-approaching protocol for general 1-to-K broadcast packet erasure channels with ACK/NACK. 201-205 - Lin Song, Fady Alajaji, Tamás Linder:
On the capacity of burst noise-erasure channels with and without feedback. 206-210 - Tao Liu, Guangyue Han:
The ARMA(k) Gaussian feedback capacity. 211-215 - Oron Sabag, Haim H. Permuter, Navin Kashyap:
An optimal coding scheme for the BIBO channel with a no-repeated-ones input constraint. 216-220 - Xu Zhang, Wei Cui, Yulong Liu:
Compressed sensing with prior information via maximizing correlation. 221-225 - Maxime Ferreira Da Costa, Wei Dai:
Low dimensional atomic norm representations in line spectral estimation. 226-230 - Yanting Ma, Cynthia Rush, Dror Baron:
Analysis of approximate message passing with a class of non-separable denoisers. 231-235 - Thomas Wiese, Lorenz Weiland, Wolfgang Utschick:
Inexact projected gradients on unions of subspaces. 236-240 - D. I. De Silva, N. Kodagoda, S. R. Kodituwakku, A. J. Pinidiyaarachchi:
Analysis and enhancements of a cognitive based complexity measure. 241-245 - Sichen Zhong, Yue Zhao:
Generic cospark of a matrix can be computed in polynomial time. 246-250 - Kazuyuki Amano:
Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy. 251-255 - Maciej Skorski:
On the complexity of estimating Rènyi divergences. 256-260 - Haobo Wang, Nathan Wong, Alexander M. Baldauf, Christopher K. Bachelor, Sudarsan V. S. Ranganathan, Dariush Divsalar, Richard D. Wesel:
An information density approach to analyzing and optimizing incremental redundancy with feedback. 261-265 - Deli Qiao:
Outage effective capacity of buffer-aided diamond relay systems using HARQ-IR. 266-270 - Ulrich Speidel, Sven Puchinger, Martin Bossert:
Constraints for coded tunnels across long latency bottlenecks with ARQ-based congestion control. 271-275 - Yi Li, Mustafa Cenk Gursoy, Senem Velipasalar:
Throughput of HARQ-IR with finite blocklength codes and QoS constraints. 276-280 - Rajai Nasser, Joseph M. Renes:
Polar codes for arbitrary classical-quantum channels and arbitrary cq-MACs. 281-285 - Hao-Chung Cheng, Min-Hsiu Hsieh, Marco Tomamichel:
Sphere-packing bound for symmetric classical-quantum channels. 286-290 - Mark M. Wilde, Marco Tomamichel, Mario Berta:
A meta-converse for private communication over quantum channels. 291-295 - Hao-Chung Cheng, Min-Hsiu Hsieh:
Moderate deviations for classical-quantum channels. 296-300 - Joseph M. Renes:
Duality of channels and codes. 299-306 - Zbigniew Golebiewski, Abram Magner, Wojciech Szpankowski:
Entropy of some general plane trees. 301-305 - Ayush Jain, Rakesh Kumar Bansal:
On optimality and redundancy of side information version of SWLZ. 306-310 - Takahiro Ota, Hiroyoshi Morita:
Two-dimensional source coding by means of subblock enumeration. 311-315 - Roy D. Yates, Elie Najm, Emina Soljanin, Jing Zhong:
Timely updates over an erasure channel. 316-320 - Yin Sun, Yury Polyanskiy, Elif Uysal-Biyikoglu:
Remote estimation of the Wiener process over a channel with random delay. 321-325 - Antzela Kosta, Nikolaos Pappas, Anthony Ephremides, Vangelis Angelakis:
Age and value of information: Non-linear age case. 326-330 - Roy D. Yates, Sanjit K. Kaul:
Status updates over unreliable multiaccess channels. 331-335 - Peter Beelen, Sven Puchinger, Johan Sebastian Rosenkilde:
Twisted reed-solomon codes. 336-340 - Shu Lin, Khaled A. S. Abdel-Ghaffar, Juane Li, Keke Liu:
Iterative soft-decision decoding of reed-solomon codes of prime lengths. 341-345 - Hoang Dau, Olgica Milenkovic:
Optimal repair schemes for some families of full-length reed-solomon codes. 346-350 - Hoang Dau, Iwan M. Duursma, Han Mao Kiah, Olgica Milenkovic:
Repairing reed-solomon codes with two erasures. 351-355 - Sven Puchinger, Johan Rosenkilde:
Decoding of interleaved Reed-Solomon codes using improved power decoding. 356-360 - Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Average spectra for ensembles of LDPC codes and applications. 361-365 - Dimitris Achlioptas, S. Hamed Hassani, Wei Liu, Rüdiger L. Urbanke:
Time-invariant LDPC convolutional codes. 366-370 - Yanfang Liu, Pablo M. Olmos, Tobias Koch:
On LDPC code ensembles with generalized constraints. 371-375 - Laurent Schmalen, Vahid Aref, Fanny Jardel:
Non-uniformly coupled LDPC codes: Better thresholds, smaller rate-loss, and less complexity. 376-380 - Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Reed-solomon based nonbinary globally coupled LDPC codes: Correction of random errors and bursts of erasures. 381-385 - Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Characterizing the rate-memory tradeoff in cache networks within a factor of 2. 386-390 - Chao Tian:
A computer-aided investigation on the fundamental limits of caching. 391-395 - An Liu, Vincent K. N. Lau, Giuseppe Caire:
Capacity scaling of wireless device-to-device caching networks under the physical model. 396-400 - Jingjing Zhang, Petros Elia:
Wireless coded caching: A topological perspective. 401-405 - Yufan Huang, Huaiyu Dai:
Multiplex conductance and gossip based information spreading in multiplex networks. 406-410 - Luca Barletta, Stefano Rini:
Capacity of discrete-time wiener phase noise channels to within a constant gap. 411-415 - Malcolm Egan, Samir Medina Perlaza, Vyacheslav Kungurtsev:
Capacity sensitivity in additive non-Gaussian noise channels. 416-420 - Omur Ozel, Sennur Ulukus, Pulkit Grover:
Communicating under temperature and energy harvesting constraints. 421-425 - Alex Dytso, Ronit Bustin, H. Vincent Poor, Shlomo Shamai Shitz:
On additive channels with generalized Gaussian noise. 426-430 - Anas Chaaban, Lav R. Varshney, Mohamed-Slim Alouini:
The capacity of injective semi-deterministic two-way channels. 431-435 - George V. Moustakides, Tony Yaacoub, Yajun Mei:
Sequential estimation based on conditional cost. 436-440 - Ronan Kerviche, Saikat Guha, Amit Ashok:
Fundamental limit of resolving two point sources limited by an arbitrary point spread function. 441-445 - Ashwin Pananjady, Martin J. Wainwright, Thomas A. Courtade:
Denoising linear models with permuted data. 446-450 - Saeid Haghighatshoar, Giuseppe Caire:
Signal recovery from unlabeled samples. 451-455 - Abhishek Agarwal, Larkin Flodin, Arya Mazumdar:
Estimation of sparsity via simple measurements. 456-460 - Qing He, Di Yuan, Anthony Ephremides:
On optimal link scheduling with deadlines for emptying a wireless network. 461-465 - Chang-Sik Choi, Jae Oh Woo, Jeffrey G. Andrews:
On the coverage probability of a spatially correlated network. 466-470 - Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Daniela Tuninetti:
Efficiently finding simple schedules in Gaussian half-duplex relay line networks. 471-475 - Dimitris Cheliotis, Ioannis Kontoyiannis, Michail Loulakis, Stavros Toumpis:
Exact speed and transmission cost in a simple one-dimensional wireless delay-tolerant network. 476-480 - Takayuki Nozaki, Takafumi Nakano, Tadashi Wadayama:
Analysis of breakdown probability of wireless sensor networks with unreliable relay nodes. 481-485 - R. M. Sundaram, Arup Kumar Das, Devendra Jalihal, Venkatesh Ramaiyan:
Optimal frame synchronization over a finite state Markov channel. 486-490 - Sidharth Jaggi, Michael Langberg:
Two-way interference channels with jammers. 491-495 - Christoph Rachinger, Ralf R. Müller, Johannes B. Huber:
Bit-interleaved coded modulation for phase shift keying on the hypersphere. 496-500 - Keigo Takeuchi:
Rigorous dynamics of expectation-propagation-based signal recovery from unitarily invariant measurements. 501-505 - Ezio Biglieri, Emanuele Viterbo:
Geometrically uniform differential vector signaling schemes. 506-510 - Thibault Lesieur, Léo Miolane, Marc Lelarge, Florent Krzakala, Lenka Zdeborová:
Statistical and computational phase transitions in spiked tensor estimation. 511-515 - Jinchi Chen, Yulong Liu:
Corrupted sensing with sub-Gaussian measurements. 516-520 - Huan Zhang, Yulong Liu, Hong Lei:
On the phase transition of corrupted sensing. 521-525 - Jinming Wen, Xiao-Wen Chang, Chintha Tellambura:
On the success probability of the box-constrained rounding and Babai detectors. 526-530 - Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang:
A characterization of sampling patterns for low-tucker-rank tensor completion problem. 531-535 - Stefan M. Moser, Michail Mylonakis, Ligong Wang, Michèle A. Wigger:
Asymptotic capacity results for MIMO wireless optical communication. 536-540 - Joyson Sebastian, Ayan Sengupta, Suhas N. Diggavi:
On capacity of noncoherent MIMO with asymmetric link strengths. 541-545 - Anas Chaaban, Aydin Sezgin, Mohamed-Slim Alouini:
On the degrees-of-freedom of the MIMO three-way channel with intermittent connectivity. 546-550 - Giorgio Taricco, Giuseppa Alfano:
Outage information rate of spatially correlated multi-cluster scattering MIMO channels. 551-555 - Sha Hu, Fredrik Rusek:
A generalized zero-forcing precoder for multiple antenna Gaussian broadcast channels. 556-560 - Yu-Pin Hsu, Eytan H. Modiano, Lingjie Duan:
Age of information: Design and analysis of optimal scheduling algorithms. 561-565 - Jing Zhong, Roy D. Yates, Emina Soljanin:
Backlog-adaptive compression: Age of information. 566-570 - Yoshiaki Inoue, Hiroyuki Masuyama, Tetsuya Takine, Toshiyuki Tanaka:
The stationary distribution of the age of information in FCFS single-server queues. 571-575 - Ahmed M. Bedewy, Yin Sun, Ness B. Shroff:
Age-optimal information updates in multihop networks. 576-580 - Ting-Yi Wu, Lav R. Varshney, Vincent Y. F. Tan:
Communication over a channel that wears out. 581-585 - Ishay Haviv, Michael Langberg, Moshe Schwartz, Eitan Yaakobi:
Non-linear cyclic codes that attain the Gilbert-Varshamov bound. 586-588 - Cheuk Ting Li, Abbas El Gamal:
Strong functional representation lemma and applications to coding theorems. 589-593 - Sihuang Hu, Nir Weinberger, Ofer Shayevitz:
On the VC-dimension of binary codes. 594-598 - Jonathan Detchart, Jérôme Lacan:
Polynomial ring transforms for efficient XOR-based erasure coding. 604-608 - Wentao Huang, Jehoshua Bruck:
Secure RAID schemes from EVENODD and STAR codes. 609-613 - Xiao Li, Iwan M. Duursma:
Sector-disk codes with three global parities. 614-618 - Yeow Meng Chee, Han Mao Kiah, Alexander Vardy, Van Khu Vu, Eitan Yaakobi:
Coding for racetrack memories. 619-623 - Shuo Shao, Tie Liu, Chao Tian, Cong Shen:
On the tradeoff region of secure exact-repair regenerating codes. 624-628 - Shan Lu, Hiroshi Kamabe, Jun Cheng, Akira Yamawaki:
Construction of unrestricted-rate parallel random input-output code. 629-633 - Changho Suh, Jaewoong Cho, David Tse:
Two-way interference channel capacity: How to have the cake and eat it too. 634-638 - Mehrdad Kiamari, Amir Salman Avestimehr:
Capacity region of the symmetric injective K-user Deterministic Interference Channel. 639-643 - Yunhao Sun, Yingbin Liang, Ruchen Duan, Shlomo Shamai Shitz:
State-dependent Z-interference channel with correlated states. 644-648 - Reza Khosravi-Farsani, Amir K. Khandani:
Novel outer bounds and capacity results for the interference channel with conferencing receivers. 649-653 - Muryong Kim, Yitao Chen, Sriram Vishwanath:
Approximate capacity of a class of partially connected interference channels. 654-658 - Thomas A. Courtade, Max Fathi, Ashwin Pananjady:
Wasserstein stability of the entropy power inequality for log-concave random vectors. 659-663 - Galen Reeves:
Two-moment inequalities for Rényi entropy and mutual information. 664-668 - Mohammad Hossein Yassaee, Jingbo Liu, Sergio Verdú:
One-shot multivariate covering lemmas via weighted sum and concentration inequalities. 669-673 - Peng Xu, James Melbourne, Mokshay M. Madiman:
A min-entropy power inequality for groups. 674-678 - Satyajit Thakor, Terence Chan, Alex J. Grant:
A minimal set of shannon-type inequalities for functional dependence structures. 679-683 - Arash Gholami Davoodi, Syed Ali Jafar:
Sum-set inequalities from aligned image sets: Instruments for robust GDoF bounds. 684-688 - Hessam Mahdavifar:
Scaling exponent of sparse random linear codes over binary erasure channels. 689-693 - Zi Long Liu, Yong Liang Guan, Wai Ho Mow:
A frequency-domain approach to tightening the generalized levenshtein bound. 694-698 - Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Bounds for cooperative locality using generalized hamming weights. 699-703 - Anshoo Tandon, Han Mao Kiah, Mehul Motani:
Bounds on the asymptotic rate of binary constant subblock-composition codes. 704-708 - Matías Vera, Leonardo Rey Vega, Pablo Piantanida:
Distributed cooperative information bottleneck. 709-713 - Shigeaki Kuzuoka:
A unified approach to error exponents for multiterminal source coding systems. 714-718 - Jun Chen, Farrokh Etezadi, Ashish Khisti:
Generalized Gaussian multiterminal source coding and probabilistic graphical models. 719-723 - Abdellatif Zaidi:
Two-encoder multiterminal source coding with side information under logarithmic loss. 724-728 - Amitalok J. Budkuley, Bikash Kumar Dey, Vinod M. Prabhakaran:
Coding for arbitrarily varying remote sources. 729-733 - Amr Abdelaziz, Can Emre Koksal, Hesham El Gamal, Ashraf D. Elbayoumy:
On the compound MIMO wiretap channel with mean feedback. 734-738 - Noha M. Helal, Aria Nosratinia:
Multiple access wiretap channel with cribbing. 739-743 - Eric Graves, Tan F. Wong:
Wiretap channel capacity: Secrecy criteria, strong converse, and phase change. 744-748 - Lanqing Yu, Paul Cuff:
The shannon cipher system with a guessing eavesdropper. 749-753 - Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Privacy-aware guessing efficiency. 754-758 - Min Ye, Alexander Barg:
Optimal schemes for discrete distribution estimation under local differential privacy. 759-763 - Nazanin Takbiri, Amir Houmansadr, Dennis L. Goeckel, Hossein Pishro-Nik:
Limits of location privacy under anonymization and obfuscation. 764-768 - Ibrahim Issa, Aaron B. Wagner:
Operational definitions for some common information leakage metrics. 769-773 - Zuxing Li, Tobias J. Oechtering, Deniz Gündüz:
Smart meter privacy based on adversarial hypothesis testing. 774-778 - Jiachun Liao, Lalitha Sankar, Flávio P. Calmon, Vincent Y. F. Tan:
Hypothesis testing under maximal leakage privacy constraints. 779-783 - Netanel Raviv, Itzhak Tamo:
Cyclic subspace codes and sidon spaces. 784-788 - Olav Tirkkonen, Christopher Boyd, Roope Vehkalahti:
Grassmannian codes from multiple families of mutually unbiased bases. 789-793 - Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek:
Performance of ML decoding for ensembles of binary and nonbinary regular LDPC codes of finite lengths. 794-798 - Vladimir Sidorenko, Hannes Bartz, Antonia Wachter-Zeh:
Interleaved subspace codes in fountain mode. 799-803 - Carolyn Mayer, Christine A. Kelley:
LT codes on partial erasure channels. 804-808 - Ahmed Arafa, Abdulrahman Baknina, Sennur Ulukus:
Energy harvesting networks with general utility functions: Near optimal online policies. 809-813 - Silas L. Fong, Vincent Y. F. Tan, Ayfer Özgür:
On achievable rates of AWGN energy-harvesting channels with block energy arrival and non-vanishing error probabilities. 814-818 - Jing Yang, Jingxian Wu:
Optimal transmission for energy harvesting nodes under battery size and usage constraints. 819-823 - Abdulrahman Baknina, Sennur Ulukus:
Single-user channel with data and energy arrivals: Online policies. 824-828 - Natalia Silberstein, Tuvi Etzion, Moshe Schwartz:
Locality and availability of array codes constructed from subspaces. 829-833 - Zhijie Huang, Hong Jiang, Nong Xiao:
Efficient lowest density MDS array codes of column distance 4. 834-838 - Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han, Yuchong Hu:
Triple-fault-tolerant binary MDS array codes with asymptotically optimal repair. 839-843 - Lev Yohananov, Eitan Yaakobi:
Codes for graph erasures. 844-848 - Hessam Mahdavifar:
Fast polarization for non-stationary channels. 849-853 - Boaz Shuval, Ido Tal:
A lower bound on the probability of error of polar codes over BMS channels. 854-858 - Erik Ordentlich, Ron M. Roth:
On the pointwise threshold behavior of the binary erasure polarization subchannels. 859-863 - Ying Wang, Krishna R. Narayanan, Anxiao Andrew Jiang:
Exploiting source redundancy to improve the rate of polar codes. 864-868 - Wei Yang, Yingbin Liang, Shlomo Shamai Shitz, H. Vincent Poor:
Outer bounds for Gaussian multiple access channels with state known at one encoder. 869-873 - Pinar Sen, Young-Han Kim:
Homologous codes for multiple access channels. 874-878 - Arezou Rezazadeh, Josep Font-Segura, Alfonso Martinez, Albert Guillen i Fabregas:
An achievable error exponent for the multiple access channel with correlated sources. 879-882 - Samia Kazemi, Ali Tajer:
A broadcast approach to multiple access adapted to the multiuser channel. 883-887 - Bernhard C. Geiger, Tobias Koch:
On the information dimension rate of stochastic processes. 888-892 - Venkat Anantharam:
A variational characterization of Rényi divergences. 893-897 - Oliver Johnson, Saikat Guha:
A de Bruijn identity for discrete random variables. 898-902 - Morteza Noshad, Kevin R. Moon, Salimeh Yasaei Sekeh, Alfred O. Hero III:
Direct estimation of information divergence using nearest neighbor ratios. 903-907 - Jonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas:
Expurgated joint source-channel coding bounds and error exponents. 908-912 - Lele Wang, Ofer Shayevitz:
Graph information ratio. 913-917 - Ryo Yaguchi, Masahito Hayashi:
Second order analysis for joint source-channel coding with Markovian source. 918-922 - Basak Guler, Deniz Gündüz, Aylin Yener:
On the necessary conditions for transmitting correlated sources over a multiple access channel. 923-927 - Lin Zhou, Vincent Y. F. Tan, Mehul Motani:
Strong converse for content identification with lossy recovery. 928-932 - Silas L. Fong, Vincent Y. F. Tan:
Strong converse theorems for discrete memoryless networks with tight cut-set bound. 933-937 - Chandra Nair, Yan Nan Wang:
Reverse hypercontractivity region for the binary erasure channel. 938-942 - Jingbo Liu, Ramon van Handel, Sergio Verdú:
Beyond the blowing-up lemma: Sharp converses via reverse hypercontractivity. 943-947 - Ueli Maurer:
An information-theoretic approach to hardness amplification. 948-952 - Chen-Da Liu Zhang, Ueli Maurer, Martin Raszyk, Daniel Tschudi:
Witness-hiding proofs of knowledge for cable locks. 953-957 - Bagus Santoso, Yasutada Oohama:
Privacy amplification of distributed encrypted sources with correlated keys. 958-962 - Serj Haddad, Ayfer Özgür, Emre Telatar:
Can full-duplex more than double the capacity of wireless networks? 963-967 - Philipp Walk, Peter Jung, Babak Hassibi:
Short-message communication and FIR system identification using Huffman sequences. 968-972 - Erum Mushtaq, Sajid Ali, Syed Ali Hassan:
Novel construction methods of quaternion orthogonal designs based on complex orthogonal designs. 973-977 - Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Hypothesis test for upper bound on the size of random defective set. 978-982 - Sreejith Sreekumar, Deniz Gündüz:
Distributed hypothesis testing over noisy channels. 983-987 - Yuheng Bu, Shaofeng Zou, Venugopal V. Veeravalli:
Linear-complexity exponentially-consistent tests for universal outlying sequence detection. 988-992 - Chao Wang, Kobi Cohen, Qing Zhao:
Active hypothesis testing on a tree: Anomaly detection under hierarchical observations. 993-997 - Itzhak Tamo, Min Ye, Alexander Barg:
Fractional decoding: Error correction from partial information. 998-1002 - Yi Liu, Pengfei Huang, Paul H. Siegel:
Performance of optimal data shaping codes. 1003-1007 - Antonio Campello, Ling Liu, Cong Ling:
Multilevel code construction for compound fading channels. 1008-1012 - Jessica C. Fan, Thomas H. Cormen:
Dense gray codes in mixed radices. 1013-1017 - Wael Halbawi, Iwan M. Duursma, Hoang Dau, Babak Hassibi:
Balanced and sparse Tamo-Barg codes. 1018-1022 - Stanislav Kruglik, Alexey A. Frolov:
Bounds and constructions of codes with all-symbol locality and availability. 1023-1027 - Swanand Kadhe, Alex Sprintson:
Security for minimum storage regenerating codes and locally repairable codes. 1028-1032 - Uzi Pereg, Yossef Steinberg:
The arbitrarily varying degraded broadcast channel with causal side information at the encoder. 1033-1037 - Chandra Nair, Mehdi Yazdanpanah:
Sub-optimality of superposition coding region for three receiver broadcast channel with two degraded message sets. 1038-1042 - Dor Itzhak, Yossef Steinberg:
The broadcast channel with degraded message sets and unreliable conference. 1043-1047 - Mohamed Salman, Mahesh K. Varanasi:
On the capacity region of the K-user discrete memoryless broadcast channel with two degraded messages. 1048-1052 - Yasutada Oohama:
The optimal exponent function for the additive white Gaussian noise channel at rates above the capacity. 1053-1057 - Alex Dytso, Mario Goldenbaum, H. Vincent Poor, Shlomo Shamai Shitz:
A generalized Ozarow-Wyner capacity bound with applications. 1058-1062 - Sihuang Hu, Itzhak Tamo, Ofer Shayevitz:
A bound on the shannon capacity via a linear programming variation. 1063-1066 - Arash Behboodi, Gholamreza Alirezaei, Rudolf Mathar:
On the discreteness of capacity-achieving distributions for the censored channel. 1067-1071 - Liang Liu, Wei Yu:
Massive device connectivity with massive MIMO. 1072-1076 - Jinyuan Chen:
On the MISO channel with feedback: Can infinitely massive antennas achieve infinite capacity? 1077-1081 - Ismail Ben Atitallah, Christos Thrampoulidis, Abla Kammoun, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini, Babak Hassibi:
The BOX-LASSO with application to GSSK modulation in massive MIMO systems. 1082-1086 - Zheng Dong, Jian-Kang Zhang, Lei Huang:
Multi-users space-time modulation with QAM division for massive uplink communications. 1087-1091 - Antonio Bazco, Paul de Kerret, David Gesbert, Nicolas Gresset:
Generalized degrees-of-freedom of the 2-user case MISO broadcast channel with distributed CSIT. 1092-1096 - Fan Zhang, Mohamed Fadel, Aria Nosratinia:
Spatially correlated MIMO broadcast channel: Analysis of overlapping correlation eigenspaces. 1097-1101 - Charles Jeon, Kaipeng Li, Joseph R. Cavallaro, Christoph Studer:
On the achievable rates of decentralized equalization in massive MU-MIMO systems. 1102-1106 - Sebastian Stern, Robert F. H. Fischer:
V-BLAST in lattice reduction and integer forcing. 1107-1111 - Nicolò Michelusi, Marco Levorato:
Energy-based adaptive multiple access in LPWAN IoT systems with energy harvesting. 1112-1116 - Ahmed Arafa, Sennur Ulukus:
Near optimal online distortion minimization for energy harvesting nodes. 1117-1121 - Baran Tan Bacinoglu, Elif Uysal-Biyikoglu:
Scheduling status updates to minimize age of information with an energy harvesting sensor. 1122-1126 - Mehdi Dabirnia, Tolga M. Duman:
Code design for binary energy harvesting channel. 1127-1131 - Valerio Cambareri, Amirafshar Moshtaghpour, Laurent Jacques:
A greedy blind calibration method for compressed sensing with unknown sensor gains. 1132-1136 - Jess Banks, Cristopher Moore, Roman Vershynin, Nicolas Verzelen, Jiaming Xu:
Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization. 1137-1141 - Vasileios Nakos:
Almost optimal phaseless compressed sensing with sublinear decoding time. 1142-1146 - Morteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal:
A characterization of sampling patterns for low-rank multi-view data completion problem. 1147-1151 - Kentaro Sumigawa, Hirosuke Yamamoto:
Coding of binary AIFV code trees. 1152-1156 - Yanina Shkel, Maxim Raginsky, Sergio Verdú:
Universal lossy compression under logarithmic loss. 1157-1161 - Avhishek Chatterjee, Lav R. Varshney:
Towards optimal quantization of neural networks. 1162-1166 - Serdar Yüksel:
Stochastic stability of non-Markovian processes and adaptive quantizers. 1167-1171 - Masahito Hayashi, Masaki Owari, Go Kato, Ning Cai:
Secrecy and robustness for active attack in secure network coding. 1172-1176 - Mohammad Fahim, Viveck R. Cadambe:
Linear network coding for two-unicast-Z networks: A commutative algebraic perspective and fundamental limits. 1177-1181 - Tian Ding, Xiaojun Yuan, Soung Chang Liew:
Network-coded fronthaul transmission for cache-aided C-RAN. 1182-1186 - Nicolò Michelusi:
Optimal secondary access in retransmission based primary networks via chain decoding. 1187-1191 - Yoones Hashemi, Amir H. Banihashemi:
Characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular LDPC codes. 1192-1196 - Youngjun Hwang, Sunghye Cho, Kyeongcheol Yang:
An adaptive EMS algorithm for nonbinary LDPC codes. 1197-1201 - Dixia Deng, Hengzhou Xu, Baoming Bai, Ji Zhang:
A two-stage decoding algorithm for short nonbinary LDPC codes with Near-ML performance. 1202-1206 - Sudarsan V. S. Ranganathan, Dariush Divsalar, Richard D. Wesel:
Design of improved quasi-cyclic protograph-based Raptor-like LDPC codes for short block-lengths. 1207-1211 - Rami Cohen, Yuval Cassuto:
Finite-length LDPC codes on the q-ary multi-bit channel. 1212-1216 - Seyyed Mohammadreza Azimi, Osvaldo Simeone, Avik Sengupta, Ravi Tandon:
Online edge caching in fog-aided wireless networks. 1217-1221 - Shirin Saeedi Bidokhti, Michèle A. Wigger, Aylin Yener:
Benefits of cache assignment on degraded broadcast channels. 1222-1226 - Parisa Hassanzadeh, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Rate-memory trade-off for the two-user broadcast caching network with correlated sources. 1227-1231 - Navid Naderializadeh, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
On the optimality of separation between caching and delivery in general cache networks. 1232-1236 - Karthikeyan Shanmugam, Antonia M. Tulino, Alexandros G. Dimakis:
Coded caching with linear subpacketization is possible using Ruzsa-Szeméredi graphs. 1237-1241 - Oliver Kosut, Jörg Kliewer:
Dispersion of the discrete arbitrarily-varying channel with limited shared randomness. 1242-1246 - Nir Elkayam, Meir Feder:
On the calculation of the minimax-converse of the channel coding problem. 1247-1251 - Si-Hyeon Lee, Vincent Y. F. Tan, Ashish Khisti:
Exact moderate deviation asymptotics in streaming data transmission. 1252-1256 - Longguang Li, Aslan Tchamkerten:
Infinite dispersion in bursty communication. 1257-1261 - Lin Zhou, Vincent Y. F. Tan, Mehul Motani:
Achievable moderate deviations asymptotics for streaming Slepian-Wolf coding. 1262-1266 - Weihao Gao, Sewoong Oh, Pramod Viswanath:
Demystifying fixed k-nearest neighbor information estimators. 1267-1271 - Jhelum Chakravorty, Aditya Mahajan:
Structure of optimal strategies for remote estimation over Gilbert-Elliott channel with feedback. 1272-1276 - Jonathan G. Ligo, George V. Moustakides, Venugopal V. Veeravalli:
Sparse Gaussian mixture detection: Low complexity, high performance tests via quantization. 1277-1281 - Mahdi Barzegar Khalilsarai, Saeid Haghighatshoar, Giuseppe Caire, Gerhard Wunder:
Compressive estimation of a stochastic process with unknown autocorrelation function. 1282-1286 - Yang Cao, Yao Xie:
Robust sequential change-point detection by convex optimization. 1287-1291 - Min Kyu Song, Hong-Yeop Song:
Perfect polyphase sequences from cubic polynomials. 1292-1295 - Hayato Takahashi:
Bayesian definition of random sequences with respect to conditional probabilities. 1296-1300 - Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the correlation between Boolean functions of sequences of random variables. 1301-1305 - Ryan Gabrys, Olgica Milenkovic:
The hybrid k-deck problem: Reconstructing sequences from short and long traces. 1306-1310 - Neri Merhav:
Reliability of universal decoding based on vector-quantized codewords. 1311-1315 - Emmanuel Abbe, João M. Pereira, Amit Singer:
Sample complexity of the boolean multireference alignment problem. 1316-1320 - Soheil Gherekhloo, Yasemin Karacora, Aydin Sezgin:
On the optimality of treating interference as noise in the 2 × M LD X-channel. 1321-1325 - AmirEmad Ghassami, Negar Kiyavash:
Interaction information for causal inference: The case of directed triangle. 1326-1330 - Taehyung J. Lim, Massimo Franceschetti:
Completely blind sensing of multi-band signals. 1331-1335 - Shao-Lun Huang, Anuran Makur, Lizhong Zheng, Gregory W. Wornell:
An information-theoretic approach to universal feature selection in high-dimensional inference. 1336-1340 - Saber Salehkaleybar, Jalal Etesami, Negar Kiyavash:
Identifying nonlinear 1-step causal influences in presence of latent variables. 1341-1345 - Hiroshi Nagaoka:
Information-geometrical characterization of statistical models which are statistically equivalent to probability simplexes. 1346-1350 - Weihao Gao, Sewoong Oh, Pramod Viswanath:
Density functional estimators with k-nearest neighbor bandwidths. 1351-1355 - Philipp Grohs, Thomas Wiatowski, Helmut Bölcskei:
Energy decay and conservation in deep convolutional neural networks. 1356-1360 - Loren Lugosch, Warren J. Gross:
Neural offset min-sum decoding. 1361-1365 - Lionel Fillatre, Igor V. Nikiforov:
Learning-based epsilon most stringent test for Gaussian samples classification. 1366-1370 - Javad Heydari, Ali Tajer:
Quickest search and learning over multiple sequences. 1371-1375 - Jason M. Klusowski, Andrew R. Barron:
Minimax lower bounds for ridge combinations including neural nets. 1376-1380 - Ilya Soloveychik, Yu Xiang, Vahid Tarokh:
Pseudo-wigner matrices from dual BCH codes. 1381-1385 - Bella Bose, Noha Elarief, Luca G. Tallini:
On codes achieving zero error capacities in limited magnitude error channels. 1386-1390 - Akiko Manada, Hiroyoshi Morita:
On the capacities of balanced codes with run-length constraints. 1391-1395 - Yeow Meng Chee, Han Mao Kiah, San Ling, Hengjia Wei:
Geometric orthogonal codes better than optical orthogonal codes. 1396-1400 - Baris Nakiboglu:
The Augustin center and the sphere packing bound for memoryless channels. 1401-1405 - Ankit Singh Rawat:
Secrecy capacity of minimum storage regenerating codes. 1406-1410 - Su Li, Michael Gastpar:
Cooperative data exchange based on MDS codes. 1411-1415 - Netanel Raviv:
Asymptotically optimal regenerating codes over any field. 1416-1420 - Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
Private information retrieval in distributed storage systems using an arbitrary linear code. 1421-1425 - Victor Quintero, Samir Medina Perlaza, Jean-Marie Gorce, H. Vincent Poor:
Nash region of the linear deterministic interference channel with noisy output feedback. 1426-1430 - Borna Kananian, Mohammad Ali Maddah-Ali, Seyed Pooya Shariatpanahi, Babak H. Khalaj:
Characterization of degrees of freedom versus receivers backhaul load in K-user interference channel. 1431-1435 - Mirza Uzair Baig, Anders Høst-Madsen, Aria Nosratinia:
Discrete modulation for interference mitigation. 1436-1440 - Arun Padakandla:
Communicating correlated sources over an interference channel. 1441-1445 - Aly El Gamal:
Topological interference management: Linear cooperation is not useful for Wyner's networks. 1446-1450 - Frantisek Matús:
Urns and entropies revisited. 1451-1454 - Christoph Kawan, Serdar Yüksel:
Metric and topological entropy bounds on state estimation for stochastic non-linear systems. 1455-1459 - Mehrdad Valizadeh, Amin Gohari:
Playing games with bounded entropy. 1460-1464 - Murat Kocaoglu, Alexandros G. Dimakis, Sriram Vishwanath, Babak Hassibi:
Entropie causality anc greedy minimum entropy coupling. 1465-1469 - Zbigniew Golebiewski, Marcin Kardas, Jakub Lemiesz, Krzysztof Majcher:
On structural entropy of uniform random intersection graphs. 1470-1474 - Jiantao Jiao, Yanjun Han, Tsachy Weissman:
Dependence measures bounding the exploration bias for general measurements. 1475-1479 - Anshoo Tandon, Han Mao Kiah, Mehul Motani:
Binary subblock energy-constrained codes: Bounds on code size and asymptotic rate. 1480-1484 - Norbert Goertz:
Sampled graph-signals: Iterative recovery with an analytic error bound. 1485-1489 - Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
Multidimensional semiconstrained systems. 1490-1494 - Achilleas Anastasopoulos, Jui Wu:
Variable-length codes for channels with memory and feedback: Error-exponent lower bounds. 1495-1499 - Neri Merhav:
On empirical cumulant generating functions of code lengths for individual sequences. 1500-1504 - Ho-Hsuan Chang:
Degree-(k + 1) perfect Gaussian integer sequences of period pk. 1505-1509 - Michal Horovitz, Eitan Yaakobi:
Reconstruction of sequences over non-identical channels. 1510-1514 - Serdar Boztas, Ferruh Özbudak, Eda Tekin:
Classification of a sequence family using plateaued functions. 1515-1518 - Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Secret key agreement under discussion rate constraints. 1519-1523 - Remi A. Chou, Aylin Yener:
A game theoretic treatment for pair-wise secret-key generation in many-to-one networks. 1524-1528 - En-Hui Yang, Xin-Wen Wu:
Information-theoretically secure key generation and management. 1529-1533 - Zouheir Rezki, Mohamed-Slim Alouini:
Secret-key agreement with public discussion over multi-antenna transmitters with amplitude constraints. 1534-1538 - Holger Boche, Christian Deppe:
Robust and secure identification. 1539-1543 - Christopher T. Chubb, Vincent Y. F. Tan, Marco Tomamichel:
Moderate deviation analysis for classical communication over quantum channels. 1544-1548 - Amin Baumeler, Charles Alexandre Bédard, Gilles Brassard, Stefan Wolf:
Kolmogorov amplification from Bell correlation. 1544-1558 - Peter Harremoës:
Quantum information on spectral sets. 1549-1553 - Felix Leditzky, Nilanjana Datta, Graeme Smith:
Degradable states and one-way entanglement distillation. 1559-1562 - Abram Magner, Ananth Grama, Jithin K. Sreedharan, Wojciech Szpankowski:
Recovery of vertex orderings in dynamic graphs. 1563-1567 - Shota Saito, Hideki Yagi, Toshiyasu Matsushima:
Variable-length lossy compression allowing positive overflow and excess distortion probabilities. 1568-1572 - Ronit Bustin, Ofer Shayevitz:
On lossy compression of binary matrices. 1573-1577 - Payam Delgosha, Venkat Anantharam:
Universal lossless compression of graphical data. 1578-1582 - Amir-Reza Asadi, Emmanuel Abbe, Sergio Verdú:
Compressing data on graphs with clusters. 1583-1587 - Sundeep Rangan, Philip Schniter, Alyson K. Fletcher:
Vector approximate message passing. 1588-1592 - Erdem Biyik, Jean Barbier, Mohamad Dia:
Generalized approximate message-passing decoder for universal sparse superposition codes. 1593-1597 - Nina Lin, Suihua Cai, Xiao Ma:
Block Markov superposition transmission of BCH codes with iterative hard-decision decoding. 1598-1602 - Arun Kadavankandy, Konstantin Avrachenkov, Laura Cottatellucci, Rajesh Sundaresan:
Belief propagation for subgraph detection with imperfect side-information. 1603-1607 - Tibor Keresztfalvi, Amos Lapidoth:
Multiplexing zero-error and rare-error communications over a noisy channel with feedback. 1608-1612 - Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
The exact rate-memory tradeoff for caching with uncoded prefetching. 1613-1617 - Assaf Kartowsky, Ido Tal:
Greedy-merge degrading has optimal power-law. 1618-1622 - Jie Li, Xiaohu Tang, Chao Tian:
A generic transformation for optimal repair bandwidth and rebuilding access in MDS codes. 1623-1627 - Justin Kong, Manabu Hagiwara:
Multipermutation Ulam sphere analysis toward characterizing maximal code size. 1628-1632 - Ahmed Badr, Devin Lui, Ashish Khisti, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Multiplexed FEC for multiple streams with different playout deadlines. 1633-1637 - Ming Fai Wong, Michelle Effros, Michael Langberg:
A code equivalence between streaming network coding and streaming index coding. 1638-1642 - Jun Muramatsu, Shigeki Miyake:
On the error probability of stochastic decision and stochastic decoding. 1643-1647 - Parham Noorzad, Michelle Effros, Michael Langberg, Victoria Kostina:
The birthday problem and zero-error list codes. 1648-1652 - Yijin Zhang, Yi Chen, Yuan-Hsun Lo, Wing Shing Wong:
The zero-error capacity of a collision channel with successive interference cancellation. 1653-1657 - Marco Dalai, Venkatesan Guruswami, Jaikumar Radhakrishnan:
An improved bound on the zero-error list-decoding capacity of the 4/3 channel. 1658-1662 - Amos Lapidoth, Shirin Saeedi Bidokhti, Michèle A. Wigger:
Dependence balance in multiple access channels with correlated sources. 1663-1667 - Erman Koken, Ertem Tuncel:
On minimum energy for robust Gaussian joint source-channel coding with a distortion-noise profile. 1668-1672 - Arun Padakandla:
Communicating correlated sources over a MAC. 1673-1677 - Svetlana Reznikov, Meir Feder:
Spatially coupled LDLC: New constructions. 1678-1682 - Li Chen, Shiyuan Mo, Daniel J. Costello Jr., David G. M. Mitchell, Roxana Smarandache:
A frotograph-based design of quasi-cyclic spatially coupled LDPC codes. 1683-1687 - Lei M. Zhang, Frank R. Kschischang:
Complexity-optimized concatenated LDGM-staircase codes. 1688-1692 - Homa Esfahanizadeh, Ahmed H. Hareedy, Lara Dolecek:
A novel combinatorial framework to construct spatially-coupled codes: Minimum overlap partitioning. 1693-1697 - Masahito Hayashi:
Secure wireless communication under spatial and local Gaussian noise assumptions. 1698-1702 - Remi A. Chou, Aylin Yener:
The degraded Gaussian multiple access wiretap channel with selfish transmitters: A coalitional game theory perspective. 1703-1707 - Mojtaba Vaezi, Wonjae Shin, H. Vincent Poor, Jungwoo Lee:
MIMO Gaussian wiretap channels with two transmit antennas: Optimal precoding and power allocation. 1708-1712 - Yutaka Jitsumatsu:
Computation of the random coding secrecy exponent for a constant composition ensemble. 1713-1717 - Markus Grassl, Sirui Lu, Bei Zeng:
Codes for simultaneous transmission of quantum and classical information. 1718-1722 - Joseph M. Renes:
Belief propagation decoding of quantum channels by passing quantum messages. 1723-1727 - Xin Wang, Wei Xie, Runyao Duan:
Semidefinite programming converse bounds for classical communication over quantum channels. 1728-1732 - Chung-Chin Lu, Shiuan-Hao Kuo:
On the feasibility conditions of quantum state discrimination. 1733-1737 - Urs Niesen:
An information-theoretic analysis of deduplication. 1738-1742 - Cheuk Ting Li, Abbas El Gamal:
Extended Gray-Wyner system with complementary causal side information. 1743-1747 - Hideki Yagi, Te Sun Han:
Variable-length resolvability for general sources. 1748-1752 - Danny Hucke, Markus Lohrey:
Universal tree source coding using grammar-based compression. 1753-1757 - Yuval Cassuto, Evyatar Hemo, Sven Puchinger, Martin Bossert:
Multi-block interleaved codes for local and global read access. 1758-1762 - Mustafa Cemil Coskun, Gianluigi Liva, Alexandre Graell i Amat, Michael Lentmaier:
Successive cancellation decoding of single parity-check product codes. 1763-1767 - Mahed Abroshan, Ramji Venkataramanan, Albert Guillen i Fabregas:
Codes for channels with segmented edits. 1768-1772 - Alejandro Lancho, Tobias Koch, Giuseppe Durisi:
A high-SNR normal approximation for single-antenna Rayleigh block-fading channels. 1773-1777 - Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures. 1778-1782 - Ori Peled, Oron Sabag, Haim H. Permuter:
Feedback capacity and coding for the (0, k)-RLL input-constrained BEC. 1783-1787 - Christian Badertscher, Sandro Coretti, Chen-Da Liu Zhang, Ueli Maurer:
Efficiency lower bounds for commit-and-prove constructions. 1788-1792 - Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski:
Information set decoding with soft information and some cryptographic applications. 1793-1797 - Thomas Debris-Alazard, Jean-Pierre Tillich:
Statistical decoding. 1798-1802 - Lieneke Kusters, Tanya Ignatenko, Frans M. J. Willems, Roel Maes, Erik van der Sluis, Georgios N. Selimis:
Security of helper data schemes for SRAM-PUF in multiple enrollment scenarios. 1803-1807 - Mohamed S. Nafea, Aylin Yener:
New models for interference and broadcast channels with confidential messages. 1808-1812 - Wentao Huang, Jehoshua Bruck:
Secret sharing with optimal decoding and repair bandwidth. 1813-1817 - Sung Hoon Lim, Chen Feng, Adriano Pastore, Bobak Nazer, Michael Gastpar:
Towards an algebraic network information theory: Simultaneous joint typicality decoding. 1818-1822 - Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the sub-optimality of single-letter coding in multi-terminal communications. 1823-1827 - Ishaque Ashar Kadampot, Matthieu R. Bloch:
Coordination with clustered common randomness in a three-terminal line network. 1828-1832 - Natarajan Lakshmi Prasad, Yi Hong, Emanuele Viterbo:
Capacity optimality of lattice codes in common message Gaussian broadcast channels with coded side information. 1833-1837 - Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I. R. Costa:
On the communication cost of determining an approximate nearest lattice point. 1838-1842 - Vinay A. Vaishampayan, Maiara F. Bollauf:
Communication cost of transforming a nearest plane partition to the Voronoi partition. 1843-1847 - Shanxiang Lyu, Antonio Campello, Cong Ling, Jean-Claude Belfiore:
Compute-and-forward over block-fading channels using algebraic lattices. 1848-1852 - Marco Mondelli, S. Hamed Hassani, Rüdiger L. Urbanke:
Construction of polar codes with sublinear complexity. 1853-1857 - Giacomo Ricciutelli, Marco Baldi, Franco Chiaraluce, Gianluigi Liva:
On the error probability of short concatenated polar and cyclic codes with interleaving. 1858-1862 - Peter Trifonov, Grigorii Trofimiuk:
A randomized construction of polar subcodes. 1863-1867 - Takumi Murata, Hideki Ochiai:
On design of CRC codes for polar codes with successive cancellation list decoding. 1868-1872 - Mohamed Fadel, Aria Nosratinia:
Block-fading broadcast channel with hybrid CSIT and CSIR. 1873-1877 - Hirosuke Yamamoto, Shintaro Hara:
Application of Yamamoto-Itoh coding scheme to discrete memoryless broadcast channels. 1878-1882 - Sunghyun Kim, Soheil Mohajer, Changho Suh:
Coding across heterogeneous parallel erasure broadcast channels is useful. 1883-1887 - Henry P. Romero, Mahesh K. Varanasi:
Rate splitting and superposition coding for concurrent groupcasting over the broadcast channel: A general framework. 1888-1892 - Hua Sun, Syed Ali Jafar:
Private information retrieval from MDS coded data with colluding servers: Settling a conjecture by Freij-Hollanti et al. 1893-1897 - Karim A. Banawan, Sennur Ulukus:
Multi-message private information retrieval. 1898-1902 - Razan Tajeddine, Salim El Rouayheb:
Robust private information retrieval on coded data. 1903-1907 - Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti, Salim El Rouayheb:
Private information retrieval schemes for codec data with arbitrary collusion patterns. 1908-1912 - Chi-Yo Tsai, Gaurav Kumar Agarwal, Christina Fragouli, Suhas N. Diggavi:
A distortion based approach for protecting inferences. 1913-1917 - Chien-Yi Wang, Abdellatif Zaidi:
Rate-distortion regions of instances of cascade source coding with side information. 1918-1922 - Victoria Kostina, Ertem Tuncel:
The rate-distortion function for successive refinement of abstract sources. 1923-1927 - Kazuho Watanabe:
Rate-distortion tradeoffs under Kernel-based distortion measures. 1928-1932 - Mladen Kovacevic, Vincent Y. F. Tan:
Coding for the permutation channel with insertions, deletions, substitutions, and erasures. 1933-1937 - Manabu Hagiwara:
Perfect codes for single balanced adjacent deletions. 1938-1942 - Haruhiko Kaneko:
Timing-drift channel model and marker-based error correction coding. 1943-1947 - Antonia Wachter-Zeh:
Limits to list decoding of insertions and deletions. 1948-1952 - Ziv Goldfeld, Paul Cuff, Haim H. Permuter:
The Gelfand-Pinsker wiretap channel: Higher secrecy rates via a novel superposition code. 1953-1957 - Remi A. Chou, Aylin Yener:
The Gaussian multiple access wiretap channel when the eavesdropper can arbitrarily jam. 1958-1962 - Chong Li, Yingbin Liang:
Secrecy capacity of the first-order autoregressive moving average Gaussian channel with feedback. 1963-1967 - Mohammad Reza Khalili Shoja, George Traian Amariucai, Zhengdao Wang, Shuangqing Wei, Jing Deng:
Asymptotic converse bound for secret key capacity in hidden Markov model. 1968-1972 - Yuxiang Yang, Ge Bai, Giulio Chiribella, Masahito Hayashi:
Compression for quantum population coding. 1973-1977 - Hao-Chung Cheng, Min-Hsiu Hsieh:
Moderate deviations for quantum hypothesis testing and a martingale inequality. 1978-1982 - Holger Boche, Minglai Cai, Christian Deppe, Janis Nötzel:
Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks. 1983-1987 - David Sutter, Mario Berta, Marco Tomamichel:
Quantum Markov chains and logarithmic trace inequalities. 1988-1992 - Annina Bracher, Amos Lapidoth, Christoph Pfister:
Distributed task encoding. 1993-1997 - Ishan Jindal, Matthew S. Nokleby:
Performance limits on the classification of Kronecker-structured models. 1998-2002 - Jorge F. Silva, Pablo Piantanida:
The redundancy gains of almost lossless universal source coding over envelope families. 2003-2007 - Vinay Praneeth Boda, Prakash Narayan:
Universal sampling rate distortion. 2008-2012 - Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Alexander Vardy:
Cooling codes: Thermal-management coding for high-performance interconnects. 2013-2017 - Shancheng Zhao, Qin Huang, Xiao Ma, Baoming Bai:
Recursive block Markov superposition transmission of short codes. 2018-2022 - Holger Boche, Ullrich J. Mönich, Ezra Tampubolon:
Complete characterization of the solvability of PAPR reduction for OFDM by tone reservation. 2023-2027 - Elie N. Mambou, Theo G. Swart:
Construction of q-ary constant weight sequences using a knuth-like approach. 2028-2032 - Anyu Wang, Zhifang Zhang, Dongdai Lin:
Bounds and constructions for linear locally repairable codes over binary fields. 2033-2037 - Bin Chen, Shu-Tao Xia, Jie Hao:
Locally repairable codes with multiple (ri, δi)-localities. 2038-2042 - Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko:
∊-MSR codes with small sub-packetization. 2043-2047 - Birenjith Sasidharan, Myna Vajha, P. Vijay Kumar:
An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and d < (n - 1). 2048-2052 - Tianyu Yang, Nan Liu, Wei Kang, Shlomo Shamai Shitz:
An upper bound on the sum capacity of the downlink multicell processing with finite backhaul capacity. 2053-2057 - Shirin Saeedi Bidokhti, Gerhard Kramer, Shlomo Shamai Shitz:
Capacity bounds on the downlink of symmetric, multi-relay, single receiver C-RAN networks. 2058-2062 - Shouvik Ganguly, Young-Han Kim:
On the capacity of cloud radio access networks. 2063-2067 - Inaki Estella Aguerri, Abdellatif Zaidi, Giuseppe Caire, Shlomo Shamai Shitz:
On the capacity of cloud radio access networks with oblivious relaying. 2068-2072 - Shengtian Yang, Rui Xu, Jun Chen, Jian-Kang Zhang:
Intrinsic capacity. 2073-2077 - Zhengwei Ni, Mehul Motani:
Gaussian channels with minimum amplitude constraints: When is optimal input binary? 2078-2082 - Sandra Bender, Meik Dorpinghaus, Gerhard P. Fettweis:
On the achievable rate of bandlimited continuous-time 1-bit quantized AWGN channels. 2083-2087 - Brian M. Kurkoski, Hideki Yagi:
Single-bit quantization of binary-input, continuous-output channels. 2088-2092 - Nir Weinberger, Neri Merhav:
Lower bounds on parameter modulation-estimation under bandwidth constraints. 2093-2097 - Andre Manoel, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Multi-layer generalized linear estimation. 2098-2102 - Kazuto Fukuchi, Jun Sakuma:
Minimax optimal estimators for additive scalar functionals of discrete distributions. 2103-2107 - Jean Barbier, Nicolas Macris:
I-MMSE relations in random linear estimation and a sub-extensive interpolation method. 2108-2112 - Seyed Pooya Shariatpanahi, Giuseppe Caire, Babak Hossein Khalaj:
Multi-antenna coded caching. 2113-2117 - Ramina Ghods, Charles Jeon, Gulnar Mirza, Arian Maleki, Christoph Studer:
Optimally-tuned nonparametric linear equalization for massive MU-MIMO systems. 2118-2122 - Ruijie Xu, Hao Ge, Randall A. Berry:
Games on linear deterministic channels with eavesdroppers. 2123-2127 - Mohamed S. Nafea, Aylin Yener:
A new broadcast wiretap channel model. 2128-2132 - Wei Yang, Rafael F. Schaefer, H. Vincent Poor:
Secrecy-reliability tradeoff for semi-deterministic wiretap channels at finite Blocklength. 2133-2137 - Congduan Li, Xuan Guang, Chee Wei Tan, Raymond W. Yeung:
On secure asymmetric multilevel diversity coding systems. 2138-2142 - Burak Çakmak, Manfred Opper, Ole Winther, Bernard H. Fleury:
Dynamical functional theory for compressed sensing. 2143-2147 - Alon Kipnis, Galen Reeves, Yonina C. Eldar, Andrea J. Goldsmith:
Compressed sensing under optimal quantization. 2148-2152 - Swayambhoo Jain, Alexander Gutierrez, Jarvis D. Haupt:
Noisy tensor completion for tensors with a sparse canonical polyadic factor. 2153-2157 - Sajjad Beygi, Shirin Jalali, Arian Maleki, Urbashi Mitra:
Compressed sensing of compressible signals. 2158-2162 - Ravi Kiran Raman, Lav R. Varshney:
Budget-optimal clustering via crowdsourcing. 2163-2167 - Ravi Kiran Raman, Lav R. Varshney:
Universal joint image clustering and registration using partition information. 2168-2172 - Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
How to find a joint probability distribution of minimum entropy (almost) given the marginals. 2173-2177 - Chung-Yi Lin, I (Eli) Chien, I-Hsiang Wang:
On the fundamental statistical limit of community detection in random hypergraphs. 2178-2182 - Hui Zhang, Eitan Yaakobi, Natalia Silberstein:
Multiset combinatorial batch codes. 2183-2187 - Robert M. Taylor, Lamine Mili, Amir I. Zaghloul:
Structured spherical codes with asymptotically optimal distance distributions. 2188-2192 - Valentin B. Afanassiev, Alexander A. Davydov:
Weight spectrum of quasi-perfect binary codes with distance 4. 2193-2197 - Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Kronecker product and tiling of permutation arrays for hamming distances. 2198-2202 - Weiqiang Yang, Ying Li, Xiaopu Yu:
Performance of spinal codes with sliding window decoding. 2203-2207 - Islam Samy, Gokhan Calis, Onur Ozan Koyluoglu:
Secure regenerating codes for hybrid cloud storage systems. 2208-2212 - Marwen Zorgui, Zhiying Wang:
Centralized multi-node repair for minimum storage regenerating codes. 2213-2217 - Saeid Sahraei, Michael Gastpar:
GDSP: A graphical perspective on the distributed storage systems. 2218-2222 - Koosha Pourtahmasi Roshandeh, Moslem Noori, Masoud Ardakani, Chinthananda Tellambura:
Distributed storage allocation for multi-class data. 2223-2227 - Amir Salimi, Wenyi Zhang, Satish Vedantam, Urbashi Mitra:
The capacity-distortion function for multihop channels with state. 2228-2232 - Xiugang Wu, Leighton Pate Barnes, Ayfer Özgür:
The geometry of the relay channel. 2233-2237 - Leila Ghabeli:
The CF-DF approach for relay networks based on multiple descriptions with the shared binning. 2238-2242 - Linqi Song, Christina Fragouli:
Making recommendations bandwidth aware. 2243-2247 - Yair Yona, Suhas N. Diggavi:
The effect of bias on the guesswork of hash functions. 2248-2252 - Wasim Huleihel, Salman Salamatian, Muriel Médard:
Guessing with limited memory. 2253-2257 - Salman Salamatian, Ahmad Beirami, Asaf Cohen, Muriel Médard:
Centralized vs decentralized multi-agent guesswork. 2258-2262 - Shaofeng Zou, Georgios Fellouris, Venugopal V. Veeravalli:
Asymptotic optimality of D-CuSum for quickest change detection under transient dynamics. 2263-2267 - Gautam Dasarathy, Parikshit Shah, Richard G. Baraniuk:
Sketched covariance testing: A compression-statistics tradeoff. 2268-2272 - Amin Jalali, James Saunderson, Maryam Fazel, Babak Hassibi:
Error bounds for Bregman denoising and structured natural parameter estimation. 2273-2277 - Flavio Zabini, Gianni Pasolini, Andrea Conti:
On random sampling with nodes attraction: The case of Gauss-Poisson process. 2278-2282 - Amr Elnakeeb, Urbashi Mitra:
Low-rank, sparse and line constrained estimation: Applications to target tracking and convergence. 2283-2287 - Xiaoyi Leo Liu, Hamid Jafarkhani:
Two-user downlink non-orthogonal multiple access with limited feedback. 2288-2292 - I-Hsiang Wang, Shih-Chun Lin, Yu-Chih Huang:
Role of feedback in modulo-sum computation over erasure multiple-access channels. 2293-2297 - Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the necessity of structured codes for communications over MAC with feedback. 2298-2302 - Lan V. Truong, Vincent Y. F. Tan:
On the Gaussian MAC with stop-feedback. 2303-2307 - Joseph J. Boutros, Fanny Jardel, Cyril Measson:
Probabilistic shaping and non-binary codes. 2308-2312 - Anoosheh Heidarzadeh, Alex Sprintson:
Successive local and successive global omniscience. 2313-2317 - Shuangzhi Li, Jian-Kang Zhang, Xiaomin Mu:
Noncoherent massive space-time codes with PSK modulation for uplink network communications. 2318-2322 - Kaiming Shen, Wei Yu:
FPLinQ: A cooperative spectrum sharing strategy for device-to-device communications. 2323-2327 - Yazan H. Al-Badarneh, Costas N. Georghiades, Carlos E. Mejía:
On the effective rate of MISO/TAS systems in Rayleigh fading. 2328-2332 - Hengtao He, Chao-Kai Wen, Shi Jin:
Generalized expectation consistent signal recovery for nonlinear measurements. 2333-2337 - Andrea Montanari, Phan-Minh Nguyen:
Universality of the elastic net error. 2338-2342 - Nir Shlezinger, Ron Dabora, Yonina C. Eldar:
Using mutual information for designing the measurement matrix in phase retrieval problems. 2343-2347 - Adarsh Barik, Jean Honorio, Mohit Tawarmalani:
Information theoretic limits for linear prediction with graph-structured sparsity. 2348-2352 - Jayadev Acharya, Arnab Bhattacharyya, Pritish Kamath:
Improved bounds for universal one-bit compressive sensing. 2353-2357 - Sian-Jheng Lin, Amira Alloum, Tareq Y. Al-Naffouri:
Principal pivot transforms on radix-2 DFT-type matrices. 2358-2362 - Daniel L. Pimentel-Alarcón, Aritra Biswas, Claudia R. Solís-Lemus:
Adversarial principal component analysis. 2363-2367 - Holger Boche, Volker Pohl:
Characterization of the stability range of the Hilbert transform with applications to spectral factorization. 2368-2372 - Sung Sik Nam, Young-Chai Ko, Mohamed-Slim Alouini:
Mellin-transform-based new results of the joint statistics of partial products of ordered random variables. 2373-2377 - Afshin Abdi, Faramarz Fekri:
Optimal sensor selection in the presence of noise and interference. 2378-2382 - Qifu Tyler Sun, Hanqi Tang, Zongpeng Li, Xiaolong Yang, Keping Long:
Circular-shift linear network coding. 2383-2387 - Fariba Abbasi, Mayank Bakshi:
Coding for networks of compound channels. 2388-2392 - Hengjie Yang, Wangmei Guo:
Distributed decoding of convolutional network error correction codes. 2393-2397 - Haoyuan Pan, Lu Lu, Soung Chang Liew:
Multiuser rate-diverse network-coded multiple access. 2398-2402 - Sanghamitra Dutta, Viveck R. Cadambe, Pulkit Grover:
Coded convolution for parallel and distributed computing within a deadline. 2403-2407 - Amirhossein Reisizadeh, Saurav Prakash, Ramtin Pedarsani, Salman Avestimehr:
Coded computation over heterogeneous clusters. 2408-2412 - Kangwook Lee, Ramtin Pedarsani, Dimitris S. Papailiopoulos, Kannan Ramchandran:
Coded computation for multicore setups. 2413-2417 - Kangwook Lee, Changho Suh, Kannan Ramchandran:
High-dimensional coded matrix multiplication. 2418-2422 - Jad Hachem, Nikhil Karamchandani, Sharayu Moharir, Suhas N. Diggavi:
Coded caching with partial adaptive matching. 2423-2427 - Chien-Yi Wang, Shirin Saeedi Bidokhti, Michèle A. Wigger:
Improved converses and gap-results for coded caching. 2428-2432 - Ahmed A. Zewail, Aylin Yener:
Coded caching for combination networks with cache-aided relays. 2433-2437 - Hooshang Ghasemi, Aditya Ramamoorthy:
Asynchronous coded caching. 2438-2442 - Antonious M. Girgis, Özgür Erçetin, Mohammed Nafie, Tamer A. ElBatt:
Decentralized coded caching in wireless networks: Trade-off between storage and latency. 2443-2447 - Rajai Nasser:
A characterization of the Shannon ordering of communication channels. 2448-2452 - Rajai Nasser:
On the input-degradedness and input-equivalence between channels. 2453-2457 - Wei Mao, Suhas N. Diggavi, Sreeram Kannan:
Models and information-theoretic bounds for nanopore sequencing. 2458-2462 - Anuran Makur, Yury Polyanskiy:
Less noisy domination by symmetric channels. 2463-2467 - Nariman Farsad, Christopher Rose, Muriel Médard, Andrea Goldsmith:
Capacity of molecular channels with imperfect particle-intensity modulation and detection. 2468-2472 - Kwangjun Ahn, Kangwook Lee, Changho Suh:
Information-theoretic limits of subspace clustering. 2473-2477 - Cynthia Rush, Ramji Venkataramanan:
The error exponent of sparse regression codes with AMP decoding. 2478-2482 - Akira Yamawaki, Hiroshi Kamabe, Shan Lu:
Lower bounds on the number of write operations by index-less indexed flash code with inversion cells. 2483-2487 - Wei-Ning Chen, I-Hsiang Wang:
Partial data extraction via noisy histogram queries: Information theoretic bounds. 2488-2492 - Josep Font-Segura, Alfonso Martinez, Albert Guillen i Fabregas:
Asymptotics of the error probability in quasi-static binary symmetric channels. 2493-2497 - Vidya Muthukumar, Anant Sahai:
Commitment in regulatory spectrum games: Examining the first-player advantage. 2498-2502 - Feng Ji, Wenchang Tang, Wee Peng Tay, Edwin K. P. Change:
Inferring network topology from information cascades. 2503-2507 - Vasanthan Raghavan, Junil Choi, David J. Love:
Statistical beamforming for the large antenna broadcast channel. 2508-2512 - Hong Quy Le, Hussein Al-Shatri, Anja Klein:
Efficient resource allocation in mobile-edge computation offloading: Completion time minimization. 2513-2517 - Binnan Zhuang, Dongning Guo, Ermin Wei, Michael L. Honig:
Scalable spectrum allocation for large networks based on sparse optimization. 2518-2522 - Yury Polyanskiy:
A perspective on massive random-access. 2523-2527 - Or Ordentlich, Yury Polyanskiy:
Low complexity schemes for the random access Gaussian channel. 2528-2532 - Huifa Lin, Won-Yong Shin:
Multi-cell aware opportunistic random access. 2533-2537 - Olga Galinina, Andrey M. Turlikov, Sergey Andreev, Yevgeni Koucheryavy:
Multi-channel random access with replications. 2538-2542 - Mohammed Karmoose, Linqi Song, Martina Cardone, Christina Fragouli:
Private Broadcasting: An index coding approach. 2543-2547 - Yu-Chih Huang, Yi Hong, Emanuele Viterbo:
Golden-coded index coding. 2548-2552 - Anoop Thomas, B. Sundar Rajan:
Generalized index coding problem and discrete polymatroids. 2553-2557 - Linqi Song, Christina Fragouli, Tianchu Zhao:
A pliable index coding approach to data shuffling. 2558-2562 - Yeohee Im, Sergio Verdú:
Fixed-length-parsing universal compression with side information. 2563-2567 - Alon Kipnis, Stefano Rini, Andrea J. Goldsmith:
Coding theorems for the compress and estimate source coding problem. 2568-2572 - Matthew G. Reyes, David L. Neuhoff:
Row-centric lossless compression of Markov images. 2573-2577 - Ni Ding, Rodney A. Kennedy, Parastoo Sadeghi:
A practical approach for successive omniscience. 2578-2582 - Ahmed Hindy, Aria Nosratinia:
On the universality of lattice codes for a class of ergodic fading channels. 2583-2587 - Sorina Dumitrescu, Yifang Chen, Jun Chen:
Index mapping for bit-error resilient multiple description lattice vector quantizer. 2588-2592 - Perathorn Pooksombat, J. Harshan, Wittawat Kositwattanarerk:
On shaping complex lattice constellations from multi-level constructions. 2593-2597 - Min Qiu, Lei Yang, Yixuan Xie, Jinhong Yuan:
On the design of multi-dimensional irregular repeat-accumulate lattice codes. 2598-2602 - Dina Goldin, David Burshtein:
Performance bounds of concatenated polar coding schemes. 2603-2607 - Haewon Jeong, Christopher G. Blake, Pulkit Grover:
Energy-adaptive polar codes: Trading off reliability and decoder circuit energy. 2608-2612 - Ilya Dumer:
Polar codes with a stepped boundary. 2613-2617 - Sarit Buzaglo, Arman Fazeli, Paul H. Siegel, Veeresh Taranalli, Alexander Vardy:
Permuted successive cancellation decoding for polar codes. 2618-2622 - Yo-Seb Jeon, Namyoon Lee, Ravi Tandon:
On the degrees of freedom of wide-band multi-cell multiple access channels with No CSIT. 2623-2627 - Ori Shental, Benjamin M. Zaidel, Shlomo Shamai Shitz:
Low-density code-domain NOMA: Better be regular. 2628-2632 - Borzoo Rassouli, Morteza Varasteh, Deniz Gündüz:
Capacity region of a one-bit quantized Gaussian multiple access channel. 2633-2637 - Wenyi Zhang, Lingyan Huang:
On OR many-access channels. 2638-2642 - Tero Laihonen, Tuomo Lehtila:
Improved codes for list decoding in the Levenshtein's channel and information retrieval. 2643-2647 - Myna Vajha, Vinayak Ramkumar, R. Vijay Kumar:
Binary, shortened projective reed muller codes for coded private information retrieva. 2648-2652 - Sohrab Ferdowsi, Slava Voloshynovskiy, Dimche Kostadinov, Taras Holotyak:
Sparse ternary codes for similarity search have higher coding gain than dense binary codes. 2653-2657 - Simon R. Blackburn, Tuvi Etzion:
PIR array codes with optimal PIR rates. 2658-2662 - Charalambos D. Charalambous, Christos K. Kourtellaris, Sergey Loyka, Ioannis Tzortzis:
The capacity of unstable dynamical systems-interaction of control and information transmission. 2663-2667 - Yuta Sakai, Ken-ichi Iwata:
Optimal quantization of B-DMCs maximizing α-mutual information with monge property. 2668-2672 - Andre Wibisono, Varun S. Jog, Po-Ling Loh:
Information and estimation in Fokker-Planck channels. 2673-2677 - Todd P. Coleman:
Dynamical systems, ergodicity, and posterior matching. 2678-2682 - Hessam Mahdavifar, Alexander Vardy:
Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding. 2683-2687 - Yeow Meng Chee, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Hengjia Wei:
Permutation codes correcting a single burst deletion II: Stable deletions. 2688-2692 - Serge Kas Hanna, Salim El Rouayheb:
Guess & check codes for deletions and synchronization. 2693-2697 - Kayvon Mazooji:
On unique decoding from insertion errors. 2698-2702 - Amisha Jhanji, Hemanta K. Maji, Raphael Arkady Meyer:
Characterizing optimal security and round-complexity for secure OR evaluation. 2703-2707 - Mehrdad Tahmasbi, Matthieu R. Bloch, Aylin Yener:
Learning adversary's actions for secret communication. 2708-2712 - Mohammad Mahdi Mojahedian, Amin Gohari, Mohammad Reza Aref:
On the equivalency of reliability and security metrics for wireline networks. 2713-2717 - Olivier Blazy, Philippe Gaborit, Julien Schrek, Nicolas Sendrier:
A code-based blind signature. 2718-2722 - Holger Boche, Ezra Tampubolon:
Asymptotic analysis of tone reservation method for the PAPR reduction of CDMA systems. 2723-2727 - Sergey Foss, Andrey M. Turlikov, Maxim Grankin:
Spatial random multiple access with multiple departure. 2728-2731 - MohammadReza Ebrahimi, Farshad Lahouti, Victoria Kostina:
Coded random access design for constrained outage. 2732-2736 - Marat V. Burnashev, Hirosuke Yamamoto:
On optimal error exponents in noiseless channel identification. 2737-2740 - Hideki Yagi:
Channel resolvability theorems for general sources and channels. 2741-2745 - Minh Thanh Vu, Tobias J. Oechtering, Mikael Skoglund:
Hierarchical identification with pre-processing. 2746-2750 - Anelia Somekh-Baruch:
Mismatched identification via channels. 2751-2755 - Ron M. Roth:
On decoding rank-metric codes over large fields. 2756-2760 - Umberto Martínez-Peñas:
Universal secure rank-metric coding schemes with optimal communication overheads. 2761-2765 - Diego Napp, Raquel Pinto, Joachim Rosenthal, Paolo Vettori:
MRD rank metric convolutional codes. 2766-2770 - Joachim Rosenthal, Tovohery Randrianarisoa:
A decoding algorithm for twisted Gabidulin codes. 2771-2774 - Huang-Chang Lee, Jyun-Han Wu, Chung-Hsuan Wang, Yeong-Luh Ueng:
An iterative soft-decision decoding algorithm for Reed-Solomon codes. 2775-2779 - Ahmed El Alaoui, Aaditya Ramdas, Florent Krzakala, Lenka Zdeborová, Michael I. Jordan:
Decoding from pooled data: Phase transitions of message passing. 2780-2784 - Mohammad Mohammadi Amiri, Deniz Gündüz:
Decentralized caching and coded delivery over Gaussian broadcast channels. 2785-2789 - Li Tang, Aditya Ramamoorthy:
Low subpacketization schemes for coded caching. 2790-2794 - Enrico Piovano, Hamdi Joudeh, Bruno Clerckx:
On coded caching in the overloaded MISO broadcast channel. 2795-2799 - Xinping Yi, Giuseppe Caire:
Topological interference management with decoded message passing: A polyhedral approach. 2800-2804 - Uzi Pereg, Yossef Steinberg:
The arbitrarily varying channel under constraints with causal side information at the encoder. 2805-2809 - Arya Mazumdar, Andrew McGregor, Sofya Vorotnikova:
Storage capacity as an information-theoretic analogue of vertex cover. 2810-2814 - Wasim Huleihel, Salman Salamatian, Neri Merhav, Muriel Médard:
Gaussian ISI channels with mismatch. 2815-2819 - Holger Boche, Rafael F. Schaefer, H. Vincent Poor:
Characterization of super-additivity and discontinuity behavior of the capacity of arbitrarily varying channels under list decoding. 2820-2824 - Matthieu R. Bloch, Saikat Guha:
Optimal covert communications using pulse-position modulation. 2825-2829 - Si-Hyeon Lee, Ligong Wang, Ashish Khisti, Gregory W. Wornell:
Covert communication with noncausal channel-state information at the transmitter. 2830-2834 - Giulia Cervia, Laura Luzzi, Maël Le Treust, Matthieu R. Bloch:
Strong coordination of signals and actions over noisy channels. 2835-2839 - Sarah A. Obead, Badri N. Vellambi, Jörg Kliewer:
Strong coordination over noisy channels: Is separation sufficient? 2840-2844 - Neri Merhav:
Universal decoding using a noisy codebook. 2845-2849 - Junya Honda, Hirosuke Yamamoto:
Yariable-to-fixed length homophonie coding suitable for asymmetric channel coding. 2850-2854 - Himanshu Tyagi, Shun Watanabe:
Optimality of the recursive data exchange protocol. 2855-2859 - Yeow Meng Chee, Han Mao Kiah, Alexander Vardy, Eitan Yaakobi:
Explicit constructions of finite-length WOM codes. 2860-2864 - Kousha Kalantari, Lalitha Sankar, Oliver Kosut:
On information-theoretic privacy with general distortion cost functions. 2865-2869 - Mehmet Ozgun Demir, Gunes Karabulut-Kurt, Volker Lücken, Gerd Ascheid, Guido Dartmann:
Impact of the communication channel on information theoretical privacy. 2870-2874 - Muhammad R. A. Khandaker, Christos Masouros, Kai-Kit Wong:
Constructive interference based secure precoding. 2875-2879 - Rashad Eletreby, Osman Yagan:
Secure and reliable connectivity in heterogeneous wireless sensor networks. 2880-2884 - Songze Li, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Communication-aware computing for edge processing. 2885-2889 - Can Karakus, Yifan Sun, Suhas N. Diggavi:
Encoded distributed optimization. 2890-2894 - Milind Rao, Tara Javidi, Yonina C. Eldar, Andrea Goldsmith:
Fundamental estimation limits in autoregressive processes with compressive measurements. 2895-2899 - Rawad Bitar, Parimal Parag, Salim El Rouayheb:
Minimizing latency for secure distributed computing. 2900-2904 - Charles-Ugo Piat-Durozoi, Charly Poulliat, Nathalie Thomas, Marie-Laure Boucheret, Guy Lesthievent:
On sparse graph coding for coherent and noncoherent demodulation. 2905-2909 - Zhun Deng, Jie Ding, Kathryn Heal, Vahid Tarokh:
The number of independent sets in hexagonal graphs. 2910-2914 - Kabir Chandrasekher, Orhan Ocal, Kannan Ramchandran:
Density evolution on a class of smeared random graphs. 2915-2919 - Rashad Eletreby, Osman Yagan:
Connectivity of inhomogeneous random key graphs intersecting inhomogeneous Erdős-Rényi graphs. 2920-2924 - Jan Lewandowsky, Maximilian Stark, Gerhard Bauch:
Message alignment for discrete LDPC decoders with quadrature amplitude modulation. 2925-2929 - Heeyoul Kwak, Jaewha Kim, Jong-Seon No:
Rate-loss reduction of SC-LDPC codes by optimizing reliable variable nodes via expected graph evolution. 2930-2934 - Erixhen Sula, Jingge Zhu, Adriano Pastore, Sung Hoon Lim, Michael Gastpar:
Compute-forward multiple access (CFMA) with nested LDPC codes. 2935-2939 - David G. M. Mitchell, Eirik Rosnes:
Edge spreading design of high rate array-based SC-LDPC codes. 2940-2944 - Mohamad Khas, Hamid Saeedi, Reza Asvadi:
LDPC code design for correlated sources using EXIT charts. 2945-2949 - Mingyue Ji, Rong-Rong Chen, Giuseppe Caire, Andreas F. Molisch:
Fundamental limits of distributed caching in multihop D2D wireless networks. 2950-2954 - Jaber Kakar, Soheil Gherekhloo, Aydin Sezgin:
Fundamental limits on latency in transceiver cache-aided HetNets. 2955-2959 - Eleftherios Lampiris, Jingjing Zhang, Petros Elia:
Cache-aided cooperation with no CSIT. 2960-2964 - Igal Sason, Sergio Verdú:
Arimoto-Rényi conditional entropy and Bayesian hypothesis testing. 2965-2969 - Chengyu Wu, Easton Li Xu, Guangyue Han:
Rényi entropy rate of hidden Markov processes. 2970-2974 - Yuta Sakai, Ken-ichi Iwata:
Sharp bounds on Arimoto's conditional Rényi entropies between two distinct orders. 2975-2979 - Semih Yagli, Yucel Altug, Sergio Verdú:
Minimax Rényi redundancy. 2980-2984 - Peng Xu, James Melbourne, Mokshay M. Madiman:
Infinity-Rényi entropy power inequalities. 2985-2989 - Akshay Soni, Troy Chevalier, Swayambhoo Jain:
Noisy inductive matrix completion under sparse factor models. 2990-2994 - Yaniv Fogel, Meir Feder:
On the problem of on-line learning with log-loss. 2995-2999 - Pan Li, Olgica Milenkovic:
Multiclass MinMax rank aggregation. 3000-3004 - Hyeryung Jang, Hyungwon Choi, Yung Yi, Jinwoo Shin:
Adiabatic Persistent Contrastive Divergence learning. 3005-3009 - Yasin Yilmaz:
Online nonparametric anomaly detection based on geometric entropy minimization. 3010-3014 - Yue M. Lu, Gen Li:
Spectral initialization for nonconvex estimation: High-dimensional limit and phase transitions. 3015-3019 - Kevin Oshiro, Changlong Wu, Narayana P. Santhanam:
Jackknife estimation for Markov processes with no mixing constraints. 3020-3024 - Nikhilesh Rajaraman, Andrew Thangaraj, Ananda Theertha Suresh:
Minimax risk for missing mass estimation. 3025-3029 - Kevin R. Moon, Kumar Sricharan, Alfred O. Hero III:
Ensemble estimation of mutual information. 3030-3034 - Masahito Hayashi, Vincent Y. F. Tan:
Minimum rates of approximate sufficient statistics. 3035-3039 - Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen, Qi Chen, Pierre Moulin:
Information-theoretic characterizations of Markov random fields and subfields. 3040-3044 - Galen Reeves:
Conditional central limit theorems for Gaussian projections. 3045-3049 - Meik Dorpinghaus, Édgar Roldán, Izaak Neri, Heinrich Meyr, Frank Jülicher:
An information theoretic analysis of sequential decision-making. 3050-3054 - Yucheng Liu, Parastoo Sadeghi, Fatemeh Arbabjolfaei, Young-Han Kim:
On the capacity for distributed index coding. 3055-3059 - Min Li, Lawrence Ong, Sarah J. Johnson:
Improved bounds for multi-sender index coding. 3060-3064 - Vijaya Kumar Mareedu, Prasad Krishnan:
Uniprior index coding. 3065-3069 - V. Lalitha, Prasad Krishnan:
Rate 1/3 index coding: Forbidden and feasible configurations. 3070-3074 - Patrick Schulte, Bernhard C. Geiger:
Divergence scaling of fixed-length, binary-output, one-to-one distribution matching. 3075-3079 - Praveen Venkatesh, Pulkit Grover:
Lower bounds on the minimax risk for the source localization problem. 3080-3084 - Matthew Aldridge:
On the optimality of some group testing algorithms. 3085-3089 - Anusha Lalitha, Nancy Ronquillo, Tara Javidi:
Measurement dependent noisy search: The Gaussian case. 3090-3094 - Sourabh Banerjee, Georgios Fellouris:
Scalable multichannel joint sequential change detection and isolation. 3095-3099 - Hessam Mahdavifar:
A new approach for constructing and decoding maximum rank distance codes. 3100-3104 - Asaf Cohen, Alejandro Cohen, Muriel Médard, Omer Gurewitz:
Individually-secure multi-source multicast. 3105-3109 - Alex Karrila, Niko R. Väisänen, David A. Karpuk, Camilla Hollanti:
Lattice coding for Rician fading channels from Hadamard rotations. 3110-3114 - Maya Levy, Eitan Yaakobi:
Mutually uncorrelated codes for DNA storage. 3115-3119 - Siddharth Jain, Farzad Farnoud Hassanzadeh, Moshe Schwartz, Jehoshua Bruck:
Noise and uncertainty in string-duplication systems. 3120-3124 - Netanel Raviv, Moshe Schwartz, Eitan Yaakobi:
Rank modulation codes for DNA storage. 3125-3129 - Reinhard Heckel, Ilan Shomorony, Kannan Ramchandran, David N. C. Tse:
Fundamental limits of DNA storage systems. 3130-3134 - Wenwen Zhao, Lifeng Lai:
Distributed identity testing with zero-rate compression. 3135-3139 - Sergey Tridenski, Ram Zamir:
Exponential source/channel duality. 3140-3144 - Lóránt Farkas, Tamás Kói, Imre Csiszár:
Error exponents for sparse communication. 3145-3149 - Lóránt Farkas, Tamás Kói:
Universal random access error exponents for codebooks with different word-lengths. 3150-3154 - Balaji Srinivasan Babu, P. Vijay Kumar:
Bounds on the rate and minimum distance of codes with availability. 3155-3159 - Castor Aranda, Marcel Fernandez:
Improved existence bounds on IPP codes using the Clique Lovász Local Lemma. 3160-3164 - Yu Tsunoda, Yuichiro Fujiwara:
Explicit bounds on the length of optimal X-codes. 3165-3169 - Varun S. Jog:
A convolution inequality for entropy over Z2. 3170-3174 - Rajai Nasser:
Topological structures on DMC spaces. 3175-3179 - Ligong Wang:
A strong data processing inequality for thinning poisson processes and some applications. 3180-3184 - Rajai Nasser:
Continuity of channel parameters and operations under various DMC topologies. 3185-3189 - Vahid Jamali, Arman Ahmadzadeh, Nariman Farsad, Robert Schober:
SCW codes for optimal CSI-free detection in diffusive molecular communications. 3190-3194 - Raban Iten, Joseph M. Renes, David Sutter:
Pretty good measures in quantum information theory. 3195-3199 - Ching-Yi Lai, Alexei E. Ashikhmin:
Linear programming bounds for entanglement-assisted quantum codes. 3200-3204 - Michael X. Cao, Pascal O. Vontobel:
Estimating the information rate of a channel with classical input and output and a quantum state. 3205-3209 - Boulat A. Bash, Christos N. Gagatsos, Animesh Datta, Saikat Guha:
Fundamental limits of quantum-secure covert optical sensing. 3210-3214 - Pierre Moulin:
Source coding with distortion profile constraints. 3215-3219 - Pierre Moulin:
Lower bounds on rate of fixed-length source codes under average- and 6-fidelity constraints. 3220-3224 - Elyas Sabeti, Anders Høst-Madsen:
Enhanced MDL with application to atypicality. 3225-3229 - Maxim Goukhshtein, Petros T. Boufounos, Toshiaki Koike-Akino, Stark C. Draper:
Distributed coding of multispectral images. 3230-3234
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 2026-01-29 02:19 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:
