Abstract is missing.
- Almost lossless variable-length source coding on countably infinite alphabetsJorge F. Silva, Pablo Piantanida. 1-5 [doi]
- Tight upper bounds on the redundancy of optimal binary AIFV codesWeihua Hu, Hirosuke Yamamoto, Junya Honda. 6-10 [doi]
- On the stationary distribution of Asymmetric Binary SystemsHidetoshi Yokoo. 11-15 [doi]
- A survey of Bratteli information source theoryJohn C. Kieffer. 16-20 [doi]
- Data driven quickest change detection: An algorithmic complexity approachHusheng Li. 21-25 [doi]
- Sequentially detecting transitory changesGeorge V. Moustakides, Venugopal V. Veeravalli. 26-30 [doi]
- Non-bayesian multiple change-point detection controlling false discovery rateJie Chen, Wenyi Zhang, H. Vincent Poor. 31-35 [doi]
- Decentralized sequential change detection with ordered CUSUMsSourabh Banerjee, Georgios Fellouris. 36-40 [doi]
- Capacity-achieving rate-compatible polar codesSong-Nam Hong, Dennis Hui, Ivana Maric. 41-45 [doi]
- Capacity-achieving rateless polar codesBin Li, David Tse, Kai Chen, Hui Shen. 46-50 [doi]
- Construction of polar codes for arbitrary discrete memoryless channelsTalha Cihad Gulcu, Min Ye, Alexander Barg. 51-55 [doi]
- Channel polarization and Blackwell measuresMaxim Raginsky. 56-60 [doi]
- Constructions of high-rate minimum storage regenerating codes over small fieldsNetanel Raviv, Natalia Silberstein, Tuvi Etzion. 61-65 [doi]
- An outer bound on the storage-bandwidth tradeoff of exact-repair cooperative regenerating codesHyuk Lee, Jungwoo Lee. 66-70 [doi]
- On MBR codes with replicationMuralee Nikhil Krishnan, P. Vijay Kumar. 71-75 [doi]
- Minimum storage regenerating codes for all parametersArman Fazeli, Sreechakra Goparaju, Alexander Vardy. 76-80 [doi]
- Optimal sample complexity for stable matrix recoveryYanjun Li, Kiryung Lee, Yoram Bresler. 81-85 [doi]
- Simple algorithms and guarantees for low rank matrix completion over F2James Saunderson, Maryam Fazel, Babak Hassibi. 86-90 [doi]
- Similarity clustering in the presence of outliers: Exact recovery via convex programRamya Korlakai Vinayak, Babak Hassibi. 91-95 [doi]
- A converse to low-rank matrix completionDaniel L. Pimentel-Alarcón, Robert D. Nowak. 96-100 [doi]
- New ternary binomial bent functionsTor Helleseth, Alexander Kholosha. 101-104 [doi]
- Correlation properties of sequences from the 2-D array structure of Sidelnikov sequences of different lengths and their unionMin Kyu Song, Hong-Yeop Song, Dae San Kim, Jang Yong Lee. 105-109 [doi]
- On constructions of bent functions from involutionsSihem Mesnager. 110-114 [doi]
- Perfect Gaussian integer sequences from cyclic difference setsXinjiao Chen, Chunlei Li, Chunming Rong. 115-119 [doi]
- A polynomial-time algorithm for pliable index codingLinqi Song, Christina Fragouli. 120-124 [doi]
- Optimal vector linear index codes for some symmetric side information problemsMahesh Babu Vaddi, B. Sundar Rajan. 125-129 [doi]
- A class of index coding problems with rate 1/3Prasad Krishnan, V. Lalitha. 130-134 [doi]
- On caching with more users than filesKai Wan, Daniela Tuninetti, Pablo Piantanida. 135-139 [doi]
- Coding for lossy function computation: Analyzing sequential function computation with distortion accumulationYaoqing Yang, Pulkit Grover, Soummya Kar. 140-144 [doi]
- Structural results for two-user interactive communicationJhelum Chakravorty, Aditya Mahajan. 145-149 [doi]
- Two-way lossy compression via a relay with self sourceEbrahim MolavianJazi, Aylin Yener. 150-154 [doi]
- Integer-forcing source coding: Successive cancellation and source-channel dualityWenbo He, Bobak Nazer. 155-159 [doi]
- Single-user CSIT can be quite useful for state-dependent broadcast channelsShih-Chun Lin, I-Hsiang Wang. 160-164 [doi]
- Bit-additive superposition coding for the bandwidth limited broadcast channelAhmed Attia Abotabl, Aria Nosratinia. 165-169 [doi]
- A proof of the strong converse theorem for Gaussian broadcast channels via the Gaussian Poincaré inequalitySilas L. Fong, Vincent Y. F. Tan. 170-174 [doi]
- A unified inner bound for the two-receiver memoryless broadcast channel with channel state and message side informationBehzad Asadi, Lawrence Ong, Sarah J. Johnson. 175-179 [doi]
- On the performance of mismatched data detection in large MIMO systemsCharles Jeon, Arian Maleki, Christoph Studer. 180-184 [doi]
- Asymptotic mutual information for the binary stochastic block modelYash Deshpande, Emmanuel Abbe, Andrea Montanari. 185-189 [doi]
- Expectation consistent approximate inference: Generalizations and convergenceAlyson K. Fletcher, Mojtaba Sahraee-Ardakan, Sundeep Rangan, Philip Schniter. 190-194 [doi]
- Minimum pearson distance detection in the presence of unknown slowly varying offsetVitaly Skachek, Kees A. Schouhamer Immink. 195-199 [doi]
- Rates of constant-composition codes that mitigate intercell interferenceYeow Meng Chee, Johan Chrisnata, Han Mao Kiah, San Ling, Thanh Thanh Nguyen, Van Khu Vu. 200-204 [doi]
- Efficient encoding/decoding of capacity-achieving constant-composition ICI-free codesYeow Meng Chee, Johan Chrisnata, Han Mao Kiah, San Ling, Thanh Thanh Nguyen, Van Khu Vu. 205-209 [doi]
- Generalized belief propagation based TDMR detector and decoderChaitanya Kumar Matcha, Mohsen Bahrami, Shounak Roy, Shayan Garani Srinivasa, Bane Vasic. 210-214 [doi]
- Near-optimal finite-length scaling for polar codes over large alphabetsHenry D. Pfister, Rüdiger L. Urbanke. 215-219 [doi]
- A partial order for the synthesized channels of a polar codeChristian Schurch. 220-224 [doi]
- Polar coding for processes with memoryEren Sasoglu, Ido Tal. 225-229 [doi]
- Algebraic properties of polar codes from a new polynomial formalismMagali Bardet, Vlad Dragoi, Ayoub Otmani, Jean-Pierre Tillich. 230-234 [doi]
- Bandwidth adaptive & error resilient regenerating codes with minimum repair bandwidthKaveh Mahdaviani, Ashish Khisti, Soheil Mohajer. 235-239 [doi]
- On storage allocation for maximum service rate in distributed storage systemsMoslem Noori, Emina Soljanin, Masoud Ardakani. 240-244 [doi]
- Double Regenerating Codes for hierarchical data centersYuchong Hu, Patrick P. C. Lee, Xiaoyang Zhang. 245-249 [doi]
- Placement and read algorithms for high throughput in coded network switchesRami Cohen, Yuval Cassuto. 250-254 [doi]
- The Boltzmann sequence-structure channelAbram Magner, Daisuke Kihara, Wojciech Szpankowski. 255-259 [doi]
- On the duplication distance of binary stringsNoga Alon, Jehoshua Bruck, Farzad Farnoud, Siddharth Jain. 260-264 [doi]
- Sequence assembly from corrupted shotgun readsShirshendu Ganguly, Elchanan Mossel, Miklós Z. Rácz. 265-269 [doi]
- The capacity of some Pólya string modelsOhad Elishco, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck. 270-274 [doi]
- Broadcast channel under unequal coherence intervalsMohamed Fadel, Aria Nosratinia. 275-279 [doi]
- Optimizing the spatial content caching distribution for device-to-device communicationsDerya Malak, Mazin Al-Shalash, Jeffrey G. Andrews. 280-284 [doi]
- Edge caching for coverage and capacity-aided heterogeneous networksEjder Bastug, Mehdi Bennis, Marios Kountouris, Mérouane Debbah. 285-289 [doi]
- To feedback or not to feedbackChangho Suh, David Tse, Jaewoong Cho. 290-294 [doi]
- On the capacity of the chemical channel with feedbackJui Wu, Achilleas Anastasopoulos. 295-299 [doi]
- Sequential Necessary and Sufficient Conditions for optimal channel input distributions of channels with memory and feedbackPhotios A. Stavrou, Charalambos D. Charalambous, Christos K. Kourtellaris. 300-304 [doi]
- Analysis on LT codes for unequal recovery time with complete and partial feedbackRana Abbas, Mahyar Shirvanimoghaddam, Yonghui Li, Branka Vucetic. 305-309 [doi]
- A single-letter upper bound on the feedback capacity of unifilar finite-state channelsOron Sabag, Haim H. Permuter, Henry D. Pfister. 310-314 [doi]
- Joint optimization of cloud and edge processing for fog radio access networksSeok-Hwan Park, Osvaldo Simeone, Shlomo Shamai. 315-319 [doi]
- Sum capacity of massive MIMO systems with quantized hybrid beamformingAn Liu, Vincent K. N. Lau. 320-324 [doi]
- The capacity of Gaussian MISO channels under total and per-antenna power constraintsSergey Loyka. 325-329 [doi]
- SNR gap between MIMO linear receivers: Characterization and applicationsGiuseppa Alfano, Carla-Fabiana Chiasserini, Alessandro Nordio. 330-334 [doi]
- Sharper upper bounds for unbalanced Uniquely Decodable Code PairsPer Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof. 335-339 [doi]
- The unbounded benefit of encoder cooperation for the k-user MACParham Noorzad, Michelle Effros, Michael Langberg. 340-344 [doi]
- On the design of universal schemes for massive uncoordinated multiple accessAustin Taghavi, Avinash Vem, Jean-François Chamberland, Krishna R. Narayanan. 345-349 [doi]
- Uncoordinated multiple access schemes for visible light communications and positioningSiu-Wai Ho, Chi Wan Sung. 350-354 [doi]
- On the continuous-time Poisson channel with varying dark current known to the transmitterLigong Wang. 355-359 [doi]
- The stochastic-calculus approach to multi-receiver poisson channelsNirmal V. Shende, Aaron B. Wagner. 360-364 [doi]
- An achievable rate region for superposed timing channelsGuido Carlo Ferrante, Tony Q. S. Quek, Moe Z. Win. 365-369 [doi]
- Timing capacity of queues with random arrival and modified service timesGuido Carlo Ferrante, Tony Q. S. Quek, Moe Z. Win. 370-374 [doi]
- On the sum-rate capacity of non-symmetric Poisson multiple access channelAin Ul Aisha, Yingbin Liang, Lifeng Lai, Shlomo Shamai. 375-379 [doi]
- Encoding and decoding of balanced q-ary sequences using a Gray code prefixElie N. Mambou, Theo G. Swart. 380-384 [doi]
- Simple systematic Pearson codingJos H. Weber, Theo G. Swart, Kees A. Schouhamer Immink. 385-389 [doi]
- Balanced permutation codesRyan Gabrys, Olgica Milenkovic. 390-394 [doi]
- Encoding semiconstrained systemsOhad Elishco, Tom Meyerovitch, Moshe Schwartz. 395-399 [doi]
- Bounds on asymptotic rate of capacitive crosstalk avoidance codes for on-chip busesTadashi Wadayama, Taisuke Izumi. 400-404 [doi]
- Centralized coded caching for heterogeneous lossy requestsQianqian Yang, Deniz Gündüz. 405-409 [doi]
- Simplifying wireless social cachingMohammed Karmoose, Martina Cardone, Christina Fragouli. 410-414 [doi]
- A layered caching architecture for the interference channelJad Hachem, Urs Niesen, Suhas N. Diggavi. 415-419 [doi]
- Coded caching for networks with the resolvability propertyLi Tang, Aditya Ramamoorthy. 420-424 [doi]
- Fundamental limits of secretive coded cachingVaishakh Ravindrakumar, Parthasarathi Panda, Nikhil Karamchandani, Vinod M. Prabhakaran. 425-429 [doi]
- Optimal systematic distributed storage codes with fast encodingPreetum Nakkiran, K. V. Rashmi, Kannan Ramchandran. 430-434 [doi]
- Codes with unequal localitySwanand Kadhe, Alex Sprintson. 435-439 [doi]
- Some results on optimal locally repairable codesJie Hao, Shu-Tao Xia, Bin Chen. 440-444 [doi]
- Two classes of (r, t)-locally repairable codesAnyu Wang, Zhifang Zhang, Dongdai Lin. 445-449 [doi]
- Coding for locality in reconstructing permutationsNetanel Raviv, Eitan Yaakobi, Muriel Médard. 450-454 [doi]
- A non-asymptotic achievable rate for the AWGN energy-harvesting channel using save-and-transmitSilas L. Fong, Vincent Y. F. Tan, Jing Yang. 455-459 [doi]
- Performance bounds for remote estimation with an energy harvesting sensorAyça Özçelikkale, Tomas McKelvey, Mats Viberg. 460-464 [doi]
- Finite blocklength achievable rates for energy harvesting AWGN channels with infinite bufferKonchady Gautam Shenoy, Vinod Sharma. 465-469 [doi]
- Optimizing energy efficiency over energy-harvesting LTE cellular networksHajar Mahdavi-Doost, Narayan Prasad, Sampath Rangarajan. 470-474 [doi]
- Optimal energy management for energy harvesting transmitters under battery usage constraintXianwen Wu, Jing Yang, Jingxian Wu. 475-479 [doi]
- On the (non-)existence of APN (n, n)-functions of algebraic degree nLilya Budaghyan, Claude Carlet, Tor Helleseth, Nian Li. 480-484 [doi]
- New results about Tu-Deng's conjectureSoukayna Qarboua, Julien Schrek, Caroline Fontaine. 485-489 [doi]
- On vectorial bent functions with Dillon-type exponentsLucien Lapierre, Petr Lisonek. 490-494 [doi]
- On the optimal boolean function for prediction under quadratic lossNir Weinberger, Ofer Shayevitz. 495-499 [doi]
- An improved upper bound for the most informative boolean function conjectureOr Ordentlich, Ofer Shayevitz, Omri Weinstein. 500-504 [doi]
- Strong secrecy capacity of the wiretap channel II with DMC main channelDan He, Yuan Luo, Ning Cai. 505-509 [doi]
- Secret key generation over noisy channels with common randomnessGermán Bassi, Pablo Piantanida, Shlomo Shamai. 510-514 [doi]
- A lattice coding scheme for secret key generation from Gaussian Markov tree sourcesShashank Vatedka, Navin Kashyap. 515-519 [doi]
- Maximal leakage minimization for the Shannon cipher systemIbrahim Issa, Sudeep Kamath, Aaron B. Wagner. 520-524 [doi]
- Information theoretic caching: The multi-user caseSung-Hoon Lim, Chien-Yi Wang, Michael Gastpar. 525-529 [doi]
- Lossy compression with near-uniform encoder outputsBadri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch. 530-534 [doi]
- An LP lower bound for rate distortion with variable side informationSinem Unal, Aaron B. Wagner. 535-539 [doi]
- Multiterminal compress-and-estimate source codingAlon Kipnis, Stefano Rini, Andrea J. Goldsmith. 540-544 [doi]
- Guiding blind transmitters for K-user MISO interference relay channels with Imperfect channel knowledgeWonjae Shin, Namyoon Lee, Jungwoo Lee, H. Vincent Poor. 545-549 [doi]
- Topological interference management with decoded message passingXinping Yi, Giuseppe Caire. 550-554 [doi]
- Topological interference management with reconfigurable antennasHeecheol Yang, Navid Naderializadeh, Amir Salman Avestimehr, Jungwoo Lee. 555-559 [doi]
- Blind interference alignment for private information retrievalHua Sun, Syed Ali Jafar. 560-564 [doi]
- Distributed simulation of continuous random variablesCheuk Ting Li, Abbas El Gamal. 565-569 [doi]
- Evaluating hypercontractivity parameters using information measuresChandra Nair, Nan-Nan Wang. 570-574 [doi]
- Information decomposition on structured spaceMahito Sugiyama, Hiroyuki Nakahara, Koji Tsuda. 575-579 [doi]
- Chained Kullback-Leibler divergencesDmitri S. Pavlichin, Tsachy Weissman. 580-584 [doi]
- Operational interpretation of Rényi conditional mutual information via composite hypothesis testing against Markov distributionsMarco Tomamichel, Masahito Hayashi. 585-589 [doi]
- Lower bounds on joint modulation-estimation performance for the Gaussian MACAyse Ünsal, Raymond Knopp, Neri Merhav. 590-594 [doi]
- Adaptive protocols for interactive communicationShweta Agrawal, Ran Gelles, Amit Sahai. 595-599 [doi]
- Caching-aided multicast for partial informationTetsunao Matsuta, Tomohiko Uyematsu. 600-604 [doi]
- Achievable rates of soliton communication systemsQun Zhang, Terence H. Chan. 605-609 [doi]
- On the soliton spectral efficiency in non-linear optical fibersPavlos Kazakopoulos, Aris L. Moustakas. 610-614 [doi]
- Exact sequence reconstruction for insertion-correcting codesFrederic Sala, Ryan Gabrys, Clayton Schoeny, Kayvon Mazooji, Lara Dolecek. 615-619 [doi]
- Efficiently decodable insertion/deletion codes for high-noise and high-rate regimesVenkatesan Guruswami, Ray Li. 620-624 [doi]
- On ordered syndromes for multi insertion/deletion error-correcting codesManabu Hagiwara. 625-629 [doi]
- Codes correcting a burst of deletions or insertionsClayton Schoeny, Antonia Wachter-Zeh, Ryan Gabrys, Eitan Yaakobi. 630-634 [doi]
- Coding of insertion-deletion-substitution channels without markersRyohei Goto, Kenta Kasai, Haruhiko Kaneko. 635-639 [doi]
- Bounds and constructions of codes with multiple localitiesAlexander Zeh, Eitan Yaakobi. 640-644 [doi]
- Recursive bounds for locally repairable codes with multiple repair groupsJie Hao, Shu-Tao Xia, Bin Chen. 645-649 [doi]
- A connection between locally repairable codes and exact regenerating codesToni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti. 650-654 [doi]
- Binary codes with locality for multiple erasures having short block lengthS. B. Balaji, K. P. Prasanth, P. Vijay Kumar. 655-659 [doi]
- Consecutive switch codesSarit Buzaglo, Eitan Yaakobi, Yuval Cassuto, Paul H. Siegel. 660-664 [doi]
- The replica-symmetric prediction for compressed sensing with Gaussian matrices is exactGalen Reeves, Henry D. Pfister. 665-669 [doi]
- On the design of linear projections for compressive sensing with side informationMeng-Yang Chen, Francesco Renna, Miguel R. D. Rodrigues. 670-674 [doi]
- Phase transition and noise sensitivity of ℓp-minimization for 0 ≤ p ≤ 1Haolei Weng, Le Zheng, Arian Maleki, Xiaodong Wang. 675-679 [doi]
- Performance trade-offs in multi-processor approximate message passingJunan Zhu, Ahmad Beirami, Dror Baron. 680-684 [doi]
- Estimation of entropy rate and Rényi entropy rate for Markov chainsSudeep Kamath, Sergio Verdú. 685-689 [doi]
- Novel lower bounds on the entropy rate of binary hidden Markov processesOr Ordentlich. 690-694 [doi]
- On the entropy and mutual information of point processesFrançois Baccelli, Jae Oh Woo. 695-699 [doi]
- Highly sensitive universal statistical testHirosuke Yamamoto, Qiqiang Liu. 700-704 [doi]
- Thinning, photonic beamsplitting, and a general discrete Entropy power InequalitySaikat Guha, Jeffrey H. Shapiro, Raul Garcia-Patron Sanchez. 705-709 [doi]
- On layered erasure interference channels without CSI at transmittersYan Zhu 0001, Cong Shen. 710-714 [doi]
- Approximately achieving the feedback interference channel capacity with point-to-point codesJoyson Sebastian, Can Karakus, Suhas N. Diggavi. 715-719 [doi]
- On the two-user MISO interference channel with single user decoding and partial CSITYair Noam, Naama Kimelfeld, Benjamin M. Zaidel. 720-724 [doi]
- Quasi Linear Codes: Application to point-to-point and multi-terminal source codingFarhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan. 730-734 [doi]
- A general rate-distortion converse bound for entropy-constrained scalar quantizationTobias Koch, Gonzalo Vazquez-Vilar. 735-739 [doi]
- Information rates of sampled Wiener processesAlon Kipnis, Yonina C. Eldar, Andrea J. Goldsmith. 740-744 [doi]
- On the smooth Rényi entropy and variable-length source coding allowing errorsShigeaki Kuzuoka. 745-749 [doi]
- Minimax estimation of the L1 distanceJiantao Jiao, Yanjun Han, Tsachy Weissman. 750-754 [doi]
- Finite-sample analysis of Approximate Message PassingCynthia Rush, Ramji Venkataramanan. 755-759 [doi]
- Strengthened monotonicity of relative entropy via pinched Petz recovery mapDavid Sutter, Marco Tomamichel, Aram Wettroth Harrow. 760-764 [doi]
- A large deviations approach to secure lossy compressionNir Weinberger, Neri Merhav. 765-769 [doi]
- Effects of the approximations from BP to AMP for small-sized problemsArise Kuriya, Toshiyuki Tanaka. 770-774 [doi]
- EXIT analysis for belief propagation in degree-correlated stochastic block modelsHussein Saad, Ahmed Attia Abotabl, Aria Nosratinia. 775-779 [doi]
- Clustering from sparse pairwise measurementsAlaa Saade, Marc Lelarge, Florent Krzakala, Lenka Zdeborová. 780-784 [doi]
- Low-complexity stochastic Generalized Belief PropagationFarzin Haddadpour, Mahdi Jafari Siavoshani, Morteza Noshad. 785-789 [doi]
- New perspectives on weak Oblivious TransferUeli Maurer, Joao Ribeiro. 790-794 [doi]
- Soft McEliece: MDPC code-based McEliece cryptosystems with very compact keys through real-valued intentional errorsMarco Baldi, Paolo Santini, Franco Chiaraluce. 795-799 [doi]
- An encryption scheme based on Random Split of St-Gen codesSimona Samardjiska, Danilo Gligoroski. 800-804 [doi]
- Inter-class vs. mutual information as side-channel distinguishersOlivier Rioul, Annelie Heuser, Sylvain Guilley, Jean-Luc Danger. 805-809 [doi]
- Energy complexity of polar codesChristopher G. Blake, Frank R. Kschischang. 810-814 [doi]
- Simplified Successive-Cancellation List decoding of polar codesSeyyed Ali Hashemi, Carlo Condo, Warren J. Gross. 815-819 [doi]
- Erasure schemes using generalized polar codes: Zero-undetected-error capacity and performance trade-offsRajai Nasser. 820-824 [doi]
- Symmetry, demand types and outer bounds in caching systemsChao Tian. 825-829 [doi]
- Caching and delivery via interference eliminationChao Tian, Jun Chen. 830-834 [doi]
- Content delivery in erasure broadcast channels with cache and feedbackAsma Ghorbel, Mari Kobayashi, Sheng Yang. 835-839 [doi]
- Crossing the KS threshold in the stochastic block model with information theoryEmmanuel Abbe, Colin Sandon. 840-844 [doi]
- Cluster-seeking shrinkage estimatorsK. Pavan Srinath, Ramji Venkataramanan. 845-849 [doi]
- On deterministic conditions for subspace clustering under missing dataWenqi Wang, Shuchin Aeron, Vaneet Aggarwal. 850-854 [doi]
- An unconventional clustering problem: User Service Profile OptimizationFabio D'Andreagiovanni, Giuseppe Caire. 855-859 [doi]
- Two-stage compressed sensing for millimeter wave channel estimationYonghee Han, Jungwoo Lee. 860-864 [doi]
- Ginibre sampling and signal reconstructionFlavio Zabini, Andrea Conti. 865-869 [doi]
- Statistical group sparse beamforming for green Cloud-RAN via large system analysisYuanming Shi, Jun Zhang, Khaled Ben Letaief. 870-874 [doi]
- Efficient optimal joint channel estimation and data detection for massive MIMO systemsHaider Ali Jasim Alshamary, Weiyu Xu. 875-879 [doi]
- A bit of delay is sufficient and stochastic encoding is necessary to overcome online adversarial erasuresBikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate. 880-884 [doi]
- On the capacity of the dirty paper channel with fast fading and discrete channel statesStefano Rini, Shlomo Shamai. 885-889 [doi]
- When is noisy state information at the encoder as useless as no information or as good as noise-free state?Rui Xu, Jun Chen, Tsachy Weissman, Jian-Kang Zhang. 890-894 [doi]
- Empirical coordination, state masking and state amplification: Core of the decoder's knowledgeMaël Le Treust, Matthieu Bloch. 895-899 [doi]
- Capacity and degree-of-freedom of OFDM channels with amplitude constraintSaeid Haghighatshoar, Peter Jung, Giuseppe Caire. 900-904 [doi]
- Algorithmic aspects of optimal channel codingSiddharth Barman, Omar Fawzi. 905-909 [doi]
- Algebraic lattice codes achieve the capacity of the compound block-fading channelAntonio Campello, Cong Ling, Jean-Claude Belfiore. 910-914 [doi]
- The capacity of online (causal) q-ary error-erasure channelsZitan Chen, Sidharth Jaggi, Michael Langberg. 915-919 [doi]
- On (partial) unit memory codes based on Reed-Solomon codes for streamingMargreta Kuijper, Martin Bossert. 920-924 [doi]
- On deep holes of projective Reed-Solomon codesJun Zhang, Daqing Wan. 925-929 [doi]
- Using Reed-Solomon codes in the (U | U + V ) construction and an application to cryptographyIrene Marquez Corbella, Jean-Pierre Tillich. 930-934 [doi]
- Balanced Reed-Solomon codesWael Halbawi, Zihan Liu, Babak Hassibi. 935-939 [doi]
- d-imbalance WOM codes for reduced inter-cell interference in multi-level NVMsEvyatar Hemo, Yuval Cassuto. 940-944 [doi]
- On the capacity of non-binary write-once memoryMichal Horovitz, Eitan Yaakobi. 945-949 [doi]
- Write sneak-path constraints avoiding disturbs in memristor crossbar arraysYuval Cassuto, Shahar Kvatinsky, Eitan Yaakobi. 950-954 [doi]
- Performance of flash memories with different binary labelings: A multi-user perspectivePengfei Huang, Paul H. Siegel, Eitan Yaakobi. 955-959 [doi]
- Minimax structured normal means inferenceAkshay Krishnamurthy. 960-964 [doi]
- Minimax lower bounds for linear independence testingAaditya Ramdas, David Isenberg, Aarti Singh, Larry A. Wasserman. 965-969 [doi]
- Chernoff information of bottleneck Gaussian treesBinglin Li, Shuangqing Wei, Yue Wang 0007, Jian Yuan. 970-974 [doi]
- The rates of convergence of neural network estimates of hierarchical interaction regression modelsMichael Kohler, Adam Krzyzak. 975-977 [doi]
- Polar codes and polar lattices for independent fading channelsLing Liu, Cong Ling. 978-982 [doi]
- Polar coding for the multiple access wiretap channel via rate-splitting and cooperative jammingRemi A. Chou, Aylin Yener. 983-987 [doi]
- Polar coded non-orthogonal multiple accessJincheng Dai, Kai Niu, Zhongwei Si, Jiaru Lin. 988-992 [doi]
- Polar codes for broadcast channels with receiver message side information and noncausal state available at the encoderJin Sima, Wei Chen. 993-997 [doi]
- Design of membership matrices for (r, t)-availability in distributed storageYi-Sheng Su. 998-1002 [doi]
- Centralized repair of multiple node failuresAnkit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath. 1003-1007 [doi]
- Combinatorial and LP bounds for LRC codesSihuang Hu, Itzhak Tamo, Alexander Barg. 1008-1012 [doi]
- Reliability-bandwidth tradeoffs for distributed storage allocationsSiddhartha Brahma, Hugues Mercier. 1013-1017 [doi]
- Overlap-based genome assembly from variable-length readsJoseph Hui, Ilan Shomorony, Kannan Ramchandran, Thomas A. Courtade. 1018-1022 [doi]
- On the capacity of diffusion-based molecular timing channelsNariman Farsad, Yonathan Murin, Andrew W. Eckford, Andrea J. Goldsmith. 1023-1027 [doi]
- Duplication-correcting codes for data storage in the DNA of living organismsSiddharth Jain, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck. 1028-1032 [doi]
- Distribution of first arrival position in molecular communicationYen-Chi Lee, Chiun-Chuan Chen, Ping-Cheng Yeh, Chia-han Lee. 1033-1037 [doi]
- Equivalent characterization of reverse Brascamp-Lieb-type inequalities using information measuresSalman Beigi, Chandra Nair. 1038-1042 [doi]
- Smoothing Brascamp-Lieb inequalities and strong converses for common randomness generationJingbo Liu, Thomas A. Courtade, Paul W. Cuff, Sergio Verdú. 1043-1047 [doi]
- Brascamp-Lieb inequality and its reverse: An information theoretic viewJingbo Liu, Thomas A. Courtade, Paul W. Cuff, Sergio Verdú. 1048-1052 [doi]
- On additive-combinatorial affine inequalities for Shannon entropy and differential entropyAshok Vardhan Makkuva, Yihong Wu. 1053-1057 [doi]
- The capacity of discrete-time Gaussian MIMO channels with periodic characteristicsNir Shlezinger, Ron Dabora. 1058-1062 [doi]
- Universal outage behavior of randomly precoded integer forcing Over MIMO channelsElad Domanovitz, Uri Erez. 1063-1067 [doi]
- Dispersion of the coherent MIMO block-fading channelAustin Collins, Yury Polyanskiy. 1068-1072 [doi]
- On the symmetries and the capacity achieving input covariance matrices of multiantenna channelsMario Diaz. 1073-1077 [doi]
- Privacy-constrained remote source codingKittipong Kittichokechai, Giuseppe Caire. 1078-1082 [doi]
- Distributed information-theoretic biclusteringGeorg Pichler, Pablo Piantanida, Gerald Matz. 1083-1087 [doi]
- Practical interactive scheme for extremum computation in distributed networksSolmaz Torabi, Jie Ren, John MacLaren Walsh. 1088-1092 [doi]
- Universal decoding for source-channel coding with side informationNeri Merhav. 1093-1097 [doi]
- Generalized integrated interleaving BCH codesYingquan Wu. 1098-1102 [doi]
- Long cyclic codes over GF(4) and GF(8) better than BCH codes in the high-rate regionRon M. Roth, Alexander Zeh. 1103-1107 [doi]
- On spectral design methods for quasi-cyclic codesRon M. Roth, Alexander Zeh. 1108-1112 [doi]
- Spectral analysis of quasi-cyclic product codesAlexander Zeh, San Ling. 1113-1117 [doi]
- Estimation of KL divergence between large-alphabet distributionsYuheng Bu, Shaofeng Zou, Yingbin Liang, Venugopal V. Veeravalli. 1118-1122 [doi]
- On projections of the Rényi divergence on generalized convex setsM. Ashok Kumar, Igal Sason. 1123-1127 [doi]
- Information concentration for convex measuresJiange Li, Matthieu Fradelizi, Mokshay M. Madiman. 1128-1132 [doi]
- Improving convergence of divergence functional ensemble estimatorsKevin R. Moon, Kumar Sricharan, Kristjan H. Greenewald, Alfred O. Hero III. 1133-1137 [doi]
- Approximating probability distributions with short vectors, via information theoretic distance measuresFerdinando Cicalese, Luisa Gargano, Ugo Vaccaro. 1138-1142 [doi]
- Speeding up distributed machine learning using codesKangwook Lee, Maximilian Lam, Ramtin Pedarsani, Dimitris S. Papailiopoulos, Kannan Ramchandran. 1143-1147 [doi]
- Minimax lower bounds for Kronecker-structured dictionary learningZahra Shakeri, Waheed Uz Zaman Bajwa, Anand D. Sarwate. 1148-1152 [doi]
- Feeling the bern: Adaptive estimators for Bernoulli probabilities of pairwise comparisonsNihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright. 1153-1157 [doi]
- Interventional dependency graphs: An approach for discovering influence structureJalal Etesami, Negar Kiyavash. 1158-1162 [doi]
- Deep convolutional neural networks on cartoon functionsPhilipp Grohs, Thomas Wiatowski, Helmut Bölcskei. 1163-1167 [doi]
- An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionaryYoshinari Takeishi, Jun'ichi Takeuchi. 1168-1172 [doi]
- Proof of threshold saturation for spatially coupled sparse superposition codesJean Barbier, Mohamad Dia, Nicolas Macris. 1173-1177 [doi]
- On multistage learning a hidden hypergraphArkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin. 1178-1182 [doi]
- On a hypergraph approach to multistage group testing problemsArkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin. 1183-1191 [doi]
- Bounds for batch codes with restricted query sizeHui Zhang, Vitaly Skachek. 1192-1196 [doi]
- Constructions of batch codes with near-optimal redundancyAlexander Vardy, Eitan Yaakobi. 1197-1201 [doi]
- Explicit constructions of MDS array codes and RS codes with optimal repair bandwidthMin Ye, Alexander Barg. 1202-1206 [doi]
- Spider Codes: Practical erasure codes for distributed storage systemsLluis Pamies-Juarez, Cyril Guyot, Robert Mateescu. 1207-1211 [doi]
- New exact-repair codes for distributed storage systems using matrix determinantMehran Elyasi, Soheil Mohajer. 1212-1216 [doi]
- Lossless compression of binary trees with correlated vertex namesAbram Magner, Krzysztof Turowski, Wojciech Szpankowski. 1217-1221 [doi]
- Context Set Weighting methodHee-Sun Kim, Zsolt Talata. 1222-1226 [doi]
- A new Type Size code for universal one-to-one compression of parametric sourcesNematollah Iri, Oliver Kosut. 1227-1231 [doi]
- Cutset width and spacing for Reduced Cutset Coding of Markov random fieldsMatthew G. Reyes, David L. Neuhoff. 1232-1236 [doi]
- Generalisation of Kraft inequality for source coding into permutationsKristo Visk, Ago-Erik Riet. 1237-1241 [doi]
- Throughput maximization in uncooperative spectrum sharing networksThomas Stahlbuhk, Brooke Shrader, Eytan Modiano. 1242-1246 [doi]
- Caching in mobile HetNets: A throughput-delay trade-off perspectiveTrung-Anh Do, Sang-Woon Jeon, Won-Yong Shin. 1247-1251 [doi]
- Cognitive hierarchy theory for heterogeneous uplink multiple access in the Internet of ThingsNof Abuzainab, Walid Saad, H. Vincent Poor. 1252-1256 [doi]
- Bandlimited field estimation from samples recorded by a location-unaware mobile sensorAnimesh Kumar. 1257-1261 [doi]
- Simultaneous connectivity in heterogeneous cognitive radio networksMichal Yemini, Anelia Somekh-Baruch, Reuven Cohen, Amir Leshem. 1262-1266 [doi]
- Feedback does not increase the capacity of compound channels with additive noiseSergey Loyka, Charalambos D. Charalambous. 1267-1271 [doi]
- The zero-error capacity of the Gelfand-Pinsker channel with a feedback linkAnnina Bracher, Amos Lapidoth. 1272-1276 [doi]
- Conveying data and State with feedbackShraga I. Bross, Amos Lapidoth. 1277-1281 [doi]
- On optimal transmission strategies for channels with noiseless feedbackMarat V. Burnashev, Hirosuke Yamamoto. 1282-1286 [doi]
- Information structures of capacity achieving distribution for channels with memory and feedbackChristos K. Kourtellaris, Charalambos D. Charalambous. 1287-1291 [doi]
- Canonical conditions for K/2 degrees of freedomDavid Stotz, Syed Ali Jafar, Helmut Bölcskei, Shlomo Shamai. 1292-1296 [doi]
- GDoF of the MISO BC: Bridging the gap between finite precision CSIT and perfect CSITArash Gholami Davoodi, Syed Ali Jafar. 1297-1301 [doi]
- Degrees of freedom of MIMO Y channel with multiple relaysTian Ding, Xiaojun Yuan, Soung Chang Liew. 1302-1306 [doi]
- Generalized DoF of the symmetric K-user interference channel under finite precision CSITArash Gholami Davoodi, Syed Ali Jafar. 1307-1311 [doi]
- Degrees of freedom of the bursty MIMO X channel without feedbackShih-Yi Yeh, I-Hsiang Wang. 1312-1316 [doi]
- PD-sets for Z4-linear codes: Hadamard and Kerdock codesRoland D. Barrolleta, Mercè Villanueva. 1317-1321 [doi]
- n and its application to non-malleable codesDivesh Aggarwal, Jop Briët. 1322-1326 [doi]
- Two classes of zero difference balanced functions and their optimal constant composition codesYang Yang 0005, Zhengchun Zhou, Xiaohu Tang. 1327-1330 [doi]
- Rate-distance tradeoff for codes above graph capacityDaniel F. Cullina, Marco Dalai, Yury Polyanskiy. 1331-1335 [doi]
- Metrics based on finite directed graphsTuvi Etzion, Marcelo Firer. 1336-1340 [doi]
- Quickest detection of Markov networksJavad Heydari, Ali Tajer, H. Vincent Poor. 1341-1345 [doi]
- Information-theoretic lower bounds for recovery of diffusion network structuresKeehwan Park, Jean Honorio. 1346-1350 [doi]
- Inference of latent network features via co-intersection representations of graphsSon Hoang Dau, Olgica Milenkovic. 1351-1355 [doi]
- A p-ary MDPC schemeQian Guo, Thomas Johansson 0001. 1356-1360 [doi]
- Lower bounds and optimal protocols for three-party secure computationSundara Rajan S, Shijin Rajakrishnan, Andrew Thangaraj, Vinod Prabhakaran. 1361-1365 [doi]
- Worst case QC-MDPC decoder for McEliece cryptosystemJulia Chaulet, Nicolas Sendrier. 1366-1370 [doi]
- Message partitioning and limited auxiliary randomness: Alternatives to Honey EncryptionAmirEmad Ghassami, Daniel F. Cullina, Negar Kiyavash. 1371-1375 [doi]
- Estimating the number of defectives with group testingMoein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh. 1376-1380 [doi]
- Improved group testing rates with constant column weight designsMatthew Aldridge, Oliver Johnson, Jonathan Scarlett. 1381-1385 [doi]
- Data extraction via histogram and arithmetic mean queries: Fundamental limits and algorithmsI.-Hsiang Wang, Shao-Lun Huang, Kuan-Yun Lee, Kwang-Cheng Chen. 1386-1390 [doi]
- Secure Group TestingAlejandro Cohen, Asaf Cohen 0001, Omer Gurewitz. 1391-1395 [doi]
- Staircase codes for secret sharing with optimal communication and read overheadsRawad Bitar, Salim El Rouayheb. 1396-1400 [doi]
- Secure RAID schemes for distributed storageWentao Huang, Jehoshua Bruck. 1401-1405 [doi]
- The rate region of secure exact-repair regenerating codes for 5 nodesFangwei Ye, Kenneth W. Shum, Raymond W. Yeung. 1406-1410 [doi]
- Private information retrieval from MDS coded data in distributed storage systemsRazan Tajeddine, Salim El Rouayheb. 1411-1415 [doi]
- Super-resolution MIMO radarReinhard Heckel. 1416-1420 [doi]
- Variational Bayesian dynamic compressive sensingHongwei Wang, Hang Yu, Michael Hoy, Justin Dauwels, Heping Wang. 1421-1425 [doi]
- Support recovery from noisy random measurements via weighted ℓ1 minimizationJun Zhang, Urbashi Mitra, Kuan-Wen Huang, Nicolò Michelusi. 1426-1430 [doi]
- Adaptivity provably helps: Information-theoretic limits on l0 cost of non-adaptive sensingSanghamitra Dutta, Pulkit Grover. 1431-1435 [doi]
- Routing with blinkers: Online throughput maximization without queue length informationGeorgios S. Paschos, Mathieu Leconte, Apostolos Destounis. 1436-1440 [doi]
- Constructing sub-exponentially large optical priority queues with switches and fiber delay linesBin Tang, Xiaoliang Wang, Cam-Tu Nguyen, Sanglu Lu. 1441-1445 [doi]
- A general optimality condition of link scheduling for emptying a wireless networkQing He, Di Yuan, Anthony Ephremides. 1446-1450 [doi]
- Delay-optimal computation task scheduling for mobile-edge computing systemsJuan Liu, Yuyi Mao, Jun Zhang, Khaled Ben Letaief. 1451-1455 [doi]
- Collaboration alignment in distributed interference management in uplink cellular systemsBorna Kananian, Mohammad Ali Maddah-Ali, Seyed Pooya Shariatpanahi, Babak Hossein Khalaj. 1456-1460 [doi]
- Cell associations that maximize the average uplink-downlink degrees of freedomAly El Gamal. 1461-1465 [doi]
- Network MIMO: Transmitters with no CSI can still be very usefulPaul de Kerret, David Gesbert. 1466-1470 [doi]
- Advanced factorization strategies for lattice-reduction-aided preequalizationSebastian Stern, Robert F. H. Fischer. 1471-1475 [doi]
- Real interference alignment for vector channelsPritam Mukherjee, Sennur Ulukus. 1476-1480 [doi]
- The dirty MIMO multiple-access channelAnatoly Khina, Yuval Kochman, Uri Erez. 1481-1485 [doi]
- On the capacity of strong asynchronous multiple access channels with a large number of usersSara Shahi, Daniela Tuninetti, Natasha Devroye. 1486-1490 [doi]
- Multiple access channel with unreliable cribbingWasim Huleihel, Yossef Steinberg. 1491-1495 [doi]
- Helper-assisted state cancelation for multiple access channelsYunhao Sun, Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai. 1496-1500 [doi]
- On LCD codes and latticesXiaolu Hou, Frédérique E. Oggier. 1501-1505 [doi]
- Voronoi constellations for high-dimensional lattice codesNuwan S. Ferdinand, Matthew S. Nokleby, Behnaam Aazhang. 1506-1510 [doi]
- On the construction of capacity-achieving lattice Gaussian codesWael Alghamdi, Walid Abediseid, Mohamed-Slim Alouini. 1511-1515 [doi]
- Uniformity properties of Construction CMaiara F. Bollauf, Ram Zamir. 1516-1520 [doi]
- Exact random coding secrecy exponents for the wiretap channelMani Bastani Parizi, Emre Telatar, Neri Merhav. 1521-1525 [doi]
- Distributed detection over connected networks via one-bit quantizerShengyu Zhu, Biao Chen. 1526-1530 [doi]
- Computing the optimal exponent of correct decoding for discrete memoryless sourcesYutaka Jitsumatsu, Yasutada Oohama. 1531-1535 [doi]
- Remaining uncertainties and exponents under Rényi information measuresMasahito Hayashi, Vincent Y. F. Tan. 1536-1540 [doi]
- Asymptotically achievable error probabilities for multiple hypothesis testingPierre Moulin. 1541-1545 [doi]
- Optimal sequential test with finite horizon and constrained sensor selectionShang Li, Xiaoou Li, Xiaodong Wang, Jingchen Liu. 1546-1550 [doi]
- Deterministic performance analysis of subspace methods for cisoid parameter estimationCéline Aubel, Helmut Bölcskei. 1551-1555 [doi]
- A statistical perspective of sampling scores for linear regressionSiheng Chen, Rohan Varma, Aarti Singh, Jelena Kovacevic. 1556-1560 [doi]
- Guaranteed error correction of faulty bit-flipping decoders under data-dependent gate failuresSrdan Brkic, Predrag Ivanis, Bane Vasic. 1561-1565 [doi]
- Performance evaluation of faulty iterative decoders using absorbing Markov chainsPredrag Ivanis, Bane Vasic, David Declercq. 1566-1570 [doi]
- Performance analysis of fault erasure belief propagation decoder based on density evolutionHiroki Mori, Tadashi Wadayama. 1571-1575 [doi]
- LDPC decoders with missing connectionsLinjia Chang, Avhishek Chatterjee, Lav R. Varshney. 1576-1580 [doi]
- Improved erasure list decoding locally repairable codes using alphabet-dependent list recoveryAlexander Zeh, Antonia Wachter-Zeh. 1581-1585 [doi]
- Bounds on the maximal minimum distance of linear locally repairable codesAntti Pöllänen, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti. 1586-1590 [doi]
- New constructions of SD and MR codes over small finite fieldsGuangda Hu, Sergey Yekhanin. 1591-1595 [doi]
- Sequence reconstruction over the deletion channelRyan Gabrys, Eitan Yaakobi. 1596-1600 [doi]
- A lower bound on the optimum feedback rate for downlink multi-antenna cellular networksJeongHun Park, Jeffrey G. Andrews, Robert W. Heath, Namyoon Lee. 1601-1605 [doi]
- An uplink-downlink duality for cloud radio access networkLiang Liu, Pratik Patil, Wei Yu 0001. 1606-1610 [doi]
- Gaussian approximation for the downlink interference in heterogeneous cellular networksSerkan Ak, Hazer Inaltekin, H. Vincent Poor. 1611-1615 [doi]
- Downlink outage performance of heterogeneous cellular networksSerkan Ak, Hazer Inaltekin, H. Vincent Poor. 1616-1620 [doi]
- High probability guarantees in repeated games: Theory and applications in information theoryPayam Delgosha, Amin Aminzadeh Gohari, Mohammad Akbarpour. 1621-1625 [doi]
- On the role of side information in strategic communicationEmrah Akyol, Cedric Langbort, Tamer Basar. 1626-1630 [doi]
- Dynamic signaling games under Nash and Stackelberg equilibriaSerkan Saritas, Serdar Yüksel, Sinan Gezici. 1631-1635 [doi]
- Secondary spectrum market: To acquire or not to acquire side information?Arnob Ghosh, Saswati Sarkar, Randall A. Berry. 1636-1640 [doi]
- Relations between conditional Shannon entropy and expectation of ℓα-normYuta Sakai, Ken-ichi Iwata. 1641-1645 [doi]
- On the minimum mean p-th error in Gaussian noise channels and its applicationsAlex Dytso, Ronit Bustin, Daniela Tuninetti, Natasha Devroye, H. Vincent Poor, Shlomo Shamai. 1646-1650 [doi]
- Consistency of the plug-in estimator of the entropy rate for ergodic processesLukasz Debowski. 1651-1655 [doi]
- A characterization of statistical manifolds on which the relative entropy is a Bregman divergenceHiroshi Nagaoka. 1656-1659 [doi]
- Achievable rate regions for cooperative relay broadcast channels with rate-limited feedbackYoulong Wu. 1660-1664 [doi]
- Capacity of two-relay diamond networks with rate-limited links to the relays and a binary adder multiple access channelShirin Saeedi Bidokhti, Gerhard Kramer. 1665-1669 [doi]
- An achievable rate region for the two-way multiple relay channelJonathan Ponniah, Liang-Liang Xie. 1670-1674 [doi]
- Improving on the cut-set bound for general primitive relay channelsXiugang Wu, Ayfer Özgür. 1675-1679 [doi]
- Entanglement assisted classical capacity of compound quantum channelsHolger Boche, Gisbert Janssen, Stephan Kaltenstadler. 1680-1684 [doi]
- Quantum capacities for entanglement networksShawn X. Cui, Zheng-Feng Ji, Nengkun Yu, Bei Zeng. 1685-1689 [doi]
- A semidefinite programming upper bound of quantum capacityXin Wang, Runyao Duan. 1690-1694 [doi]
- Operator algebra approach to quantum capacitiesLi Gao, Marius Junge, Nicholas LaRacuente. 1695-1699 [doi]
- Unequal error protection coding approaches to the noisy 20 questions problemHye Won Chung, Lizhong Zheng, Brian M. Sadler, Alfred O. Hero III. 1700-1704 [doi]
- Collaborative distributed hypothesis testing with general hypothesesGil Katz, Pablo Piantanida, Mérouane Debbah. 1705-1709 [doi]
- Reliability of sequential hypothesis testing can be achieved by an almost-fixed-length testAnusha Lalitha, Tara Javidi. 1710-1714 [doi]
- Bounds on the reliability of a typewriter channelMarco Dalai, Yury Polyanskiy. 1715-1719 [doi]
- Asymptotically tight bounds on the depth of estimated context treesAlvaro Martín, Gadiel Seroussi. 1720-1724 [doi]
- Structure learning and universal coding when missing values existJoe Suzuki. 1725-1729 [doi]
- Latent tree ensemble of pairwise copulas for spatial extremes analysisHang Yu, Junwei Huang, Justin Dauwels. 1730-1734 [doi]
- Sparse approximations of directed information graphsChristopher J. Quinn, Ali Pinar, Jing Gao, Lu Su. 1735-1739 [doi]
- Stopping sets for MDS-based product codesFanny Jardel, Joseph Jean Boutros, Mireille Sarkiss. 1740-1744 [doi]
- Probabilistic bounds on the trapping redundancy of linear codesYu Tsunoda, Yuichiro Fujiwara. 1745-1749 [doi]
- Reed-Muller codes achieve capacity on the quantum erasure channelSanthosh Kumar, A. Robert Calderbank, Henry D. Pfister. 1750-1754 [doi]
- Comparing the bit-MAP and block-MAP decoding thresholds of reed-muller codes on BMS channelsShrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Rudiger Urbankez. 1755-1759 [doi]
- Enhanced recursive Reed-Muller erasure decodingAlexandre Soro, Jérôme Lacan, Vincent Roca, Valentin Savin, Mathieu Cunche. 1760-1763 [doi]
- A characterization of the capacity region for network coding with dependent sourcesWoong Kim, Michael Langberg, Michelle Effros. 1764-1768 [doi]
- On tightness of an entropic region outer bound for network coding and the edge removal propertyMing Fai Wong, Michelle Effros, Michael Langberg. 1769-1773 [doi]
- A reduction approach to the multiple-unicast conjecture in network codingXunrui Yin, Zongpeng Li, Xin Wang. 1774-1778 [doi]
- On the relationship between edge removal and strong conversesOliver Kosut, Jörg Kliewer. 1779-1783 [doi]
- Can negligible cooperation increase network reliability?Parham Noorzad, Michelle Effros, Michael Langberg. 1784-1788 [doi]
- Design of geometric molecular bondsDavid Doty, Andrew Winslow. 1789-1793 [doi]
- Fundamental limits on source-localization accuracy of EEG-based neural sensingPulkit Grover. 1794-1798 [doi]
- Partial DNA assembly: A rate-distortion perspectiveIlan Shomorony, Govinda M. Kamath, Fei Xia, Thomas A. Courtade, David N. C. Tse. 1799-1803 [doi]
- Shannon capacity of signal transduction for multiple independent receptorsPeter J. Thomas, Andrew W. Eckford. 1804-1808 [doi]
- New proofs of retrievability using locally decodable codesJulien Lavauzelle, Françoise Levy-dit-Vehel. 1809-1813 [doi]
- Fundamental tradeoff between computation and communication in distributed computingSongze Li, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr. 1814-1818 [doi]
- Erasure broadcast networks with receiver cachingShirin Saeedi Bidokhti, Michele A. Wigger, Roy Timo. 1819-1823 [doi]
- How to compute modulo prime-power sumsMohsen Heidari, S. Sandeep Pradhan. 1824-1828 [doi]
- Energy-distortion tradeoff for the gaussian broadcast channel with feedbackYonathan Murin, Yonatan Kaspi, Ron Dabora, Deniz Gündüz. 1829-1833 [doi]
- Distortion bounds for source broadcast over degraded channelLei Yu, Houqiang Li, Weiping Li. 1834-1838 [doi]
- On the energy-distortion tradeoff for the Gaussian broadcast problemErman Koken, Ertem Tuncel. 1839-1843 [doi]
- Joint source-channel coding for broadcasting correlated sourcesErman Koken, Ertem Tuncel. 1844-1848 [doi]
- The capacity gap calculation for multi-pair bidirectional Gaussian relay networks based on successive compute-and-forward strategyLeila Ghabeli, Milan S. Derpich. 1849-1853 [doi]
- Adaptation is useless for two discrete additive-noise two-way channelsLin Song, Fady Alajaji, Tamás Linder. 1854-1858 [doi]
- Capacity and power scaling laws for finite antenna amplify-and-forward relay networksDavid E. Simmons, Justin P. Coon, Naqueeb Ahmad Warsi. 1859-1863 [doi]
- On full duplex Gaussian relay channels with self-interferenceArash Behboodi, Anas Chaaban, Rudolf Mathar, Mohamed-Slim Alouini. 1864-1868 [doi]
- On the capacity of multilevel NAND flash memory channelsYonglong Li, Aleksandar Kavcic, Guangyue Han. 1869-1873 [doi]
- Achievable rates for additive isotropic α-stable noise channelsMalcolm Egan, Mauro de Freitas, Laurent Clavier, Alban Goupil, Gareth W. Peters, Nourddine Azzaoui. 1874-1878 [doi]
- On the capacity of fading channels with amplitude-limited inputsAhmad ElMoslimany, Tolga M. Duman. 1879-1883 [doi]
- Capacity of block Rayleigh fading channels without CSIMainak Chowdhury, Andrea Goldsmith. 1884-1888 [doi]
- Active learning for community detection in stochastic block modelsAkshay Gadde, Eyal En Gad, Salman Avestimehr, Antonio Ortega. 1889-1893 [doi]
- Information limits for recovering a hidden communityBruce E. Hajek, Yihong Wu, Jiaming Xu. 1894-1898 [doi]
- Community detection with colored edgesNarae Ryu, Sae-Young Chung. 1899-1903 [doi]
- Partial recovery bounds for the sparse stochastic block modelJonathan Scarlett, Volkan Cevher. 1904-1908 [doi]
- Short block length code design for interference channelsShahrouz Sharifi, Mehdi Dabirnia, Amir Korhan Tanc, Tolga M. Duman. 1909-1913 [doi]
- Approaching the capacity of AWGN channels using multi-layer raptor codes and superposition modulationMahyar Shirvanimoghaddam, Sarah J. Johnson. 1914-1918 [doi]
- Two-way spinal codesWeiqiang Yang, Ying Li, Xiaopu Yu, Yue Sun. 1919-1923 [doi]
- Further results on independent Metropolis-Hastings-Klein samplingZheng Wang 0013, Cong Ling. 1924-1928 [doi]
- Systematic block Markov superposition transmission of repetition codesKechao Huang, Xiao Ma, Baoming Bai. 1929-1933 [doi]
- Computing linear transforms with unreliable componentsYaoqing Yang, Pulkit Grover, Soummya Kar. 1934-1938 [doi]
- Constructing valid convex hull inequalities for single parity-check codes over prime fieldsEirik Rosnes, Michael Helmling. 1939-1943 [doi]
- Linear programming decoding of binary linear codes for symbol-pair read channelsShunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa. 1944-1948 [doi]
- Vector network coding based on subspace codes outperforms scalar linear network codingTuvi Etzion, Antonia Wachter-Zeh. 1949-1953 [doi]
- On the construction of jointly superregular lower triangular Toeplitz matricesJonas Hansen, Jan Østergaard, Johnny Kudahl, John H. Madsen. 1954-1958 [doi]
- Generalized rank weights of reducible codes, optimal cases and related propertiesUmberto Martínez-Peñas. 1959-1963 [doi]
- A class of non-linearly solvable networksJoseph Connelly, Kenneth Zeger. 1964-1968 [doi]
- Subblock energy-constrained codes for simultaneous energy and information transferAnshoo Tandon, Mehul Motani, Lav R. Varshney. 1969-1973 [doi]
- Feedback enhances simultaneous energy and information transmission in multiple access channelsSelma Belhadj Amor, Samir Medina Perlaza, Ioannis Krikidis, H. Vincent Poor. 1974-1978 [doi]
- Capacity of remotely powered communicationDor Shaviv, Ayfer Özgür, Haim H. Permuter. 1979-1983 [doi]
- Online scheduling for energy harvesting broadcast channels with finite batteryAbdulrahman Baknina, Sennur Ulukus. 1984-1988 [doi]
- Privacy-aware MMSE estimationShahab Asoodeh, Fady Alajaji, Tamás Linder. 1989-1993 [doi]
- A tiger by the tail: When multiplicative noise stymies controlJian Ding, Yuval Peres, Gireeja Ranade. 1994-1998 [doi]
- Continuity and robustness to incorrect priors in estimation and controlGraeme Baker, Serdar Yüksel. 1999-2003 [doi]
- Uncertain wiretap channels and secure estimationMoritz Wiese, Karl Henrik Johansson, Tobias J. Oechtering, Panos Papadimitratos, Henrik Sandberg, Mikael Skoglund. 2004-2008 [doi]
- On lossy transmission of correlated sources over a multiple access channelBasak Guler, Deniz Gündüz, Aylin Yener. 2009-2013 [doi]
- Communicating correlated sources over a MAC in the absence of a Gács-Körner common partArun Padakandla. 2014-2018 [doi]
- New sufficient conditions for Multiple-Access Channel with correlated sourcesMohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan. 2019-2023 [doi]
- A necessary condition for the transmissibility of correlated sources over a MACAmos Lapidoth, Michele A. Wigger. 2024-2028 [doi]
- Cloud-aided wireless networks with edge caching: Fundamental latency trade-offs in fog Radio Access NetworksRavi Tandon, Osvaldo Simeone. 2029-2033 [doi]
- Cooperative Tx/Rx caching in interference channels: A storage-latency tradeoff studyFan Xu, Kangqi Liu, Meixia Tao. 2034-2038 [doi]
- Topological coded cachingXinping Yi, Giuseppe Caire. 2039-2043 [doi]
- Fundamental limits of cache-aided interference managementNavid Naderializadeh, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr. 2044-2048 [doi]
- Classical-quantum channels with causal and non-causal channel state information at the senderHolger Boche, Ning Cai, Janis Noetzel. 2049-2053 [doi]
- Coding for classical-quantum channels with rate limited side information at the encoder: An information-spectrum approachNaqueeb Ahmad Warsi, Justin P. Coon. 2054-2058 [doi]
- Classical-quantum arbitrarily varying wiretap channel: Common randomness assisted code and continuityHolger Boche, Minglai Cai, Christian Deppe, Janis Noetzel. 2059-2063 [doi]
- Covert communication over classical-quantum channelsAzadeh Sheikholeslami, Boulat A. Bash, Don Towsley, Dennis Goeckel, Saikat Guha. 2064-2068 [doi]
- Optimal differential privacy mechanisms under Hamming distortion for structured source classesKousha Kalantari, Lalitha Sankar, Anand D. Sarwate. 2069-2073 [doi]
- Analog coding of a source with erasuresMarina Haikin, Ram Zamir. 2074-2078 [doi]
- Rate-distortion dimension of stochastic processesFarideh Ebrahim Rezagah, Shirin Jalali, Elza Erkip, H. Vincent Poor. 2079-2083 [doi]
- Windowed encoding of spatially coupled LDGM codes for lossy source compressionAhmad Golmohammadi, David G. M. Mitchell, Jörg Kliewer, Daniel J. Costello Jr.. 2084-2088 [doi]
- Are imperfect reviews helpful in social learning?Tho Ngoc Le, Vijay G. Subramanian, Randall A. Berry. 2089-2093 [doi]
- Pattern maximum likelihood estimation of finite-state discrete-time Markov chainsShashank Vatedka, Pascal O. Vontobel. 2094-2098 [doi]
- Rate-distortion bounds on Bayes risk in supervised learningMatthew S. Nokleby, Ahmad Beirami, A. Robert Calderbank. 2099-2103 [doi]
- An explicit rate bound for over-relaxed ADMMGuilherme Franca, José Bento. 2104-2108 [doi]
- Finite-length scaling based on Belief Propagation for spatially coupled LDPC codesMarkus Stinner, Luca Barletta, Pablo M. Olmos. 2109-2113 [doi]
- Deterministic and ensemble-based spatially-coupled product codesChristian Häger, Henry D. Pfister, Alexandre Graell i Amat, Fredrik Brannstrom. 2114-2118 [doi]
- The velocity of the decoding wave for spatially coupled codes on BMS channelsRafah El-Khatib, Nicolas Macris. 2119-2123 [doi]
- Decoding analysis accounting for mis-corrections for spatially-coupled split-component codesDmitri V. Truhachev, Alireza Karami, Lei M. Zhang, Frank R. Kschischang. 2124-2128 [doi]
- A progressive edge growth algorithm for bit mapping design of LDPC coded BICM schemesJunyi Du, Jinhong Yuan, Liang Zhou, Xuan He. 2129-2133 [doi]
- Coding across unicast sessions can increase the secure message capacityGaurav Kumar Agarwal, Martina Cardone, Christina Fragouli. 2134-2138 [doi]
- Arbitrarily varying networks: Capacity-achieving computationally efficient codesPeida Tian, Sidharth Jaggi, Mayank Bakshi, Oliver Kosut. 2139-2143 [doi]
- Linear network coding capacity region of the smart repeater with broadcast erasure channelsJaemin Han, Chih-Chun Wang. 2144-2148 [doi]
- Superposition coding in the combination networkHenry P. Romero, Mahesh Kumar Varanasi. 2149-2153 [doi]
- Approximate capacity of index coding for some classes of graphsFatemeh Arbabjolfaei, Young-Han Kim 0001. 2154-2158 [doi]
- Time and frequency selective Ricean MIMO capacity: An ergodic operator approachWalid Hachem, Aris L. Moustakas, Leonid A. Pastur. 2159-2163 [doi]
- Optical fiber MIMO channel model and its analysisApostolos Karadimitrakis, Aris L. Moustakas, Hartmut Hafermann, Axel Mueller. 2164-2168 [doi]
- Limiting eigenvalue distributions of block random matrices with one-dimensional coupling structureToshiyuki Tanaka. 2169-2173 [doi]
- Exact closed-form expression for the inverse moments of one-sided correlated Gram matricesKhalil Elkhalil, Abla Kammoun, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini. 2174-2178 [doi]
- Outage-optimized distributed quantizers for multicast beamformingErdem Koyuncu, Christian Remling, Xiaoyi Leo Liu, Hamid Jafarkhani. 2179-2183 [doi]
- The impact of independence assumptions on wireless communication analysisEzio Biglieri, I-Wei Lai. 2184-2188 [doi]
- On utility optimization in distributed multiple access over a multi-packet reception channelYanru Tang, Faeze Heydaryan, Jie Luo. 2189-2193 [doi]
- Robustness of cooperative communication schemes to channel modelsVasuki Narasimha Swamy, Gireeja Ranade, Anant Sahai. 2194-2198 [doi]
- Some results on the scalar Gaussian interference channelSalman Beigi, Sida Liu, Chandra Nair, Mehdi Yazdanpanah. 2199-2203 [doi]
- The maximum Han-Kobayashi sum-rate for Gaussian interference channelsAli Haghi, Amir K. Khandani. 2204-2208 [doi]
- Converse bounds for interference channels via coupling and proof of Costa's conjectureYury Polyanskiy, Yihong Wu 0001. 2209-2213 [doi]
- Trade-off between communication and cooperation in the Interference ChannelFarhad Shirani Chaharsooghi, S. Sandeep Pradhan. 2214-2218 [doi]
- Plausible deniability over broadcast channelsMayank Bakshi, Vinod M. Prabhakaran. 2219-2223 [doi]
- Second-order asymptotics of covert communications over noisy channelsMehrdad Tahmasbi, Matthieu R. Bloch. 2224-2228 [doi]
- Keyless covert communication over Multiple-Access ChannelsKeerthi Suria Kumar Arumugam, Matthieu R. Bloch. 2229-2233 [doi]
- Computationally efficient deniable communicationQiaosheng Eric Zhang, Mayank Bakshi, Sidharth Jaggi. 2234-2238 [doi]
- A Bayesian view of single-qubit clocks, and an energy versus accuracy tradeoffManoj Gopalkrishnan, Abhishek Deshpande, Varshith Kandula, Praveen Sriram. 2239-2243 [doi]
- On the quantum no-signalling assisted zero-error classical simulation cost of non-commutative bipartite graphsXin Wang, Runyao Duan. 2244-2248 [doi]
- Comparison of quantum channels and statistical experimentsAnna Jencová. 2249-2253 [doi]
- Stronger attacks on causality-based key agreementBenno Salwey, Stefan Wolf. 2254-2258 [doi]
- Parallel distinguishability of quantum operationsRunyao Duan, Cheng Guo, Chi-Kwong Li, Yinan Li. 2259-2263 [doi]
- Codeword stabilized quantum codes for asymmetric channelsTyler Jackson, Markus Grassl, Bei Zeng. 2264-2268 [doi]
- Concatenated codes for amplitude dampingTyler Jackson, Markus Grassl, Bei Zeng. 2269-2273 [doi]
- Correction of data and syndrome errors by stabilizer codesAlexei E. Ashikhmin, Ching-Yi Lai, Todd A. Brun. 2274-2278 [doi]
- Generalized fault-tolerant quantum computation over nice ringsSangjun Lee, Andreas Klappenecker. 2279-2283 [doi]
- Reverse entropy power inequalities for s-concave densitiesPeng Xu, James Melbourne, Mokshay M. Madiman. 2284-2288 [doi]
- On Rényi entropy power inequalitiesEshed Ram, Igal Sason. 2289-2293 [doi]
- Strengthening the entropy power inequalityThomas A. Courtade. 2294-2298 [doi]
- Cyclically symmetric entropy inequalitiesJun Chen, Hao Ye, Chao Tian, Tie Liu, Zhiqing Xiao. 2299-2303 [doi]
- Generalized fisher information and upper bounds on the differential entropy of independent sumsJihad Fahs, Ibrahim C. Abou-Faycal. 2304-2308 [doi]
- Coding advantage in communications among peersKai Cai, Guangyue Han. 2309-2313 [doi]
- Fairness in communication for omniscienceNi Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi. 2314-2318 [doi]
- Further results on lower bounds for coded cachingHooshang Ghasemi, Aditya Ramamoorthy. 2319-2323 [doi]
- Cooperative data exchange with priority classesAnoosheh Heidarzadeh, Muxi Yan, Alex Sprintson. 2324-2328 [doi]
- Universal multiparty data exchangeHimanshu Tyagi, Shun Watanabe. 2329-2333 [doi]
- On the energy benefit of compute-and-forward for multiple unicastsZhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar. 2334-2338 [doi]
- Universally Secure Network Coding with feedbackGabriele Spini, Gilles Zémor. 2339-2343 [doi]
- A linearithmic time algorithm for a shortest vector problem in compute-and-forward designJinming Wen, Xiao-Wen Chang. 2344-2348 [doi]
- Adaptive recoding for BATS codesHoover H. F. Yin, Shenghao Yang, Qiaoqiao Zhou, Lily M. L. Yung. 2349-2353 [doi]
- On computation rates for arithmetic sumArdhendu Tripathy, Aditya Ramamoorthy. 2354-2358 [doi]
- Coded compressive sensing: A compute-and-recover approachNamyoon Lee, Song-Nam Hong. 2359-2363 [doi]
- A sharp condition for exact support recovery of sparse signals with orthogonal matching pursuitJinming Wen, Zhengchun Zhou, Jian Wang, Xiaohu Tang, Qun Mo. 2364-2368 [doi]
- Universal compressed sensingShirin Jalali, H. Vincent Poor. 2369-2373 [doi]
- Two-stage orthogonal Subspace Matching Pursuit for joint sparse recoveryKyung-Su Kim, Sae-Young Chung. 2374-2378 [doi]
- A geometric analysis of phase retrievalJu Sun, Qing Qu, John Wright. 2379-2383 [doi]
- Zero-rate achievability of posterior matching schemes for channels with memoryJui Wu, Achilleas Anastasopoulos. 2384-2388 [doi]
- State estimation, wireless tropes, demons and uncertaintyChristopher Rose. 2389-2393 [doi]
- Stationarity and ergodicity of stochastic non-linear systems controlled over communication channelsSerdar Yüksel. 2394-2398 [doi]
- Rate of prefix-free codes in LQG control systemsTakashi Tanaka, Karl Henrik Johansson, Tobias J. Oechtering, Henrik Sandberg, Mikael Skoglund. 2399-2403 [doi]
- (Almost) practical tree codesAnatoly Khina, Wael Halbawi, Babak Hassibi. 2404-2408 [doi]
- Second-order coding region for the discrete lossy Gray-Wyner source coding problemLin Zhou, Vincent Y. F. Tan, Mehul Motani. 2409-2413 [doi]
- Second-order coding region for the discrete successive refinement source coding problemLin Zhou, Vincent Y. F. Tan, Mehul Motani. 2414-2418 [doi]
- On second-order asymptotics of AWGN channels with feedback under the expected power constraintLan V. Truong, Silas L. Fong, Vincent Y. F. Tan. 2419-2423 [doi]
- Fixed-length compression for letter-based fidelity measures in the finite blocklength regimeLars Palzer, Roy Timo. 2424-2428 [doi]
- On channel dispersion per unit costYucel Altug, H. Vincent Poor, Sergio Verdú. 2429-2433 [doi]
- Security in the Gaussian interference channel: Weak and moderately weak interference regimesParisa Babaheidarian, Somayeh Salimi, Panos Papadimitratos. 2434-2438 [doi]
- Multiuser authentication with anonymity constraints over noisy channelsRemi A. Chou, Aylin Yener. 2439-2443 [doi]
- Secrecy in broadcast channel with combating helpers and interference channel with selfish usersKarim A. Banawan, Sennur Ulukus. 2444-2448 [doi]
- On secrecy rates and outage in multi-user multi-eavesdroppers MISO systemsJoseph Kampeas, Asaf Cohen 0001, Omer Gurewitz. 2449-2453 [doi]
- Secure lossy helper and Gray-Wyner problemsMeryem Benammar, Abdellatif Zaidi. 2454-2458 [doi]
- Connectivity in inhomogeneous random key graphsOsman Yagan. 2459-2463 [doi]
- Minimum node degree in inhomogeneous random key graphs with unreliable linksRashad Eletreby, Osman Yagan. 2464-2468 [doi]
- Improved active sensing performance in wireless sensor networks via channel state informationAlessandro Biason, Urbashi Mitra, Michele Zorzi. 2469-2473 [doi]
- Optimal Byzantine attack for distributed inference with M-ary quantized dataPo-Ning Chen, Yunghsiang S. Han, Hsuan-Yin Lin, Pramod K. Varshney. 2474-2478 [doi]
- MMSE estimation in a sensor network in the presence of an adversaryCraig Wilson, Venugopal V. Veeravalli. 2479-2483 [doi]
- Unconstrained distillation capacities of a pure-loss bosonic broadcast channelMasahiro Takeoka, Kaushik P. Seshadreesan, Mark M. Wilde. 2484-2488 [doi]
- Asymptotic analysis of a three state quantum cryptographic protocolWalter O. Krawec. 2489-2493 [doi]
- Universal recoverability in quantum informationMarius Junge, Renato Renner, David Sutter, Mark M. Wilde, Andreas Winter. 2494-2498 [doi]
- Coherent state constellations for Bosonic Gaussian channelsFelipe G. Lacerda, Joseph M. Renes, Volkher B. Scholz. 2499-2503 [doi]
- Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source modelManuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou. 2504-2508 [doi]
- Nearly optimal robust secret sharingMahdi Cheraghchi. 2509-2513 [doi]
- Incremental and decremental secret key agreementChung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou. 2514-2518 [doi]
- Quantum resistant random linear code based public key encryption scheme RLCEYongge Wang. 2519-2523 [doi]
- Minimal characterization and provably efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codesYoones Hashemi, Amir H. Banihashemi. 2524-2528 [doi]
- Distance verification for LDPC codesIlya Dumer, Alexey A. Kovalev, Leonid P. Pryadko. 2529-2533 [doi]
- Near-capacity protograph doubly-generalized LDPC codes with block thresholdsAsit Kumar Pradhan, Andrew Thangaraj. 2534-2538 [doi]
- Performance bounds for quantized LDPC decoders based on absorbing setsHomayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja. 2539-2543 [doi]
- Considerations for rank-based cryptosystemsAnna-Lena Horlemann-Trautmann, Kyle Marshall, Joachim Rosenthal. 2544-2548 [doi]
- An alternative decoding method for Gabidulin codes in characteristic zeroSven Müelich, Sven Puchinger, David Mödinger, Martin Bossert. 2549-2553 [doi]
- Sub-quadratic decoding of Gabidulin codesSven Puchinger, Antonia Wachter-Zeh. 2554-2558 [doi]
- A quadratic Welch-Berlekamp algorithm to decode generalized Gabidulin codes, and some variantsGwezheneg Robert. 2559-2563 [doi]
- Age of information with a packet deadlineClement Kam, Sastry Kompella, Gam D. Nguyen, Jeffrey E. Wieselthier, Anthony Ephremides. 2564-2568 [doi]
- Optimizing data freshness, throughput, and delay in multi-server information-update systemsAhmed M. Bedewy, Yin Sun, Ness B. Shroff. 2569-2573 [doi]
- Age of information: The gamma awakeningElie Najm, Rajai Nasser. 2574-2578 [doi]
- Age-of-information in the presence of errorKun Chen, Longbo Huang. 2579-2583 [doi]
- Wireless networks of bounded capacityGrace Villacrés, Tobias Koch. 2584-2588 [doi]
- On network simplification for Gaussian Half-Duplex diamond networksMartina Cardone, Christina Fragouli, Daniela Tuninetti. 2589-2593 [doi]
- Wireless network simplification: Beyond diamond networksYahya H. Ezzeldin, Ayan Sengupta, Christina Fragouli. 2594-2598 [doi]
- Throughput of two-hop wireless channels with queueing constraints and finite blocklength codesYi Li, Mustafa Cenk Gursoy, Senem Velipasalar. 2599-2603 [doi]
- The ρ-capacity of a graphSihuang Hu, Ofer Shayevitz. 2604-2608 [doi]
- Convergence of generalized entropy minimizers in sequences of convex problemsImre Csiszár, Frantisek Matús. 2609-2613 [doi]
- Orbit-entropy cones and extremal pairwise orbit-entropy inequalitiesJun Chen, Amir Salimi, Tie Liu, Chao Tian. 2614-2618 [doi]
- Information stabilization of images over discrete memoryless channelsEric Graves, Tan F. Wong. 2619-2623 [doi]
- When does spatial correlation add value to delayed channel state information?Alireza Vahid, A. Robert Calderbank. 2624-2628 [doi]
- On the optimality of zero-forcing and treating interference as noise for K-user MIMO interference channelsChunhua Geng, Syed Ali Jafar. 2629-2633 [doi]
- On the impact of sparsity on the broadcast capacity of wireless networksSerj Haddad, Olivier Lévêque. 2634-2638 [doi]
- Role of a relay in bursty networks with correlated transmissionsSunghyun Kim, Soheil Mohajer, Changho Suh. 2639-2643 [doi]
- Codes in the damerau distance for DNA storageRyan Gabrys, Eitan Yaakobi, Olgica Milenkovic. 2644-2648 [doi]
- Weakly mutually uncorrelated codesS. M. Hossein Tabatabaei Yazdi, Han Mao Kiah, Olgica Milenkovic. 2649-2653 [doi]
- On the number of DNA sequence profiles for practical values of read lengthsZuling Chang, Johan Chrisnata, Martianus Frederic Ezerman, Han Mao Kiah. 2654-2658 [doi]
- The generalized stochastic likelihood decoder: Random coding and expurgated boundsNeri Merhav. 2659-2663 [doi]
- The dispersion of nearest-neighbor decoding for additive non-Gaussian channelsJonathan Scarlett, Vincent Y. F. Tan, Giuseppe Durisi. 2664-2668 [doi]
- A beta-beta achievability bound with applicationsWei Yang, Austin Collins, Giuseppe Durisi, Yury Polyanskiy, H. Vincent Poor. 2669-2673 [doi]
- Variable-length coding with stop-feedback for the common-message broadcast channelKasper Fløe Trillingsgaard, Wei Yang, Giuseppe Durisi, Petar Popovski. 2674-2678 [doi]
- Distributed recursive composite hypothesis testing: Imperfect communicationAnit Kumar Sahu, Soummya Kar. 2679-2683 [doi]
- Sharp minimax bounds for testing discrete monotone distributionsYuting Wei, Martin J. Wainwright. 2684-2688 [doi]
- Learning Markov distributions: Does estimation trump compression?Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh. 2689-2693 [doi]
- Locally differentially-private distribution estimationAdriano Pastore, Michael Gastpar. 2694-2698 [doi]
- Asynchronous decentralized algorithms for the noisy 20 questions problemTheodoros Tsiligkaridis. 2699-2703 [doi]
- Low complexity algorithm approaching the ML decoding of binary LDPC codesIrina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka. 2704-2708 [doi]
- The weight consistency matrix framework for general non-binary LDPC code optimization: Applications in flash memoriesAhmed Hareedy, Chinmayi Lanka, Clayton Schoeny, Lara Dolecek. 2709-2713 [doi]
- Construction of full-diversity 1-level LDPC lattices for block-fading channelsHassan Khodaiemehr, Mohammad-Reza Sadeghi 0001, Daniel Panario. 2714-2718 [doi]
- Spatially-coupled codes approach symmetric information rate of finite-state Markov fading channelsHiroshi Abe, Kenta Kasai. 2719-2723 [doi]
- Rate and delay for coded caching with carrier aggregationNikhil Karamchandani, Suhas N. Diggavi, Giuseppe Caire, Shlomo Shamai. 2724-2728 [doi]
- Sparse random linear network coding for data compression in WSNsWenjie Li, Francesca Bassi, Michel Kieffer. 2729-2733 [doi]
- Energy efficient distributed coding for data collection in a noisy sparse networkYaoqing Yang, Soummya Kar, Pulkit Grover. 2734-2738 [doi]
- Online policies for multiple access channel with common energy harvesting sourceAbdulrahman Baknina, Sennur Ulukus. 2739-2743 [doi]
- Capacity of the energy harvesting Gaussian MACHuseyin A. Inan, Dor Shaviv, Ayfer Özgür. 2744-2748 [doi]
- Optimization of time-switching energy harvesting receivers over multiple transmission blocksZhengwei Ni, Mehul Motani. 2749-2753 [doi]
- Optimal aging-aware channel access control for wireless networks with energy harvestingRoberto Valentini, Marco Levorato. 2754-2758 [doi]
- On the capacity of a class of dual-band interference channelsSubhajit Majhi, Patrick Mitran. 2759-2763 [doi]
- Multiuser two-way rangingRyan Keating, Dongning Guo. 2764-2768 [doi]
- QoS-driven energy-efficient power control with Markov arrivals and finite-alphabet inputsGozde Ozcan, Mustafa Ozmen, Mustafa Cenk Gursoy. 2769-2773 [doi]
- Lattice strategies for the ergodic fading dirty paper channelAhmed Hindy, Aria Nosratinia. 2774-2778 [doi]
- Cascade channels with infinite memoryMartin Mittelbach, Eduard A. Jorswieck. 2779-2783 [doi]
- Quickest sequence phase detectionLele Wang, Sihuang Hu, Ofer Shayevitz. 2784-2788 [doi]
- Lossless linear analog compressionGiovanni Alberti, Helmut Bölcskei, Camillo De Lellis, Günther Koliander, Erwin Riegler. 2789-2793 [doi]
- Mutual information, relative entropy and estimation error in semi-martingale channelsJiantao Jiao, Kartik Venkat, Tsachy Weissman. 2794-2798 [doi]
- Semantic-security capacity for wiretap channels of type IIZiv Goldfeld, Paul Cuff, Haim H. Permuter. 2799-2803 [doi]
- A new wiretap channel model and its strong secrecy capacityMohamed S. Nafea, Aylin Yener. 2804-2808 [doi]
- Strong secrecy and stealth for broadcast channels with confidential messagesIgor Bjelakovic, Jafar Mohammadi, Slawomir Stanczak. 2809-2813 [doi]
- Achievable secrecy rates in the multiple access wiretap channel with deviating usersKarim A. Banawan, Sennur Ulukus. 2814-2818 [doi]
- Secure degrees of freedom of the Gaussian diamond-wiretap channelSi-Hyeon Lee, Wanyao Zhao, Ashish Khisti. 2819-2823 [doi]
- String concatenation construction for Chebyshev permutation channel codesYeow Meng Chee, Han Mao Kiah, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Xiande Zhang. 2824-2828 [doi]
- Limited-magnitude error-correcting Gray codes for rank modulationYonatan Yehezkeally, Moshe Schwartz. 2829-2833 [doi]
- Secure index coding: Existence and constructionLawrence Ong, Badri N. Vellambi, Phee Lep Yeoh, Jörg Kliewer, Jinhong Yuan. 2834-2838 [doi]
- New error correcting codes for informed receiversLakshmi Prasad Natarajan, Yi Hong, Emanuele Viterbo. 2839-2843 [doi]
- Exploiting variational formulas for quantum relative entropyMario Berta, Omar Fawzi, Marco Tomamichel. 2844-2848 [doi]
- Strong converse theorems using Rényi entropiesFelix Leditzky, Mark M. Wilde, Nilanjana Datta. 2849-2853 [doi]
- Multiple quantum hypothesis testing expressions and classical-quantum channel converse boundsGonzalo Vazquez-Vilar. 2854-2857 [doi]
- "Pretty strong" converse for the private capacity of degraded quantum wiretap channelsAndreas Winter. 2858-2862 [doi]
- Group testing schemes from low-weight codewords of BCH codesShashanka Ubaru, Arya Mazumdar, Alexander Barg. 2863-2867 [doi]
- Converse bounds for noisy group testing with arbitrary measurement matricesJonathan Scarlett, Volkan Cevher. 2868-2872 [doi]
- SAFFRON: A fast, efficient, and robust framework for group testing based on sparse-graph codesKangwook Lee, Ramtin Pedarsani, Kannan Ramchandran. 2873-2877 [doi]
- Strong divergence of the Shannon sampling series for an infinite dimensional signal spaceHolger Boche, Ullrich J. Mönich, Ezra Tampubolon. 2878-2882 [doi]
- Generalized turbo signal recovery for nonlinear measurements and orthogonal sensing matricesTing Liu, Chao-Kai Wen, Shi Jin, Xiaohu You. 2883-2887 [doi]
- Information Bottleneck Graphs for receiver designJan Lewandowsky, Maximilian Stark, Gerhard Bauch. 2888-2892 [doi]
- Asymptotic MAP upper bounds for LDPC codesDavid Matas, Meritxell Lamarca. 2893-2897 [doi]
- Low delay network streaming under burst lossesRafid Mahmood, Ahmed Badr, Ashish Khisti. 2898-2902 [doi]
- Delay-constrained capacity for broadcast erasure channels: A linear-coding-based studyChih-Chun Wang. 2903-2907 [doi]
- On coding capacity of delay-constrained network information flow: An algebraic approachMinghua Chen, Ye Tian, Chih-Chun Wang. 2908-2912 [doi]
- Affine-malleable extractors, spectrum doubling, and application to privacy amplificationDivesh Aggarwal, Kaave Hosseini, Shachar Lovett. 2913-2917 [doi]
- Key generation with limited interactionJingbo Liu, Paul W. Cuff, Sergio Verdú. 2918-2922 [doi]
- Binarizations in random number generationSung-il Pae. 2923-2927 [doi]
- On the entropy of Physically Unclonable FunctionsOlivier Rioul, Patrick Solé, Sylvain Guilley, Jean-Luc Danger. 2928-2932 [doi]
- An extended Tanner graph approach to decoding LDPC codes over decode-and-forward relay channelsBin Qian, Wai Ho Mow. 2933-2937 [doi]
- A blind matching algorithm for cognitive radio networksDoha Hamza, Jeff S. Shamma. 2938-2942 [doi]
- Channel coding for wireless communication via electromagnetic polarizationXiaobin Wu, Thomas E. Fuja, Thomas G. Pratt. 2943-2947 [doi]
- A systematic design approach for non-coherent Grassmannian constellationsKareem M. Attiah, Karim G. Seddik, Ramy H. Gohary, Halim Yanikomeroglu. 2948-2952 [doi]
- A single-shot approach to lossy source coding under logarithmic lossYanina Shkel, Sergio Verdú. 2953-2957 [doi]
- Variable-length lossy source coding allowing some probability of union of overflow and excess distortionRyo Nomura, Hideki Yagi. 2958-2962 [doi]
- Soft covering with high probabilityPaul Cuff. 2963-2967 [doi]
- Independent and memoryless sampling rate distortionVinay Praneeth Boda, Prakash Narayan. 2968-2972 [doi]
- On SDoF of multi-receiver wiretap channel with alternating CSITZohaib Hassan Awan, Abdellatif Zaidi, Aydin Sezgin. 2973-2977 [doi]
- Towards a constant-gap sum-capacity result for the Gaussian wiretap channel with a helperRick Fritschek, Gerhard Wunder. 2978-2982 [doi]
- The multiple access wiretap channel II with a noisy main channelMohamed S. Nafea, Aylin Yener. 2983-2987 [doi]
- Low complexity precoding for MIMOME wiretap channels based on cut-off rateSina Rezaei Aghdam, Tolga M. Duman. 2988-2992 [doi]
- Towards a complete DMT classification of division algebra codesLaura Luzzi, Roope Vehkalahti, Alexander Gorodnik. 2993-2997 [doi]
- On the throughput rate of wireless multipoint multicastingMichal Kaliszan, Giuseppe Caire, Slawomir Stanczak. 2998-3002 [doi]
- On the decoding delay of rate-1/2 complex orthogonal designsSmarajit Das. 3003-3007 [doi]
- Set min-sum decoding algorithm for non-binary LDPC codesLiyuan Song, Qin Huang, Zulin Wang. 3008-3012 [doi]
- Integrated parallel interleaved concatenation for lowering error floors of LDPC codesNaoaki Kokubun, Hironori Uchikawa. 3013-3017 [doi]
- Cutsize distributions of balanced hypergraph bipartitions for random hypergraphsTakayuki Nozaki. 3018-3022 [doi]
- Multiplicative repetition based superposition transmission of nonbinary codesXijin Mu, Baoming Bai, Rui Zhang. 3023-3027 [doi]
- Defect tolerance: Fundamental limits and examplesJennifer Tang, Da Wang, Yury Polyanskiy, Gregory W. Wornell. 3028-3032 [doi]
- Graph-based lossless Markov lumpingsBernhard C. Geiger, Christoph Hofer-Temmel. 3033-3037 [doi]
- Weight distribution of the syndrome of linear codes and connections to combinatorial designsChristoph Pacher, Philipp Grabenweger, Dimitris E. Simos. 3038-3042 [doi]
- Signature codes for the A-channel and collusion-secure multimedia fingerprinting codesElena Egorova, Marcel Fernandez, Grigory A. Kabatiansky, Moon Ho Lee. 3043-3047 [doi]
- Hierarchy of three-party consistency specificationsJulian Loss, Ueli Maurer, Daniel Tschudi. 3048-3052 [doi]
- Secure computation of randomized functionsDeepesh Data. 3053-3057 [doi]
- On the impossibility of information-theoretic composable coin toss extensionGregor Seiler, Ueli Maurer. 3058-3061 [doi]
- Joint source-channel coding with one-bit ADC front endMorteza Varasteh, Osvaldo Simeone, Deniz Gündüz. 3062-3066 [doi]
- Distance preserving maps and combinatorial joint source-channel coding for large alphabetsArya Mazumdar, Yury Polyanskiy, Ankit Singh Rawat, Hajir Roozbehani. 3067-3071 [doi]
- Streaming data transmission in the moderate deviations and central limit regimesSi-Hyeon Lee, Vincent Y. F. Tan, Ashish Khisti. 3072-3076 [doi]
- Super-activation as a unique feature of arbitrarily varying wiretap channelsRafael F. Schaefer, Holger Boche, H. Vincent Poor. 3077-3081 [doi]
- Almost universal codes for fading wiretap channelsLaura Luzzi, Cong Ling, Roope Vehkalahti. 3082-3086 [doi]
- Finite-blocklength bounds for wiretap channelsWei Yang, Rafael F. Schaefer, H. Vincent Poor. 3087-3091 [doi]