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