Abstract is missing.
- The list decoding error probability of linear codes over the erasure channelLinzi Shen, Fang-Wei Fu. 1-5 [doi]
- Some Gabidulin codes cannot be list decoded efficiently at any radiusNetanel Raviv, Antonia Wachter-Zeh. 6-10 [doi]
- List and probabilistic unique decoding of folded subspace codesHannes Bartz, Vladimir Sidorenko. 11-15 [doi]
- Improved burst error correction via list decoding quasi-cyclic codesAlexander Zeh, Ron M. Roth. 16-20 [doi]
- State-dependent multiple-access channels with partially cribbing encodersRitesh Kolte, Ayfer Özgür, Haim H. Permuter. 21-25 [doi]
- Cooperative multiple access channels with oblivious encodersTal Kopetz, Haim H. Permuter, Shlomo Shamai. 26-30 [doi]
- A common information-based multiple access protocol achieving full throughputYi Ouyang, Demosthenis Teneketzis. 31-35 [doi]
- On the cost and benefit of cooperationParham Noorzad, Michelle Effros, Michael Langberg. 36-40 [doi]
- Rate-compatible spatially-coupled LDPC code ensembles with nearly-regular degree distributionsWalter Nitzold, Gerhard P. Fettweis, Michael Lentmaier. 41-45 [doi]
- The multi-step PEG and ACE constrained PEG algorithms can design the LDPC codes with better cycle-connectivityXuan He, Liang Zhou, Junyi Du, Zhiping Shi. 46-50 [doi]
- Optimized array-based spatially-coupled LDPC Codes: An absorbing set approachBehzad Amiri, Amirhossein Reisizadeh, Jörg Kliewer, Lara Dolecek. 51-55 [doi]
- Spatially-coupled split-component codes with bounded-distance component decodingLei M. Zhang, Dmitri V. Truhachev, Frank R. Kschischang. 56-60 [doi]
- Anytime capacity of Markov channelsPaolo Minero, Massimo Franceschetti. 61-65 [doi]
- Learning immune-defectives graph through group testsAbhinav Ganesan, Sidharth Jaggi, Venkatesh Saligrama. 66-70 [doi]
- Blind identification of an unknown interleaved convolutional codeAudrey Tixier. 71-75 [doi]
- Delay limited transmission of a uniform source over an AWGN channelMorteza Varasteh, Deniz Gündüz, Ertem Tuncel. 76-80 [doi]
- Feasible regions of symmetric capacity and Gallager's E0 function for ternary-input discrete memoryless channelsYuta Sakai, Ken-ichi Iwata. 81-85 [doi]
- The likelihood decoder: Error exponents and mismatchJonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas. 86-90 [doi]
- Exact asymptotics for the random coding error probabilityJunya Honda. 91-95 [doi]
- Achievable rates and exponents for asynchronous communication with ML decodingSeçkin Anil Yildirim, Alfonso Martinez, Albert Guillen i Fabregas. 96-100 [doi]
- The secrecy capacity of MIMO Gaussian channels with finite memoryNir Shlezinger, Daniel Zahavi, Yonathan Murin, Ron Dabora. 101-105 [doi]
- The degraded Gaussian diamond-wiretap channelSi-Hyeon Lee, Ashish Khisti. 106-110 [doi]
- Secure signaling games for Gaussian multiple access wiretap channelsHao Ge, Ruijie Xu, Randall A. Berry. 111-115 [doi]
- Gaussian secure source coding and Wyner's Common InformationSanket Satpathy, Paul W. Cuff. 116-120 [doi]
- A geometric analysis of the AWGN channel with a (σ, ρ)-power constraintVarun Jog, Venkat Anantharam. 121-125 [doi]
- New capacity upper bounds and coding aspects for some channels with causal CSITWei Mao, Babak Hassibi. 126-130 [doi]
- Capacity of the energy harvesting channel with a finite batteryDor Shaviv, Phan-Minh Nguyen, Ayfer Özgür. 131-135 [doi]
- Capacity of the AWGN channel with random battery rechargesDor Shaviv, Ayfer Özgür. 136-140 [doi]
- Quickest change detection and Kullback-Leibler divergence for two-state hidden Markov modelsCheng-Der Fuh, Yajun Mei. 141-145 [doi]
- Non-parametric quickest change detection for large scale random matricesTaposh Banerjee, Hamed Firouzi, Alfred O. Hero. 146-150 [doi]
- High-dimensional change-point estimation: Combining filtering with convex optimizationYong Sheng Soh, Venkat Chandrasekaran. 151-155 [doi]
- Sequential detection of transient changes in stochastic systems under a sampling constraintEhsan Ebrahimzadeh, Aslan Tchamkerten. 156-160 [doi]
- On the improvement of scaling laws for wireless ad hoc networks with physical layer cachingAn Liu, Vincent K. N. Lau. 161-165 [doi]
- Optimized outage capacity in random wireless networks in uniform and fractal mapsPhilippe Jacquet. 166-170 [doi]
- On the broadcast capacity of large wireless networks at low SNRSerj Haddad, Olivier Lévêque. 171-175 [doi]
- Capacity scaling of relay networks with successive relayingYu Zhang, Zhaoyang Zhang, Li Ping, Xiaoming Chen, Caijun Zhong. 176-180 [doi]
- A robust Chinese Remainder Theorem with applications in error correction codingLi Xiao, Xiang-Gen Xia. 181-185 [doi]
- On involutions of finite fieldsPascale Charpin, Sihem Mesnager, Sumanta Sarkar. 186-190 [doi]
- On the volume of a metric ball in unitary groupLu Wei, Renaud-Alexandre Pitaval, Jukka Corander, Olav Tirkkonen. 191-195 [doi]
- Linear independence of rank 1 matrices and the dimension of *-products of codesHugues Randriambololona. 196-200 [doi]
- On the capacity of symmetric Gaussian interference channels with feedbackLan V. Truong, Hirosuke Yamamoto. 201-205 [doi]
- Partial capacity boundary of parallel Gaussian Z interference channelsXiaohu Shang. 206-210 [doi]
- Upper bounds on the sum capacity of the K-user Gaussian interference channelJunyoung Nam. 211-215 [doi]
- State-dependent Gaussian Z-interference channel: Capacity resultsRuchen Duan, Yingbin Liang, Shlomo Shamai. 216-220 [doi]
- Binary nonlinear kernels of maximum exponents of polar codes of dimensions up to sixteenHsien-Ping Lin, Shu Lin, Khaled A. S. Abdel-Ghaffar. 221-225 [doi]
- On the finite length scaling of ternary polar codesDina Goldin, David Burshtein. 226-230 [doi]
- Polar codes using dynamic kernelsMin Ye, Alexander Barg. 231-235 [doi]
- Efficient sphere decoding of polar codesJing Guo, Albert Guillen i Fabregas. 236-240 [doi]
- Combinatorial systematic switch codesYeow Meng Chee, Fei Gao, Samuel Tien Ho Teo, Hui Zhang 0004. 241-245 [doi]
- Semiconstrained systemsOhad Elishco, Tom Meyerovitch, Moshe Schwartz. 246-250 [doi]
- Symmetry-based subproduct codesThomas Mittelholzer, Thomas P. Parnell, Nikolaos Papandreou, Haralampos Pozidis. 251-255 [doi]
- High-rate codes for high-reliability data transmissionIgor Zhilin, Pavel Rybin, Victor V. Zyablov. 256-260 [doi]
- Converse and duality results for combinatorial source-channel coding in binary Hamming spacesAndrew J. Young, Yury Polyanskiy. 261-265 [doi]
- Slepian-wolf coding for broadcasting with cooperative base-stationsRoy Timo, Michele A. Wigger. 266-270 [doi]
- On adversarial joint source channel codingArya Mazumdar, Ankit Singh Rawat. 271-275 [doi]
- Joint source-channel coding with feedbackVictoria Kostina, Yury Polyanskiy, Sergio Verdú. 276-280 [doi]
- Equivocations and exponents under various Rényi information measuresMasahito Hayashi, Vincent Yan Fu Tan. 281-285 [doi]
- The private key capacity of a cooperative pairwise-independent networkPeng Xu, Zhiguo Ding, Xuchu Dai. 286-290 [doi]
- Secret key capacity: Talk or keep silent?Huishuai Zhang, Yingbin Liang, Lifeng Lai. 291-295 [doi]
- The communication complexity of achieving SK capacity in a class of PIN modelsManuj Mukherjee, Navin Kashyap. 296-300 [doi]
- One-shot achievability via fidelityMohammad Hossein Yassaee. 301-305 [doi]
- Information spectrum approach to fixed-length lossy source coding problem with some excess distortion probabilityRyo Nomura, Hideki Yagi. 306-310 [doi]
- Asymptotic expansions for the AWGN channel with feedback under a peak power constraintSilas L. Fong, Vincent Y. F. Tan. 311-315 [doi]
- Performance analysis and optimal filter design for sigma-delta modulation via duality with DPCMOr Ordentlich, Uri Erez. 321-325 [doi]
- Deconvolution of weakly-sparse signals and dynamical-system identification by Gaussian message passingLukas Bruderer, Hampus Malmberg, Hans-Andrea Loeliger. 326-330 [doi]
- The metrication of LPI radar waveforms based on the asymptotic spectral distribution of wigner matricesJun Chen, Fei Wang, Jianjiang Zhou. 331-335 [doi]
- Beyond semidefinite relaxation: Basis banks and computationally enhanced guaranteesMojtaba Soltanalian, Babak Hassibi. 336-340 [doi]
- On the distribution of the squared norm of non-circular complex Gaussian random variables with applicationsJuan Manuel Romero Jerez, F. Javier López-Martínez. 341-345 [doi]
- A unified simulation approach for the fast outage capacity evaluation over generalized fading channelsNadhir Ben Rached, Abla Kammoun, Mohamed-Slim Alouini, Raúl Tempone. 346-350 [doi]
- Causal-CSIT rate adaptation for block-fading channelsKhoa D. Nguyen, Roy Timo, Lars K. Rasmussen. 351-355 [doi]
- A unified view on nearest-neighbor decoding rates for noncoherent and semicoherent fading channelsAdriano Pastore, Michael Gastpar. 356-360 [doi]
- Connecting multiple-unicast and network error correction: Reduction and unachievabilityWentao Huang, Michael Langberg, Jörg Kliewer. 361-365 [doi]
- On network coding advantage for multiple unicast networksKai Cai, Guangyue Han. 366-370 [doi]
- On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal propertyMing Fai Wong, Michelle Effros, Michael Langberg. 371-375 [doi]
- Symmetry in network codingJayant Apte, John MacLaren Walsh. 376-380 [doi]
- On approximating the sum-rate for multiple-unicastsKarthikeyan Shanmugam, Megasthenis Asteris, Alexandros G. Dimakis. 381-385 [doi]
- A unified scheme for two-receiver broadcast channels with receiver message side informationBehzad Asadi, Lawrence Ong, Sarah J. Johnson. 386-390 [doi]
- On MMSE properties of "good" and "bad" codes for the Gaussian broadcast channelRonit Bustin, Rafael F. Schaefer, H. Vincent Poor, Shlomo Shamai. 391-395 [doi]
- Multicasting messages over Gaussian broadcast channels with receiver message side informationJin Sima, Wei Chen. 396-400 [doi]
- A general outer bound for MISO broadcast channel with heterogeneous CSITSina Lashgari, Ravi Tandon, Amir Salman Avestimehr. 401-405 [doi]
- Capacity regions of two-user broadcast erasure channels with feedback and hidden memoryMichael Heindlmaier, Shirin Saeedi Bidokhti. 406-410 [doi]
- Impact of redundant checks on the LP decoding thresholds of LDPC codesLouay Bazzi, Hani Audah. 411-415 [doi]
- Improved message-passing algorithm for counting short cycles in bipartite graphsJuane Li, Shu Lin, Khaled A. S. Abdel-Ghaffar. 416-420 [doi]
- Approximating decoding thresholds of punctured LDPC code ensembles on the AWGN channelDavid G. M. Mitchell, Michael Lentmaier, Ali Emre Pusane, Daniel J. Costello Jr.. 421-425 [doi]
- Decoding LDPC codes with mutual information-maximizing lookup tablesFrancisco Javier Cuadros Romero, Brian M. Kurkoski. 426-430 [doi]
- On the girth of (3, L) quasi-cyclic LDPC codes based on complete protographsSudarsan V. S. Ranganathan, Dariush Divsalar, Richard D. Wesel. 431-435 [doi]
- Number field lattices achieve Gaussian and Rayleigh channel capacity within a constant gapRoope Vehkalahti, Laura Luzzi. 436-440 [doi]
- Achieving the ergodic capacity with lattice codesAhmed Hindy, Aria Nosratinia. 441-445 [doi]
- Division algebra codes achieve MIMO block fading channel capacity within a constant gapLaura Luzzi, Roope Vehkalahti. 446-450 [doi]
- A modified KZ reduction algorithmJinming Wen, Xiao-Wen Chang. 451-455 [doi]
- A Poltyrev outage limit for latticesMayur Punekar, Joseph Jean Boutros, Ezio Biglieri. 456-460 [doi]
- Necessary condition for sending a bivariate Gaussian source over the "asymmetric" Gaussian MACShraga I. Bross, Yaron Laufer. 461-465 [doi]
- Empirical coordination with two-sided state information and correlated source and stateMaël Le Treust. 466-470 [doi]
- Empirical coordination with channel feedback and strictly causal or causal encodingMaël Le Treust. 471-475 [doi]
- Matched multiuser Gaussian source-channel communications via uncoded schemesChao Tian, Jun Chen, Suhas N. Diggavi, Shlomo Shamai. 476-480 [doi]
- On the asymptotic distortion-energy tradeoff for zero-delay transmission of a Gaussian source over the AWGN channelErman Koken, Ertem Tuncel, Deniz Gündüz. 481-485 [doi]
- Construction of cubic rotation symmetric bent functions in power-of-two variablesTianZe Wang, Meicheng Liu, Shangwei Zhao, Dongdai Lin. 486-490 [doi]
- Constructing Boolean functions with (potentially) optimal algebraic immunity based on multiplicative decompositions of finite fieldsBaofeng Wu, Jia Zheng, Dongdai Lin. 491-495 [doi]
- Searching cubes for testing Boolean functions and its application to TriviumMeicheng Liu, Dongdai Lin, Wenhao Wang. 496-500 [doi]
- Restrictions of nondegenerate Boolean functions and degree lower bounds over different ringsChia-Jung Lee, Satyanarayana V. Lokam, Shi-Chun Tsai, Ming-Chuan Yang. 501-505 [doi]
- On the dual of generalized Boolean bent functions over ℤ4Baofeng Wu, Dongdai Lin. 506-510 [doi]
- Asynchronous capacity per unit cost under a receiver sampling constraintVenkat Chandar, Aslan Tchamkerten. 511-515 [doi]
- A general formula for compound channel capacitySergey Loyka, Charalambos D. Charalambous. 516-520 [doi]
- Nonanticipative transmission for sources and channels with memoryChristos K. Kourtellaris, Charalambos D. Charalambous, Joseph J. Boutros. 521-525 [doi]
- On mismatched list decodingAnelia Somekh-Baruch. 526-530 [doi]
- Multi-letter converse bounds for the mismatched discrete memoryless channel with an additive metricAnelia Somekh-Baruch. 531-535 [doi]
- Subspace thresholding pursuit: A reconstruction algorithm for compressed sensingChao-Bing Song, Shu-Tao Xia, Xin-Ji Liu. 536-540 [doi]
- On joint recovery of sparse signals with common supportsXiaochen Zhao, Wei Dai. 541-545 [doi]
- On recovery of sparse signals with block structuresPan Li, Wei Dai, Huadong Meng, Xiqin Wang. 546-550 [doi]
- Sparse group covers and greedy tree approximationsSiddhartha Satpathi, Luca Baldassarre, Volkan Cevher. 551-555 [doi]
- Isotropically random orthogonal matrices: Performance of LASSO and minimum conic singular valuesChristos Thrampoulidis, Babak Hassibi. 556-560 [doi]
- Compute-compress-and-forwardYihua Tan, Xiaojun Yuan. 561-565 [doi]
- Adaptive compute-and-forward with lattice codes over algebraic integersYu-Chih Huang, Krishna R. Narayanan, Ping-Chung Wang. 566-570 [doi]
- Slotted ALOHA with compute-and-forwardShwan Ashrafi, Chen Feng, Sumit Roy, Frank R. Kschischang. 571-575 [doi]
- The impact of channel variation on integer-forcing receiversIslam El Bakoury, Bobak Nazer. 576-580 [doi]
- Integer-forcing interference alignment: Iterative optimization via aligned lattice reductionIslam El Bakoury, Wenbo He, Bobak Nazer. 581-585 [doi]
- Subspace polynomials and cyclic subspace codesEli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv. 586-590 [doi]
- On the bounds of certain maximal linear codes in a projective spaceSrikanth B. Pai, B. Sundar Rajan. 591-595 [doi]
- Capacity of coded index modulationLakshmi Natarajan, Yi Hong, Emanuele Viterbo. 596-600 [doi]
- Hermitian codes in distributed storage systems with optimal error-correcting capacityBin Wang, Haibin Kan, Kenneth W. Shum. 601-605 [doi]
- Capacity of sum-networks for different message alphabetsArdhendu Tripathy, Aditya Ramamoorthy. 606-610 [doi]
- On the sum capacity of the Gaussian x channel in the mixed interference regimePraneeth Kumar V., Srikrishna Bhashyam. 611-615 [doi]
- Secrecy degrees of freedom of wireless X networks using artificial noise alignmentZhao Wang, Ming Xiao, Mikael Skoglund, H. Vincent Poor. 616-620 [doi]
- Interference aligned space-time transmission with diversity for the 2 × 2 X-NetworkAbhinav Ganesan, Koteshwar Pavan Srinath. 621-625 [doi]
- Achieving the DoF limits of the SISO X channel with imperfect-quality CSITJingjing Zhang, Dirk T. M. Slock, Petros Elia. 626-630 [doi]
- Rover-to-orbiter communication in Mars: Taking advantage of the varying topologySongze Li, David T.-H. Kao, Amir Salman Avestimehr. 631-635 [doi]
- Optimal binary switch codes with small query sizeZhiying Wang, Han Mao Kiah, Yuval Cassuto. 636-640 [doi]
- Explicit capacity achieving codes for defective memoriesHessam Mahdavifar, Alexander Vardy. 641-645 [doi]
- Rewriting flash memories by message passingEyal En Gad, Wentao Huang, Yue Li, Jehoshua Bruck. 646-650 [doi]
- Write process modeling in MLC flash memories using renewal theoryMeysam Asadi, Erich F. Haratsch, Aleksandar Kavcic, Narayana P. Santhanam. 651-655 [doi]
- Algorithms and throughput analysis for MDS-coded switchesRami Cohen, Yuval Cassuto. 656-660 [doi]
- A spectrum decomposition to the feature spaces and the application to big data analyticsShao-Lun Huang, Lizhong Zheng. 661-665 [doi]
- Atypical information theory for real-valued dataAnders Høst-Madsen, Elyas Sabeti. 666-670 [doi]
- Online denoising of discrete noisy dataPejman Khadivi, Ravi Tandon, Naren Ramakrishnan. 671-675 [doi]
- A scalable framework to transform samples from one continuous distribution to anotherDiego Mesa, Sanggyun Kim, Todd P. Coleman. 676-680 [doi]
- Efficient total probability prediction via convex optimization and optimal transportSanggyun Kim, Diego Mesa, Todd P. Coleman. 681-685 [doi]
- Security proof of a semi-quantum key distribution protocolWalter O. Krawec. 686-690 [doi]
- Tight asymptotic bounds on local hypothesis testing between a pure bipartite state and the white noise stateMasahito Hayashi, Masaki Owari. 691-695 [doi]
- Key rate of the B92 quantum key distribution protocol with finite qubitsHiroaki Sasaki, Ryutaroh Matsumoto, Tomohiko Uyematsu. 696-699 [doi]
- Markovianizing cost of tripartite quantum statesEyuri Wakakuwa, Akihito Soeda, Mio Murao. 700-704 [doi]
- A coding theorem for bipartite unitaries in distributed quantum computationEyuri Wakakuwa, Akihito Soeda, Mio Murao. 705-709 [doi]
- Secret key generation with one communicator and a one-shot converse via hypercontractivityJingbo Liu, Paul W. Cuff, Sergio Verdú. 710-714 [doi]
- Two-key generation for a cellular model with a helperHuishuai Zhang, Yingbin Liang, Lifeng Lai, Shlomo Shamai. 715-719 [doi]
- On the simulatability condition in key generation over a non-authenticated public channelWenwen Tu, Lifeng Lai. 720-724 [doi]
- Constructions of symmetric-key encryption with guessing secrecyMitsugu Iwamoto, Junji Shikata. 725-729 [doi]
- An information reconciliation protocol for secret-key agreement with small leakageChristoph Pacher, Philipp Grabenweger, Jesús Martínez-Mateo, Vicente Martin. 730-734 [doi]
- Information-theoretic applications of the logarithmic probability comparison boundRami Atar, Neri Merhav. 735-739 [doi]
- Lattices with non-Shannon inequalitiesPeter Harremoës. 740-744 [doi]
- Convexity/concavity of renyi entropy and α-mutual informationSiu-Wai Ho, Sergio Verdú. 745-749 [doi]
- The norm of the Fourier series operatorPeng Xu, Mokshay M. Madiman. 750-754 [doi]
- Resolvability in Eγ with applications to lossy compression and wiretap channelsJingbo Liu, Paul W. Cuff, Sergio Verdú. 755-759 [doi]
- Mismatched estimation in large linear systemsYanting Ma, Dror Baron, Ahmad Beirami. 760-764 [doi]
- Quickest linear search over correlated sequencesJavad Heydari, Ali Tajer. 765-769 [doi]
- Universal quickest outlier detection and isolationSirin Nitinawarat, Venugopal V. Veeravalli. 770-774 [doi]
- NON-adaptive policies for 20 questions target localizationEhsan Variani, Kamel Lahouel, Avner Bar-Hen, Bruno Jedynak. 775-778 [doi]
- Strong large deviations for Rao test score and GLRT in exponential familiesPierre Moulin, Patrick R. Johnstone. 779-783 [doi]
- HARQ buffer management: An information-theoretic viewWonju Lee, Osvaldo Simeone, Joonhyuk Kang, Sundeep Rangan, Petar Popovski. 784-788 [doi]
- Capacity limit of queueing timing channel in shared FCFS schedulersAmirEmad Ghassami, Xun Gong, Negar Kiyavash. 789-793 [doi]
- Queueing stability and CSI probing of a TDD wireless network with interference alignmentMatha Deghel, Mohamad Assaad, Mérouane Debbah. 794-798 [doi]
- Energy efficiency in multiple-antenna channels with markov arrivals and queueing constraintsMustafa Ozmen, Mustafa Cenk Gursoy. 799-803 [doi]
- Delay-constrained unicast and the triangle-cast problemChandra Chekuri, Sudeep Kamath, Sreeram Kannan, Pramod Viswanath. 804-808 [doi]
- Cache-aided interference channelsMohammad Ali Maddah-Ali, Urs Niesen. 809-813 [doi]
- Codes for DNA sequence profilesHan Mao Kiah, Gregory J. Puleo, Olgica Milenkovic. 814-818 [doi]
- In-memory hamming similarity computation in resistive arraysYuval Cassuto, Koby Crammer. 819-823 [doi]
- Optimal entropy estimation on large alphabets via best polynomial approximationYihong Wu, Pengkun Yang. 824-828 [doi]
- On the geometry of convex typical setsVarun Jog, Venkat Anantharam. 829-833 [doi]
- Superposition coding is almost always optimal for the Poisson broadcast channelHyeji Kim, Benjamin Nachman, Abbas El Gamal. 834-838 [doi]
- Maximum Likelihood Estimation of information measuresJiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman. 839-843 [doi]
- Multilevel diversity coding with regenerationChao Tian, Tie Liu. 844-848 [doi]
- When locally repairable codes meet regenerating codes - What if some helpers are unavailableImad Ahmad, Chih-Chun Wang. 849-853 [doi]
- Overhead-free in-place recovery and repair schemes of XOR-based regenerating codesXiming Fu, Zhiqing Xiao, Shenghao Yang. 854-858 [doi]
- The storage-repair-bandwidth trade-off of exact repair linear regenerating codes for the case d = k = n - 1N. Prakash, M. Nikhil Krishnan. 859-863 [doi]
- On degrees-of-freedom of multi-user MIMO full-duplex networkJingwen Bai, Suhas N. Diggavi, Ashutosh Sabharwal. 864-868 [doi]
- Degrees of freedom of full-duplex multiantenna cellular networksSang-Woon Jeon, Sung Ho Chae, Sung-Hoon Lim. 869-873 [doi]
- Cooperation alignment for distributed interference managementVasilis Ntranos, Mohammad Ali Maddah-Ali, Giuseppe Caire. 874-878 [doi]
- The degrees of freedom region of the 3-User MIMO cyclic Z-interference channel with perfect and delayed CSITKaniska Mohanty, Mahesh K. Varanasi. 879-883 [doi]
- On the minimum distance of array-based spatially-coupled low-density parity-check codesEirik Rosnes. 884-888 [doi]
- Finite-length performance of multi-edge protograph-based spatially coupled LDPC codesMarkus Stinner, Pablo M. Olmos. 889-893 [doi]
- EXIT chart analysis of block markov superposition transmission of short codesKechao Huang, Xiao Ma, Daniel J. Costello Jr.. 894-898 [doi]
- Spatially-coupled MacKay-Neal codes universally achieve the symmetric information rate of arbitrary generalized erasure channels with memoryMasaru Fukushima, Takuya Okazaki, Kenta Kasai. 899-903 [doi]
- A stochastic model for genomic interspersed duplicationFarzad Farnoud, Moshe Schwartz, Jehoshua Bruck. 904-908 [doi]
- Asymmetric Lee distance codes for DNA-based storageRyan Gabrys, Han Mao Kiah, Olgica Milenkovic. 909-913 [doi]
- Optimal haplotype assembly from high-throughput mate-pair readsGovinda M. Kamath, Eren Sasoglu, David N. C. Tse. 914-918 [doi]
- Do read errors matter for genome assembly?Ilan Shomorony, Thomas A. Courtade, David N. C. Tse. 919-923 [doi]
- A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channelsYasutada Oohama, Yutaka Jitsumatsu. 924-928 [doi]
- A derivation of the cost-constrained sphere-packing exponentGonzalo Vazquez-Vilar, Alfonso Martinez, Albert Guillen i Fabregas. 929-933 [doi]
- On error exponents for a dimension-matched vector MAC with additive noiseVenkat Anantharam, François Baccelli. 934-938 [doi]
- Strong converse exponent for degraded broadcast channels at rates outside the capacity regionYasutada Oohama. 939-943 [doi]
- Capacity of the deterministic z-interference channel with unidirectional transmitter cooperation and secrecy constraintsParthajit Mohapatra, Chandra R. Murthy. 944-948 [doi]
- Common randomness for secure computingPrakash Narayan, Himanshu Tyagi, Shun Watanabe. 949-953 [doi]
- LP formulations for secrecy over erasure networks with feedbackAthanasios Papadopoulos, László Czap, Christina Fragouli. 954-958 [doi]
- Parity Check based redistribution of secret sharesYvo Desmedt, Kirill Morozov. 959-963 [doi]
- Bits of Kolmogorov and Shannon in a deterministic settingTaehyung J. Lim, Massimo Franceschetti. 964-968 [doi]
- Searching for multiple targets with measurement dependent noiseYonatan Kaspi, Ofer Shayevitz, Tara Javidi. 969-973 [doi]
- A marginal characterization of entropy functions for conditional mutually independent random variables (with application to Wyner's common information)Qi Chen, Fan Cheng, Tie Liu, Raymond W. Yeung. 974-978 [doi]
- Coordination in state-dependent distributed networks: The two-agent caseBenjamin Larrousse, Samson Lasaulce, Michele A. Wigger. 979-983 [doi]
- Super-resolution of mutually interfering signalsYuanxin Li, Yuejie Chi. 984-988 [doi]
- Capacity-approaching PhaseCode for low-complexity compressive phase retrievalRamtin Pedarsani, Kangwook Lee, Kannan Ramchandran. 989-993 [doi]
- Classification and reconstruction of compressed GMM signals with side informationFrancesco Renna, Liming Wang, Xin Yuan, Jianbo Yang, Galen Reeves, A. Robert Calderbank, Lawrence Carin, Miguel R. D. Rodrigues. 994-998 [doi]
- Almost lossless analog compression without phase informationErwin Riegler, Georg Tauböck. 999-1003 [doi]
- Joint transmission and caching policy design for energy minimization in the wireless backhaul linkMaria Gregori, Jesús Gómez-Vilardebó, Javier Matamoros, Deniz Gündüz. 1004-1008 [doi]
- SIR asymptotics in general cellular network modelsRadha Krishna Ganti, Martin Haenggi. 1009-1013 [doi]
- On the cooperation gain in 5g heterogeneous networking systemsZhengchuan Chen, Pingyi Fan, Tao Li, Khaled Ben Letaief. 1014-1018 [doi]
- Opportunistic scheduling for full-duplex uplink-downlink networksCan Karakus, Suhas N. Diggavi. 1019-1023 [doi]
- A new index coding scheme exploiting interlinked cyclesChandra Thapa, Lawrence Ong, Sarah J. Johnson. 1024-1028 [doi]
- Error correcting index codes and matroidsAnoop Thomas, B. Sundar Rajan. 1029-1033 [doi]
- Structural properties of index coding capacity using fractional graph theoryFatemeh Arbabjolfaei, Young Han Kim. 1034-1038 [doi]
- Vector linear error correcting index codes and discrete polymatroidsAnoop Thomas, B. Sundar Rajan. 1039-1043 [doi]
- On the number of optimal index codesR. Kavitha, B. Sundar Rajan. 1044-1048 [doi]
- On the DoF of two-user interference channel with an instantaneous relayTang Liu, Daniela Tuninetti, Sae-Young Chung. 1049-1053 [doi]
- On the separability of GDoF region for parallel Gaussian TIN optimal interference networksHua Sun, Syed Ali Jafar. 1054-1058 [doi]
- A relay can increase degrees of freedom in bursty mimo interference networksSunghyun Kim, I-Hsiang Wang, Changho Suh. 1059-1063 [doi]
- Degrees of freedom region of the MIMO two-transmit, two-receive network with General message setsYao Wang, Mahesh K. Varanasi. 1064-1068 [doi]
- Degrees of freedom of the MIMO interference channel with parallel multicastingJinyuan Chen, Andrea Goldsmith, Ayfer Özgür, Sheng Yang. 1069-1073 [doi]
- LDPC code ensembles that universally achieve capacity under BP decoding: A simple derivationAnatoly Khina, Yair Yona, Uri Erez. 1074-1078 [doi]
- A PEG-like LDPC code design avoiding short trapping setsMadiagne Diouf, David Declercq, Samuel Ouya, Bane V. Vasic. 1079-1083 [doi]
- LDPC code design for binary-input binary-output Z interference channelsShahrouz Sharifi, Ahmet Korhan Tanc, Tolga Mete Duman. 1084-1088 [doi]
- Protograph-based LDPC code design for bit-metric decodingFabian Steiner, Georg Böcherer, Gianluigi Liva. 1089-1093 [doi]
- Nonbinary Kite codes: A family of nonbinary rate-compatible LDPC codesMin Zhu, Yun Wei, Baoming Bai, Xiao Ma. 1094-1098 [doi]
- Holographic transformation, belief propagation and loop calculus for generalized probabilistic theoriesRyuhei Mori. 1099-1103 [doi]
- Quantum MDS codes over small fieldsMarkus Grassl, Martin Rötteler. 1104-1108 [doi]
- Equivalence of 2D color codes (without translational symmetry) to surface codesArjun Bhagoji, Pradeep Sarvepalli. 1109-1113 [doi]
- Global stabilizer quantum error correction with combinatorial arraysYuichiro Fujiwara. 1114-1118 [doi]
- Leakage suppression in the toric codeMartin Suchara, Andrew W. Cross, Jay M. Gambetta. 1119-1123 [doi]
- Real-time simultaneous energy and information transferAnshoo Tandon, Mehul Motani, Lav R. Varshney. 1124-1128 [doi]
- Optimal scheduling for energy harvesting transmitters under temperature constraintsOmur Ozel, Sennur Ulukus, Pulkit Grover. 1129-1133 [doi]
- Optimum sensing of a time-varying random event with energy harvesting power sourcesJingxian Wu, Israel Akingeneye, Jing Yang. 1134-1138 [doi]
- Distributed compression and transmission with energy harvesting sensorsRajeev Gangula, Deniz Gündüz, David Gesbert. 1139-1143 [doi]
- Hybrid ARQ in block-fading channels with an energy harvesting receiverHajar Mahdavi-Doost, Roy D. Yates. 1144-1148 [doi]
- Gaussian wiretap channel with shared keys between transmitter and helpersWanyao Zhao, Ashish Khisti. 1149-1153 [doi]
- On the capacity of the wiretap channel with generalized feedbackGermán Bassi, Pablo Piantanida, Shlomo Shamai. 1154-1158 [doi]
- Wiretap channel II with a noisy main channelMohamed S. Nafea, Aylin Yener. 1159-1163 [doi]
- Sufficiently myopic adversaries are blindBikash Kumar Dey, Sidharth Jaggi, Michael Langberg. 1164-1168 [doi]
- On the oblivious transfer capacity of the degraded wiretapped binary erasure channelManoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran, Suhas N. Diggavi. 1169-1173 [doi]
- On model misspecification and KL separation for Gaussian graphical modelsVarun Jog, Po-Ling Loh. 1174-1178 [doi]
- An importance sampling scheme for models in a strong external fieldMehdi Molkaraie. 1179-1183 [doi]
- Spectral detection in the censored block modelAlaa Saade, Marc Lelarge, Florent Krzakala, Lenka Zdeborová. 1184-1188 [doi]
- Contamination estimation via convex relaxationsMatthew L. Malloy, Scott Alfeld, Paul Barford. 1189-1193 [doi]
- The replacement bootstrap for dependent dataAmir Sani, Alessandro Lazaric, Daniil Ryabko. 1194-1198 [doi]
- Predicting the outcomes of every process for which an asymptotically accurate stationary predictor exists is impossibleDaniil Ryabko, Boris Ryabko. 1204-1206 [doi]
- Nonparametric nearest neighbor random process clusteringMichael Tschannen, Helmut Bölcskei. 1207-1211 [doi]
- Deep convolutional neural networks based on semi-discrete framesThomas Wiatowski, Helmut Bölcskei. 1212-1216 [doi]
- Determining step sizes in geometric optimization algorithmsZhizhong Li, Deli Zhao, Zhouchen Lin, Edward Y. Chang. 1217-1221 [doi]
- Effect of channel aging on the sum rate of uplink massive MIMO systemsChuili Kong, Caijun Zhong, Anastasios K. Papazafeiropoulos, Michail Matthaiou, Zhaoyang Zhang 0001. 1222-1226 [doi]
- Optimality of large MIMO detection via approximate message passingCharles Jeon, Ramina Ghods, Arian Maleki, Christoph Studer. 1227-1231 [doi]
- Does superdirectivity increase the degrees of freedom in wireless channels?Ada S. Y. Poon, David N. C. Tse. 1232-1236 [doi]
- Joint cHANNEL-AND-dATA estimation for large-MIMO systems with low-precision ADCsChao-Kai Wen, Shi Jin, Kai-Kit Wong, Chang-Jen Wang, Gang Wu. 1237-1241 [doi]
- Interleaving training and limited feedback for point-to-point massive multiple-antenna systemsErdem Koyuncu, Hamid Jafarkhani. 1242-1246 [doi]
- Optimal binary locally repairable codes via anticodesNatalia Silberstein, Alexander Zeh. 1247-1251 [doi]
- Locally recoverable codes on algebraic curvesAlexander Barg, Itzhak Tamo, Serge G. Vladut. 1252-1256 [doi]
- Codes with hierarchical localityBirenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar. 1257-1261 [doi]
- Cyclic LRC codes and their subfield subcodesItzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank. 1262-1266 [doi]
- Gaussian MIMO half-duplex relay networks: Approximate optimality of simple schedulesMartina Cardone, Daniela Tuninetti, Raymond Knopp. 1267-1271 [doi]
- On the optimality of Colour-and-Forward relaying for a class of zero-error primitive relay channelsYanying Chen, Natasha Devroye. 1272-1276 [doi]
- A unified approach for network information theorySi-Hyeon Lee, Sae-Young Chung. 1277-1281 [doi]
- Upper bounds on the capacity of symmetric primitive relay channelsXiugang Wu, Liang-Liang Xie, Ayfer Özgür. 1282-1286 [doi]
- Cyclic polar codesNarayanan Rengaswamy, Henry D. Pfister. 1287-1291 [doi]
- RCA analysis of the polar codes and the use of feedback to aid polarization at short blocklengthsKasra Vakilinia, Dariush Divsalar, Richard D. Wesel. 1292-1296 [doi]
- On the construction of polar codes for channels with moderate input alphabet sizesIdo Tal. 1297-1301 [doi]
- Coding with constraints: Minimum distance bounds and systematic constructionsWael Halbawi, Matthew Thill, Babak Hassibi. 1302-1306 [doi]
- Subgraph domatic problem and writing capacity of memory devices with restricted state transitionsTadashi Wadayama, Taisuke Izumi, Hirotaka Ono. 1307-1311 [doi]
- On rate tradeoffs for erasable write-once memory codesTetsuya Kobayashi, Hiroyoshi Morita, Akiko Manada. 1312-1316 [doi]
- Zero-error capacity of binary channels with 1-memoryQi Cao, Ning Cai, Wangmei Guo. 1317-1321 [doi]
- Pulse-domain signal parsing and neural computationHans-Andrea Loeliger, Sarah Neff. 1322-1326 [doi]
- Capacity of bacterial cables via Electron-transfer under full-CSINicolò Michelusi, Urbashi Mitra. 1327-1331 [doi]
- Rate-distortion in molecular signal sensing with ligand receptorsArash Einolghozati, Faramarz Fekri. 1332-1336 [doi]
- Minimum squared-error, energy-constrained encoding by adaptive threshold models of neuronsErik C. Johnson, Douglas L. Jones, Rama Ratnam. 1337-1341 [doi]
- Cooperative broadcast channels with a secret messageZiv Goldfeld, Gerhard Kramer, Haim H. Permuter. 1342-1346 [doi]
- On the individual secrecy rate region for the broadcast channel with an external eavesdropperYanling Chen, Onur Ozan Koyluoglu, Aydin Sezgin. 1347-1351 [doi]
- Private data transfer over a broadcast channelManoj Mishra, Tanmay Sharma, Bikash Kumar Dey, Vinod M. Prabhakaran. 1352-1356 [doi]
- Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded rangeShaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai. 1357-1361 [doi]
- Bounds on the entropy of multinomial distributionYuichi Kaji. 1362-1366 [doi]
- Does dirichlet prior smoothing solve the Shannon entropy estimation problem?Yanjun Han, Jiantao Jiao, Tsachy Weissman. 1367-1371 [doi]
- Adaptive estimation of Shannon entropyYanjun Han, Jiantao Jiao, Tsachy Weissman. 1372-1376 [doi]
- Minimum HGR correlation principle: From marginals to joint distributionFarzan Farnia, Meisam Razaviyayn, Sreeram Kannan, David Tse. 1377-1381 [doi]
- Optimality of Walrand-Varaiya type policies and approximation results for zero delay coding of Markov sourcesRichard G. Wood, Tamás Linder, Serdar Yüksel. 1382-1386 [doi]
- Distortion-transmission trade-off in real-time transmission of Gauss-Markov sourcesJhelum Chakravorty, Aditya Mahajan. 1387-1391 [doi]
- Price of perfection: Limited prediction for streaming over erasure channelsFarrokh Etezadi, Ashish Khisti, Jun Chen. 1392-1396 [doi]
- Delay-constrained streaming of Gauss-Markov sources over erasure channelsFarrokh Etezadi, Ashish Khisti. 1397-1401 [doi]
- Scheduling over time varying channels with hidden state informationMatthew Johnston, Eytan Modiano. 1402-1406 [doi]
- A new look at wireless scheduling with delayed informationMatthew Johnston, Eytan Modiano. 1407-1411 [doi]
- Optimal dynamic multicast scheduling for cache-enabled content-centric wireless networksBo Zhou, Ying Cui, Meixia Tao. 1412-1416 [doi]
- Collision scheduling for cellular networksWenbo He, Chen Feng, Corina I. Ionita, Bobak Nazer. 1417-1421 [doi]
- Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floorsMarco Mondelli, Rüdiger L. Urbanke, Seyed Hamed Hassani. 1422-1426 [doi]
- Fourier analysis of MAC polarizationRajai Nasser, Emre Telatar. 1427-1431 [doi]
- Perfectly secure index codingMohammad Mahdi Mojahedian, Amin Gohari, Mohammad Reza Aref. 1432-1436 [doi]
- Scaling Rules for the Energy of Decoder CircuitsChristopher G. Blake, Frank R. Kschischang. 1437-1441 [doi]
- Achieving exact cluster recovery threshold via semidefinite programmingBruce Hajek, Yihong Wu, Jiaming Xu. 1442-1446 [doi]
- Correlation detection and an operational interpretation of the Rényi mutual informationMasahito Hayashi, Marco Tomamichel. 1447-1451 [doi]
- On a partition of a finite set and its relationships to encoding tasks and the Rényi entropyHiroki Koga. 1452-1456 [doi]
- One-shot mutual covering lemma and Marton's inner bound with a common messageJingbo Liu, Paul Cuff, Sergio Verdú. 1457-1461 [doi]
- Distributed storage systems based on intersecting subspace codesNetanel Raviv, Tuvi Etzion. 1462-1466 [doi]
- Analyzing the download time of availability codesSwanand Kadhe, Emina Soljanin, Alex Sprintson. 1467-1471 [doi]
- Synchronizing edits in distributed storage networksSalim El Rouayheb, Sreechakra Goparaju, Han Mao Kiah, Olgica Milenkovic. 1472-1476 [doi]
- Batch codes through dense graphs without short cyclesAnkit Singh Rawat, Zhao Song, Alexandros G. Dimakis, Anna Gál. 1477-1481 [doi]
- On adaptive distributed storage systemsBrijesh Kumar Rai, Vommi Dhoorjati, Lokesh Saini, Amit K. Jha. 1482-1486 [doi]
- On the scaling of interference alignment under delay and power constraintsSubhashini Krishnasamy, Urs Niesen, Piyush Gupta. 1487-1491 [doi]
- Retrospective Interference Alignment for the MIMO interference broadcast channelMarc Torrellas, Adrian Agustin, Josep Vidal. 1492-1496 [doi]
- A sufficient condition for interference alignmentMohammad Ali Khojastepour, Mohammad Farajzadeh-Tehrani. 1497-1501 [doi]
- When does an ensemble of matrices with randomly scaled rows lose rank?Aly El Gamal, Navid Naderializadeh, Amir Salman Avestimehr. 1502-1506 [doi]
- Layered lattice coding for the symmetric Gaussian X channelMuryong Kim, Sriram Vishwanath. 1507-1511 [doi]
- Polar coding for empirical and strong coordination via distribution approximationRemi A. Chou, Matthieu R. Bloch, Jörg Kliewer. 1512-1516 [doi]
- FV polar coding for lossy compression with an improved exponentRunxin Wang, Junya Honda, Hirosuke Yamamoto, Rongke Liu. 1517-1521 [doi]
- A Successive Description property of Monotone-Chain Polar Codes for Slepian-Wolf codingSalman Salamatian, Muriel Médard, Emre Telatar. 1522-1526 [doi]
- Coding for asymmetric side information channels with applications to polar codesDavid Burshtein. 1527-1531 [doi]
- Polar coding for relay channelsLele Wang. 1532-1536 [doi]
- Families of perfect polyphase sequences from the array structure of Fermat-Quotient sequences and Frank-Zadoff sequencesKi-Hyeon Park, Hong-Yeop Song, Dae San Kim. 1537-1540 [doi]
- A generalized construction for perfect autocorrelation sequencesSerdar Boztas, Seda Kahraman, Ferruh Özbudak, Eda Tekin. 1541-1545 [doi]
- Three new families of optimal variable-weight optical orthogonal codesJin-Ho Chung, Kyeongcheol Yang. 1546-1550 [doi]
- Binary sequences with optimal odd periodic autocorrelationYang Yang, Xiaohu Tang, Zhengchun Zhou. 1551-1554 [doi]
- Binary signature set with optimal odd periodic total squared correlationYang Yang, Xiaohu Tang, Zhengchun Zhou. 1555-1559 [doi]
- Statistical physics of random binningNeri Merhav. 1560-1564 [doi]
- Optimum trade-offs between error exponent and excess-rate exponent of Slepian-Wolf codingNir Weinberger, Neri Merhav. 1565-1569 [doi]
- Source coding with side information at the decoder revisitedTomohiko Uyematsu, Tetsunao Matsuta. 1570-1574 [doi]
- Exponent function for one helper source coding problem at rates outside the rate regionYasutada Oohama. 1575-1579 [doi]
- New lattice codes for multiple-descriptionsFarhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan. 1580-1584 [doi]
- Guessing Attacks on Distributed-Storage SystemsAnnina Bracher, Eran Hof, Amos Lapidoth. 1585-1589 [doi]
- STEP-archival: Storage integrity and anti-tampering using data entanglementHugues Mercier, Maxime Augier, Arjen K. Lenstra. 1590-1594 [doi]
- Almost IPP-codes or provably secure digital fingerprinting codesMarcel Fernandez, Grigory Kabatiansky, José Moreira. 1595-1599 [doi]
- Information-dispersal games for security in cognitive-radio networksV. Sriram Siddhardh Nadendla, Yunghsiang Sam Han, Pramod K. Varshney. 1600-1604 [doi]
- On secure distributed hypothesis testingMaggie Mhanna, Pablo Piantanida. 1605-1609 [doi]
- On the Rényi divergence and the joint range of relative entropiesIgal Sason. 1610-1614 [doi]
- Sphericity minimum description length: Asymptotic performance under unknown noise varianceJosep Font-Segura, Jaume Riba, Gregori Vázquez. 1615-1619 [doi]
- Symmetric information rate estimation and bit aspect ratio optimization for TDMR using Generalized Belief PropagationMehrdad Khatami, Mohsen Bahrami, Bane Vasic. 1620-1624 [doi]
- A discrete entropy power inequality for uniform distributionsJae Oh Woo, Mokshay M. Madiman. 1625-1629 [doi]
- Nearest symmetric distributionsDmitri S. Pavlichin. 1630-1634 [doi]
- Phase transitions in sparse PCAThibault Lesieur, Florent Krzakala, Lenka Zdeborová. 1635-1639 [doi]
- Inference for Generalized Linear Models via alternating directions and Bethe Free Energy minimizationSundeep Rangan, Alyson K. Fletcher, Philip Schniter, Ulugbek S. Kamilov. 1640-1644 [doi]
- Sub-linear time compressed sensing using sparse-graph codesXiao Li, Sameer Pawar, Kannan Ramchandran. 1645-1649 [doi]
- Sequential sensing with model mismatchRuiyang Song, Yao Xie, Sebastian Pokutta. 1650-1654 [doi]
- Phase retrieval with masks using convex optimizationKishore Jaganathan, Yonina C. Eldar, Babak Hassibi. 1655-1659 [doi]
- A spectral domain noise model for optical fibre channelsQun Zhang, Terence H. Chan. 1660-1664 [doi]
- Finite codelength analysis of the sequential waveform nulling receiver for M-ary PSKSi-Hui Tan, Zachary Dutton, Ranjith Nair, Saikat Guha. 1665-1670 [doi]
- Full large-scale diversity space codes for MIMO optical wireless communicationsYan-Yu Zhang, Hong-Yi Yu, Jian-Kang Zhang, Yi-Jun Zhu, Jin-Long Wang, Tao Wang. 1671-1675 [doi]
- Fast inverse nonlinear Fourier transform for generating multi-solitons in optical fiberSander Wahls, H. Vincent Poor. 1676-1680 [doi]
- Optimizing age-of-information in a multi-class queueing systemLongbo Huang, Eytan Modiano. 1681-1685 [doi]
- Coded caching for files with distinct file sizesJinbei Zhang, Xiaojun Lin, Chih-Chun Wang, Xinbing Wang. 1686-1690 [doi]
- Improved approximation of storage-rate tradeoff for caching via new outer boundsAvik Sengupta, Ravi Tandon, T. Charles Clancy. 1691-1695 [doi]
- Improved lower bounds for coded cachingHooshang Ghasemi, Aditya Ramamoorthy. 1696-1700 [doi]
- Effect of number of users in multi-level coded cachingJad Hachem, Nikhil Karamchandani, Suhas N. Diggavi. 1701-1705 [doi]
- On the optimality of treating interference as noise for K-user compound interference channelsChunhua Geng, Syed Ali Jafar. 1706-1710 [doi]
- On the limits of treating interference as noise for two-user symmetric Gaussian interference channelsShuo Li, Yu-Chih Huang, Tie Liu, Henry D. Pfister. 1711-1715 [doi]
- i.i.d. mixed inputs and treating interference as noise are gDoF optimal for the symmetric Gaussian two-user interference channelAlex Dytso, Daniela Tuninetti, Natasha Devroye. 1716-1720 [doi]
- On the optimality of treating interference as noise: A combinatorial optimization perspectiveXinping Yi, Giuseppe Caire. 1721-1725 [doi]
- New bounds for permutation codes in Ulam metricFaruk Göloglu, Jüri Lember, Ago-Erik Riet, Vitaly Skachek. 1726-1730 [doi]
- Bounds on the size of balls over permutations with the infinity metricMoshe Schwartz, Pascal O. Vontobel. 1731-1735 [doi]
- Coding schemes for inter-cell interference in flash memorySarit Buzaglo, Paul H. Siegel, Eitan Yaakobi. 1736-1740 [doi]
- Permutation codes correcting a single burst deletion I: Unstable deletionsYeow Meng Chee, Van Khu Vu, Xiande Zhang. 1741-1745 [doi]
- Performance analysis of Fano codingStanislav Krajci, Chin-Fu Liu, Ladislav Mikes, Stefan M. Moser. 1746-1750 [doi]
- Nonlinear codes outperform the best linear codes on the binary erasure channelPo-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser. 1751-1755 [doi]
- Improved Hamming sphere bounds on the MLD performance of binary linear codesJia Liu, Xiao Ma. 1756-1760 [doi]
- On bounding the union probabilityJun Yang, Fady Alajaji, Glen Takahara. 1761-1765 [doi]
- A dichotomy of functions in distributed coding: An information spectral approachShigeaki Kuzuoka, Shun Watanabe. 1766-1770 [doi]
- On the rate-distortion regions for interactive source codingLeonardo Rey Vega, Pablo Piantanida, Alfred O. Hero. 1771-1775 [doi]
- Information-theoretic cachingChien-Yi Wang, Sung-Hoon Lim, Michael Gastpar. 1776-1780 [doi]
- On the sum rate of multiple description coding with tree-structured distortion constraintsYinfei Xu, Jun Chen, Qiao Wang. 1781-1785 [doi]
- More efficient privacy amplification with less random seedsMasahito Hayashi, Toyohiro Tsurumaru. 1786-1790 [doi]
- Secret key-based authentication with a privacy constraintKittipong Kittichokechai, Giuseppe Caire. 1791-1795 [doi]
- Fundamental limits of perfect privacyFlávio du Pin Calmon, Ali Makhdoumi, Muriel Médard. 1796-1800 [doi]
- Privacy-utility trade-off under continual observationMurat A. Erdogdu, Nadia Fawaz. 1801-1805 [doi]
- Interactive communication for data exchangeHimanshu Tyagi, Pramod Viswanath, Shun Watanabe. 1806-1810 [doi]
- Non-asymptotic bounds for fixed-length lossy compressionTetsunao Matsuta, Tomohiko Uyematsu. 1811-1815 [doi]
- On fixed-length channel coding with feedback in the moderate deviations regimeYucel Altug, H. Vincent Poor, Sergio Verdú. 1816-1820 [doi]
- Erasure and undetected error probabilities in the moderate deviations regimeMasahito Hayashi, Vincent Yan Fu Tan. 1821-1825 [doi]
- Online matrix completion and online robust PCABrian Lois, Namrata Vaswani. 1826-1830 [doi]
- Low-rank matrix completion via Riemannian pursuit for topological interference managementYuanming Shi, Jun Zhang, Khaled Ben Letaief. 1831-1835 [doi]
- Information-theoretic limits of matrix completionErwin Riegler, David Stotz, Helmut Bölcskei. 1836-1840 [doi]
- Poisson matrix completionYang Cao, Yao Xie. 1841-1845 [doi]
- On the sum-capacity of the cognitive interference channel with cognitive-only message sharingDiana Maamari, Daniela Tuninetti, Natasha Devroye. 1846-1850 [doi]
- Outage performance of cognitive radio systems with Improper Gaussian signalingOsama Amin, Walid Abediseid, Mohamed-Slim Alouini. 1851-1855 [doi]
- Opportunistic in-network computation for wireless sensor networksSang-Woon Jeon, Bang Chul Jung. 1856-1860 [doi]
- Design and performance analysis of network code division multiplexing for wireless sensor networksJing Yue, Zihuai Lin, Guoqiang Mao, Branka Vucetic. 1861-1865 [doi]
- Achieving arbitrary locality and availability in binary codesAnyu Wang, Zhifang Zhang, Mulan Liu. 1866-1870 [doi]
- Linear locally repairable codes with availabilityPengfei Huang, Eitan Yaakobi, Hironori Uchikawa, Paul H. Siegel. 1871-1875 [doi]
- Sector-disk codes and partial MDS codes with up to three global paritiesJunyu Chen, Kenneth W. Shum, Quan Yu, Chi Wan Sung. 1876-1880 [doi]
- On partial maximally-recoverable and maximally-recoverable codesS. B. Balaji, P. Vijay Kumar. 1881-1885 [doi]
- Capacity results for the multi-way relay channel with common messagesLawrence Ong. 1886-1890 [doi]
- The half-duplex Gaussian two-way relay channel with direct linksLawrence Ong. 1891-1895 [doi]
- Capacity of two-way linear deterministic diamond channelMehdi Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang. 1896-1900 [doi]
- On two-pair two-way relay channel with an intermittently available relayShih-Chun Lin, I-Hsiang Wang. 1901-1905 [doi]
- Adaptive error correction coding scheme for computations in the noisy min-sum decoderChu-Hsiang Huang, Yao Li, Lara Dolecek. 1906-1910 [doi]
- Parallel encoding algorithm for LDPC codes based on block-diagonalizationTakayuki Nozaki. 1911-1915 [doi]
- Fast systematic encoding of quasi-cyclic codes using the Chinese remainder theoremPavel Panteleev. 1916-1920 [doi]
- An investigation of SUDOKU-inspired non-linear codes with local constraintsJossy Sayir, Joned Sarwar. 1921-1925 [doi]
- Weight distribution of cosets of small codes with good dual propertiesLouay Bazzi. 1926-1930 [doi]
- Spectrum of sizes for perfect burst deletion-correcting codesYeow Meng Chee, Yang Li, Xiande Zhang. 1931-1935 [doi]
- Coding for the ℓ∞-limited permutation channelMichael Langberg, Moshe Schwartz, Eitan Yaakobi. 1936-1940 [doi]
- Weakly secure MDS codes for simple multiple access networksSon Hoang Dau, Wentu Song, Chau Yuen. 1941-1945 [doi]
- Capacity and expressiveness of genomic tandem duplicationSiddharth Jain, Farzad Farnoud, Jehoshua Bruck. 1946-1950 [doi]
- On the capacity of level and type modulations in Molecular communication with ligand receptorsGholamali Aminian, Mahtab Mirmohseni, Masoumeh Nasiri-Kenari, Faramarz Fekri. 1951-1955 [doi]
- Diffusion channel with Poisson reception process: capacity results and applicationsHessam Mahdavifar, Ahmad Beirami. 1956-1960 [doi]
- Design of efficient channels with given input statisticsToby Berger, Mustafa Sungkar. 1961-1965 [doi]
- Secrecy for MISO broadcast channels with heterogeneous CSITPritam Mukherjee, Ravi Tandon, Sennur Ulukus. 1966-1970 [doi]
- How to use independent secret keys for secure broadcasting of common messagesRafael F. Schaefer, Ashish Khisti, H. Vincent Poor. 1971-1975 [doi]
- Secure communication in K-user multi-antenna broadcast channel with state feedbackSheng Yang, Mari Kobayashi. 1976-1980 [doi]
- The confidential MIMO broadcast capacity: A simple derivationAnatoly Khina, Yuval Kochman, Ashish Khisti. 1981-1985 [doi]
- Fundamental limit and pointwise asymptotics of the Bayes code for Markov sourcesShota Saito, Nozomi Miya, Toshiyasu Matsushima. 1986-1990 [doi]
- On redundancy rate of FDLZ algorithm and its variantsAyush Jain, Rakesh K. Bansal. 1991-1995 [doi]
- Third-order coding rate for universal compression of Markov sourcesNematollah Iri, Oliver Kosut. 1996-2000 [doi]
- Universal compression of power-law distributionsMoein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh. 2001-2005 [doi]
- Replica symmetric bound for restricted isometry constantAyaka Sakata, Yoshiyuki Kabashima. 2006-2010 [doi]
- Generalized Vandermonde decomposition and its use for multi-dimensional super-resolutionZai Yang, Lihua Xie, Petre Stoica. 2011-2015 [doi]
- Capacity-achieving Sparse Regression Codes via approximate message passing decodingCynthia Rush, Adam Greig, Ramji Venkataramanan. 2016-2020 [doi]
- Asymptotically exact error analysis for the generalized equation-LASSOChristos Thrampoulidis, Ashkan Panahi, Babak Hassibi. 2021-2025 [doi]
- Optimal distributed codes with delay four and constant decoding complexityHsiao-feng Lu. 2026-2030 [doi]
- A Markov error modeling approach to distributed turbo codingBin Qian, Wai Ho Mow. 2031-2035 [doi]
- Regularized ZF in cooperative broadcast channels under distributed CSIT: A large system analysisPaul de Kerret, David Gesbert, Umer Salim. 2036-2040 [doi]
- Distributed transmit beamforming with one bit feedback revisited: How noise limits scalingMuhammed Faruk Gencel, Maryam Eslami Rasekh, Upamanyu Madhow. 2041-2045 [doi]
- Optimal fractional repetition codes and fractional repetition batch codesNatalia Silberstein, Tuvi Etzion. 2046-2050 [doi]
- A high-rate MSR code with polynomial sub-packetization levelBirenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar. 2051-2055 [doi]
- New bounds on the (n, k, d) storage systems with exact repairSoheil Mohajer, Ravi Tandon. 2056-2060 [doi]
- Linear exact repair rate region of (k + 1, k, k) distributed storage systems: A new approachMehran Elyasi, Soheil Mohajer, Ravi Tandon. 2061-2065 [doi]
- On lattice codes for Gaussian interference channelsJingge Zhu, Michael Gastpar. 2066-2070 [doi]
- Coset codes for communicating over non-additive channelsArun Padakandla, S. Sandeep Pradhan. 2071-2075 [doi]
- Lattice coding for the Gaussian one- and two-way relay channels with correlated noisesAnne Savard, Claudio Weidmann. 2076-2080 [doi]
- Beyond group capacity in multi-terminal communicationsMohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan. 2081-2085 [doi]
- A constraint scheme for correcting massive asymmetric magnitude-1 errors in multi-level NVMsEvyatar Hemo, Yuval Cassuto. 2086-2090 [doi]
- When do WOM codes improve the erasure factor in flash memories?Eitan Yaakobi, Alexander Yucovich, Gal Maor, Gala Yadgar. 2091-2095 [doi]
- Asymmetric error-correcting codes for Flash memories in high-radiation environmentsFrederic Sala, Clayton Schoeny, Dariush Divsalar, Lara Dolecek. 2096-2100 [doi]
- Analysis and coding schemes for the flash normal-laplace mixture channelClayton Schoeny, Frederic Sala, Lara Dolecek. 2101-2105 [doi]
- Low-complexity coding scheme to approach multiple-access channel capacityGuanghui Song, Jun Cheng. 2106-2110 [doi]
- Channel resolvability codes based on concatenation and sparse linear encodingRana Ali Amjad, Gerhard Kramer. 2111-2115 [doi]
- Adaptive estimation in weighted group testingJayadev Acharya, Clément L. Canonne, Gautam Kamath. 2116-2120 [doi]
- Communication strategies for low-latency tradingMina Karzand, Lav R. Varshney. 2121-2125 [doi]
- On Multiple Description coding for the Multicast Cognitive Interference ChannelMeryem Benammar, Pablo Piantanida, Shlomo Shamai. 2126-2130 [doi]
- The two-way cooperative Information BottleneckMatias Vera, Leonardo Rey Vega, Pablo Piantanida. 2131-2135 [doi]
- Coding for source-broadcasting over erasure channels with feedbackLouis Tan, Kaveh Mahdaviani, Ashish Khisti, Emina Soljanin. 2136-2140 [doi]
- Reliable uncoded communication in the quantized SIMO MACMainak Chowdhury, Alon Kipnis, Andrea Goldsmith. 2141-2145 [doi]
- The arbitrarily varying wiretap channel - communication under uncoordinated attacksMoritz Wiese, Janis Noetzel, Holger Boche. 2146-2150 [doi]
- The arbitrarily varying wiretap channel - secret randomness, stability and super-activationJanis Noetzel, Moritz Wiese, Holger Boche. 2151-2155 [doi]
- Secret-key agreement over spatially correlated fast-fading multiple-antenna channels with public discussionMarwen Zorgui, Zouheir Rezki, Basel Alomair, Mohamed-Slim Alouini. 2156-2160 [doi]
- Achieving secrecy without any instantaneous CSI: polar coding for fading wiretap channelsHongbo Si, Onur Ozan Koyluoglu, Sriram Vishwanath. 2161-2165 [doi]
- Universality of logarithmic loss in lossy compressionAlbert No, Tsachy Weissman. 2166-2170 [doi]
- Lossless and lossy source compression with near-uniform output: Is common randomness always required?Badri N. Vellambi, Matthieu R. Bloch, Remi A. Chou, Jörg Kliewer. 2171-2175 [doi]
- Remote source coding with two-sided informationBasak Guler, Ebrahim MolavianJazi, Aylin Yener. 2176-2180 [doi]
- Variable-length coding with epsilon-fidelity criteria for general sourcesHideki Yagi, Ryo Nomura. 2181-2185 [doi]
- A convergence analysis of distributed dictionary learning based on the K-SVD algorithmHaroon Raja, Waheed U. Bajwa. 2186-2190 [doi]
- Deterministic conditions for subspace identifiability from incomplete samplingDaniel L. Pimentel-Alarcón, Nigel Boston, Robert D. Nowak. 2191-2195 [doi]
- A volume correlation subspace detector for signals buried in unknown clutterHailong Shi, Hao Zhang, Xiqin Wang. 2196-2200 [doi]
- Mismatch in the classification of linear subspaces: Upper bound to the probability of errorJure Sokolic, Francesco Renna, A. Robert Calderbank, Miguel R. D. Rodrigues. 2201-2205 [doi]
- Entropy reduction via communications in cyber physical systems: How to feed maxwell's demon?Husheng Li. 2206-2210 [doi]
- Pricing for profit in internet of thingsArnob Ghosh, Saswati Sarkar. 2211-2215 [doi]
- A game theoretic approach to content trading in proactive wireless networksFaisal Alotaibi, Sameh Hosny, Hesham El Gamal, Atilla Eryilmaz. 2216-2220 [doi]
- Control capacityGireeja Ranade, Anant Sahai. 2221-2225 [doi]
- Simplified erasure/list decodingNir Weinberger, Neri Merhav. 2226-2230 [doi]
- Upper bound on list-decoding radius of binary codesYury Polyanskiy. 2231-2235 [doi]
- Symmetric disjunctive list-decoding codesArkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin. 2236-2240 [doi]
- Optimality of gaussian fronthaul compression for uplink MIMO cloud radio access networksYuhan Zhou, Yinfei Xu, Jun Chen, Wei Yu. 2241-2245 [doi]
- On the achievable rates of multihop virtual full-duplex relay channelsSong-Nam Hong, Ivana Maric, Dennis Hui, Giuseppe Caire. 2246-2250 [doi]
- Approximate capacity of Gaussian relay networks: Is a sublinear gap to the cutset bound plausible?Thomas A. Courtade, Ayfer Özgür. 2251-2255 [doi]
- On the capacity of generalized Ising channelsArtyom Sharov, Ron M. Roth. 2256-2260 [doi]
- Generalized belief propagation for estimating the partition function of the 2D Ising modelChun Lam Chan, Mahdi Jafari Siavoshani, Sidharth Jaggi, Navin Kashyap, Pascal O. Vontobel. 2261-2265 [doi]
- The ising model: Kramers-Wannier duality and normal factor graphsAli Al-Bashabsheh, Pascal O. Vontobel. 2266-2270 [doi]
- Convolutional codes with maximum column sum rank for network streamingRafid Mahmood, Ahmed Badr, Ashish Khisti. 2271-2275 [doi]
- Embedded MDS codes for multicast streamingAhmed Badr, Rafid Mahmood, Ashish Khisti. 2276-2280 [doi]
- Playback delay in on-demand streaming communication with feedbackKaveh Mahdaviani, Ashish Khisti, Gauri Joshi, Gregory W. Wornell. 2281-2285 [doi]
- On the dirty paper channel with fast fading dirtStefano Rini, Shlomo Shamai. 2286-2290 [doi]
- Minimax estimation of discrete distributionsYanjun Han, Jiantao Jiao, Tsachy Weissman. 2291-2295 [doi]
- Minimax estimation of information measuresJiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman. 2296-2300 [doi]
- Message Authentication Code over a wiretap channelDajiang Chen, Shaoquan Jiang, Zhiguang Qin. 2301-2305 [doi]
- A permutation-based code for the wiretap channelWei Kang, Nan Liu. 2306-2310 [doi]
- Secure degrees of freedom of the multiple access wiretap channel with no eavesdropper CSIPritam Mukherjee, Sennur Ulukus. 2311-2315 [doi]
- Approximation of capacity for ISI channels with one-bit output quantizationRadha Krishna Ganti, Andrew Thangaraj, Arijit Mondal. 2316-2320 [doi]
- Capacity upper bounds for discrete-time amplitude-constrained AWGN channelsAndrew Thangaraj, Gerhard Kramer, Georg Bocherer. 2321-2325 [doi]
- Lower bound on the capacity of continuous-time Wiener phase noise channelsLuca Barletta, Gerhard Kramer. 2326-2330 [doi]
- Limits on support recovery with probabilistic models: An information-theoretic frameworkJonathan Scarlett, Volkan Cevher. 2331-2335 [doi]
- Information recovery from pairwise measurements: A shannon-theoretic approachYuxin Chen, Changho Suh, Andrea J. Goldsmith. 2336-2340 [doi]
- A concentration-of-measure inequality for multiple-measurement modelsLiming Wang, Jiaji Huang, Xin Yuan, Volkan Cevher, Miguel R. D. Rodrigues, Robert Calderban, Lawrence Carin. 2341-2345 [doi]
- Ergodic capacity of spatially correlated multi-cluster scattering MIMO channelsLu Wei. 2346-2350 [doi]
- Bandwidth occupancy of non-coherent wideband fading channelsFelipe Gomez-Cuba, Jinfeng Du, Muriel Médard, Elza Erkip. 2351-2355 [doi]
- On the age of Channel State Information for non-reciprocal wireless linksMaice Costa, Stefan Valentin, Anthony Ephremides. 2356-2360 [doi]
- Optimal path encoding for software-defined networksAdiseshu Hari, Urs Niesen, Gordon T. Wilfong. 2361-2365 [doi]
- A VC-dimension-based outer bound on the zero-error capacity of the binary adder channelOr Ordentlich, Ofer Shayevitz. 2366-2370 [doi]
- Blind index codingDavid T.-H. Kao, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr. 2371-2375 [doi]
- Converses for distributed estimation via strong data processing inequalitiesAolin Xu, Maxim Raginsky. 2376-2380 [doi]
- On the duality of additivity and tensorizationSalman Beigi, Amin Gohari. 2381-2385 [doi]
- Strong converse rates for quantum communicationMarco Tomamichel, Mark M. Wilde, Andreas Winter. 2386-2390 [doi]
- On the minimum distance of elliptic curve codesJiyou Li, Daqing Wan, Jun Zhang. 2391-2395 [doi]
- Decoding of interleaved Reed-Solomon codes via simultaneous partial inversesJiun-Hung Yu, Hans-Andrea Loeliger. 2396-2400 [doi]
- Information sets of Multiplicity codesDaniel Augot, Françoise Levy-dit-Vehel, Man Cuong Ngô. 2401-2405 [doi]
- On the separating redundancy of extended Hamming codesHaiyang Liu, Daeyeoul Kim, Yang Li, Aaron Z. Jia. 2406-2410 [doi]
- On the maximum true burst correcting capability of primitive Fire codesWei Zhou, Shu Lin, Khaled A. S. Abdel-Ghaffar. 2411-2415 [doi]
- Sub-optimality of Han-Kobayashi achievable region for interference channelsChandra Nair, Lingxiao Xia, Mehdi Yazdanpanah. 2416-2420 [doi]
- Impact of local delayed CSIT on the capacity region of the two-user interference channelAlireza Vahid, A. Robert Calderbank. 2421-2425 [doi]
- Topological interference management for interference broadcast channels with alternating connectivityPaula Aquilina, Tharmalingam Ratnarajah. 2426-2430 [doi]
- Flexible backhaul design with cooperative transmission in cellular interference networksMeghana Bande, Aly El Gamal, Venugopal V. Veeravalli. 2431-2435 [doi]
- Outage analysis for two-user parallel Gaussian interference channelsEhsan Ebrahimzadeh, Kamyar Moshksar, Amir K. Khandani. 2436-2440 [doi]
- A packing lemma for polar codesErdal Arikan. 2441-2445 [doi]
- Alignment of polarized setsJoseph M. Renes, David Sutter, S. Hamed Hassaniy. 2446-2450 [doi]
- Ergodic theory meets polarization I: A foundation of polarization theoryRajai Nasser. 2451-2455 [doi]
- Ergodic theory meets polarization II: A foundation of polarization theory for MACsRajai Nasser. 2456-2460 [doi]
- High-Girth matrices and polarizationEmmanuel Abbe, Yuval Wigderson. 2461-2465 [doi]
- Counterexample to the generalized belfiore-solé secrecy function conjecture for l-modular latticesAnne-Maria Ernvall-Hytönen, B. A. Sethuraman. 2466-2469 [doi]
- Independent Metropolis-Hastings-Klein algorithm for lattice Gaussian samplingZheng Wang, Cong Ling. 2470-2474 [doi]
- Compute-and-forward can buy secrecy cheapParisa Babaheidarian, Somayeh Salimi. 2475-2479 [doi]
- Nearest-neighbor error correcting codes on a hexagonal signal constellationHiroyoshi Morita. 2480-2484 [doi]
- Lattice index codes from algebraic number fieldsYu-Chih Huang. 2485-2489 [doi]
- Signaling over the Gaussian channel with intermittent feedbackLars Palzer. 2490-2494 [doi]
- Feedback and partial message side-information on the semideterministic broadcast channelAnnina Bracher, Michele A. Wigger. 2495-2499 [doi]
- The Gaussian channel with noisy feedback: improving reliability via interactionAssaf Ben-Yishai, Ofer Shayevitz. 2500-2504 [doi]
- Broadcasting a common message with variable-length stop-feedback codesKasper Fløe Trillingsgaard, Wei Yang, Giuseppe Durisi, Petar Popovski. 2505-2509 [doi]
- Strong converse theorems for degraded broadcast channels with feedbackYasutada Oohama. 2510-2514 [doi]
- Optimal strategies for side-channel leakage in FCFS packet schedulersSaurabh Shintre, Virgil D. Gligor, João Barros. 2515-2519 [doi]
- Joint source-channel secrecy using hybrid codingEva C. Song, Paul W. Cuff, H. Vincent Poor. 2520-2524 [doi]
- Limits of low-probability-of-detection communication over a discrete memoryless channelLigong Wang, Gregory W. Wornell, Lizhong Zheng. 2525-2529 [doi]
- Coding against a limited-view adversary: The effect of causality and feedbackQiaosheng Zhang, Swanand Kadhe, Mayank Bakshi, Sidharth Jaggi, Alex Sprintson. 2530-2534 [doi]
- A channel resolvability perspective on stealth communicationsMatthieu Bloch. 2535-2539 [doi]
- A method for the construction of optimal task encodersAmos Lapidoth, Christoph Pfister. 2540-2544 [doi]
- Strong converse theorems for classes of multimessage multicast networks: A Rényi divergence approachSilas L. Fong, Vincent Y. F. Tan. 2545-2549 [doi]
- The strong data processing constant for sums of i.i.d. random variablesSudeep Kamath, Chandra Nair. 2550-2552 [doi]
- Detection of graph structures via communications over a multiaccess Boolean channelShuhang Wu, Shuangqing Wei, Yue Wang 0007, Ramachandran Vaidyanathan, Jian Yuan, Xiqin Wang. 2553-2557 [doi]
- Strong data processing inequalities in power-constrained Gaussian channelsFlávio du Pin Calmon, Yury Polyanskiy, Yihong Wu 0001. 2558-2562 [doi]
- Greedy tree search for Internet of Things signal detectionJaeseok Lee, Byonghyo Shim. 2563-2567 [doi]
- Density criteria for the identification of linear time-varying systemsCéline Aubel, Helmut Bölcskei. 2568-2572 [doi]
- Robust sublinear complexity Walsh-Hadamard transform with arbitrary sparse supportXu Chen, Dongning Guo. 2573-2577 [doi]
- Low-complexity detection of zero blocks in wideband spectrum sensingZeinab Zeinalkhani, Amir H. Banihashemi. 2578-2582 [doi]
- Fast and robust compressive phase retrieval with sparse-graph codesDong Yin, Kangwook Lee, Ramtin Pedarsani, Kannan Ramchandran. 2583-2587 [doi]
- On the mutual information of 3D massive MIMO systems: An asymptotic approachQurrat-Ul-Ain Nadeem, Abla Kammoun, Mérouane Debbah, Mohamed-Slim Alouini. 2588-2592 [doi]
- On the finite-SNR Diversity-Multiplexing Tradeoff in large Rayleigh product channelsZhong Zheng, Lu Wei, Roland Speicher, Ralf Müller, Jyri Hämäläinen, Jukka Corander. 2593-2597 [doi]
- Achievable rate analysis for multi-pair two-way massive MIMO full-duplex relay systemsZhanzhan Zhang, Zhiyong Chen, Manyuan Shen, Bin Xia, Ling Luo. 2598-2602 [doi]
- On the capacity of correlated massive MIMO systems using stochastic geometrySudip Biswas, Jiang Xue, Faheem A. Khan, Tharmalingam Ratnarajah. 2603-2607 [doi]
- On existence of power controls for Massive MIMOHong Yang, Thomas L. Marzetta. 2608-2612 [doi]
- Low-delay erasure-correcting codes with optimal average delayNitzan Adler, Yuval Cassuto. 2613-2617 [doi]
- Estimating minimum sum-rate for cooperative data exchangeNi Ding, Rodney A. Kennedy, Parastoo Sadeghi. 2618-2622 [doi]
- Rateless and pollution-attack-resilient network codingWentao Huang, Ting Wang, Xin Hu, Jiyong Jang, Theodoros Salonidis. 2623-2627 [doi]
- Coded retransmission in wireless networks via abstract MDPs: Theory and algorithmsMark Shifrin, Asaf Cohen 0001, Olga Weisman, Omer Gurewitz. 2628-2632 [doi]
- Constructing multicast networks where vector linear coding outperforms scalar linear codingQifu Tyler Sun, Xiaolong Yang, Keping Long, Zongpeng Li. 2633-2637 [doi]
- Controlled asynchronism improves error exponentLóránt Farkas, Tamás Kói. 2638-2642 [doi]
- Constant-gap sum-capacity approximation of the deterministic interfering multiple access channelRick Fritschek, Gerhard Wunder. 2643-2647 [doi]
- General capacity region for the fully-connected 3-node packet erasure networkJaemin Han, Chih-Chun Wang. 2648-2652 [doi]
- Instances of the relay-broadcast channel and cooperation strategiesYossef Steinberg. 2653-2657 [doi]
- Polymatroidal structure in the multiple access channel with general message setsHenry P. Romero, Mahesh K. Varanasi. 2658-2662 [doi]
- ADMM decoding on trapping setsXishuo Liu, Stark C. Draper. 2663-2667 [doi]
- Optimized quantization and scaling of layered LDPC scaled min-sum decoderAhmed A. Emran, Maha Elsabrouty, Osamu Muta, Hiroshi Furukawa. 2668-2672 [doi]
- On the multiple threshold decoding of LDPC codes over GF(q)Alexey Frolov, Victor V. Zyablov. 2673-2677 [doi]
- Asynchronous decoding of LDPC codes over BECSaeid Haghighatshoar, Amin Karbasi, Amir Hesam Salavati. 2678-2682 [doi]
- Analyzing the finite-length performance of generalized LDPC codesPablo M. Olmos, David G. M. Mitchell, Daniel J. Costello Jr.. 2683-2687 [doi]
- New bounds on the imbalance of a half-l-sequenceQichun Wang, Chik-How Tan. 2688-2691 [doi]
- Optimal spectrally-constrained sequencesZi-Long Liu, Yong Liang Guan, Su Hu, Udaya Parampalli. 2692-2696 [doi]
- Linear complexity for multidimensional arrays - a numerical invariantDomingo Gómez-Pérez, Tom Høholdt, Oscar Moreno, Ivelisse Rubio. 2697-2701 [doi]
- Three novel combinatorial theorems for the insertion/deletion channelFrederic Sala, Ryan Gabrys, Clayton Schoeny, Lara Dolecek. 2702-2706 [doi]
- Correlation distribution of a new sequence familySerdar Boztas, Ferruh Özbudak, Eda Tekin. 2707-2711 [doi]
- Energy-subchannel allocation for energy harvesting nodes in frequency-selective channelsZhe Wang, Xiaodong Wang, Vaneet Aggarwal. 2712-2716 [doi]
- Energy-bandwidth allocation in multiple orthogonal broadcast channels with energy harvestingZhe Wang, Vaneet Aggarwal, Xiaodong Wang. 2717-2721 [doi]
- The binary energy harvesting channel with on-off fadingOmur Ozel, Kaya Tutuncuoglu, Sennur Ulukus, Aylin Yener. 2722-2726 [doi]
- Online throughput maximization in an energy harvesting multiple access channel with fadingJing Yang, Jingxian Wu. 2727-2731 [doi]
- Energy harvesting cooperative diamond channelBerk Gurakan, Sennur Ulukus. 2732-2736 [doi]
- On coding for secure computingDeepesh Data, Vinod M. Prabhakaran. 2737-2741 [doi]
- Impossibility bounds for secure computingHimanshu Tyagi, Shun Watanabe. 2742-2746 [doi]
- New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystemAdrien Hauteville, Jean-Pierre Tillich. 2747-2751 [doi]
- Approaching maximum embedding efficiency on small covers using Staircase-Generator codesSimona Samardjiska, Danilo Gligoroski. 2752-2756 [doi]
- Quantifying computational security subject to source constraints, guesswork and inscrutabilityAhmad Beirami, A. Robert Calderbank, Ken R. Duffy, Muriel Médard. 2757-2761 [doi]
- Source compression with a quantum helperMin-Hsiu Hsieh, Shun Watanabe. 2762-2766 [doi]
- Approximate degradable quantum channelsDavid Sutter, Volkher B. Scholz, Renato Renner. 2767-2771 [doi]
- Second-order coding rates for entanglement-assisted communicationNilanjana Datta, Marco Tomamichel, Mark M. Wilde. 2772-2776 [doi]
- Compressibility of positive semidefinite factorizations and quantum modelsCyril J. Stark, Aram Wettroth Harrow. 2777-2781 [doi]
- An improved rate region for the classical-quantum broadcast channelChristoph Hirche, Ciara Morgan. 2782-2786 [doi]
- Bitwise MAP estimation for group testing based on holographic transformationTadashi Wadayama, Taisuke Izumi, Kazushi Mimura. 2787-2791 [doi]
- Distributed testing with zero-rate compressionWenwen Zhao, Lifeng Lai. 2792-2796 [doi]
- On the necessity of binning for the distributed hypothesis testing problemGil Katz, Pablo Piantanida, Romain Couillet, Mérouane Debbah. 2797-2801 [doi]
- Performance degradation of AMP for small-sized problemsArise Kuriya, Toshiyuki Tanaka. 2802-2806 [doi]
- S-AMP for non-linear observation modelsBurak Çakmak, Ole Winther, Bernard H. Fleury. 2807-2811 [doi]
- Stability analysis of static Poisson networksYi Zhong, Wenyi Zhang, Martin Haenggi. 2812-2816 [doi]
- User-centric interference nulling in downlink multi-antenna heterogeneous networksYueping Wu, Ying Cui, Bruno Clerckx. 2817-2821 [doi]
- Distributed rate and power control in DSRCJubin Jose, Chong Li, Xinzhou Wu, Lei Ying, Kai Zhu. 2822-2826 [doi]
- Grouping based blind interference alignment for K-user MISO interference channelsHeecheol Yang, Wonjae Shin, Jungwoo Lee. 2827-2831 [doi]
- Matching alignmentMichael Farag, Bobak Nazer. 2832-2836 [doi]
- Reconciling similar sets of dataRyan Gabrys, Farzad Farnoud. 2837-2841 [doi]
- Private information retrieval for coded storageTerence H. Chan, Siu-Wai Ho, Hirosuke Yamamoto. 2842-2846 [doi]
- Securing data against limited-knowledge adversaries in distributed storage systemsRawad Bitar, Salim El Rouayheb. 2847-2851 [doi]
- Codes for distributed PIR with low storage overheadArman Fazeli, Alexander Vardy, Eitan Yaakobi. 2852-2856 [doi]
- Cut-set bound for multimessage multicast networks with independent channels and zero-delay edgesSilas L. Fong. 2857-2861 [doi]
- The multiple access diamond channel with caching relaysNan Liu, Wei Kang. 2862-2866 [doi]
- Quasi-concavity for Gaussian multicast relay channelsMohit Thakur, Gerhard Kramer. 2867-2869 [doi]
- Noisy network coding with partial DFSi-Hyeon Lee, Sae-Young Chung. 2870-2874 [doi]
- Weight distributions of non-binary multi-edge type LDPC code ensemblesGiuliano Garrammone, David Declercq, Marc P. C. Fossorier. 2875-2879 [doi]
- On the weight distribution of fixed-rate Raptor codesFrancisco Lazaro Blasco, Enrico Paolini, Gianluigi Liva, Gerhard Bauch. 2880-2884 [doi]
- An upper bound on the minimum distance of LDPC codes over GF(q)Alexey Frolov. 2885-2888 [doi]
- Ensemble weight enumerators for protographs: A proof of Abu Surra's conjecture and a continuous relaxation for a faster enumerationTarik Benaddi, Charly Poulliat, Marie-Laure Boucheret, Benjamin Gadat, Guy Lesthievent. 2889-2893 [doi]
- Cover-free codes and separating system codesArkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin. 2894-2898 [doi]
- Almost cover-free codes and designsArkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin. 2899-2903 [doi]
- On the NP-hardness of bounded distance decoding of Reed-Solomon codesVenkata Gandikota, Badih Ghazi, Elena Grigorescu. 2904-2908 [doi]
- Iterative soft-decision decoding of Reed-Solomon codes using informed dynamic schedulingHuang Chang Lee, Guan-Xuan Huang, Chung-Hsuan Wang, Yeong-Luh Ueng. 2909-2913 [doi]
- Selecting observers for source localization via error exponentsSabina Zejnilovic, João M. F. Xavier, João Pedro Gomes, Bruno Sinopoli. 2914-2918 [doi]
- Universal decoding for Gaussian intersymbol interference channelsWasim Huleihel, Neri Merhav. 2919-2923 [doi]
- On MMSE estimation from quantized observations in the nonasymptotic regimeJaeho Lee, Maxim Raginsky, Pierre Moulin. 2924-2928 [doi]
- Secure state estimation: Optimal guarantees against sensor attacks in the presence of noiseShaunak Mishra, Yasser Shoukry, Nikhil Karamchandani, Suhas N. Diggavi, Paulo Tabuada. 2929-2933 [doi]
- Message authentication with correlated sourcesDaming Cao, Wei Kang. 2934-2938 [doi]
- Maximal correlation secrecyCheuk Ting Li, Abbas El Gamal. 2939-2943 [doi]
- Forgot your password: Correlation dilutionAli Makhdoumi, Flávio du Pin Calmon, Muriel Médard. 2944-2948 [doi]
- Information leakage of heterogeneous encoded correlated sequences over an eavesdropped channelReevana Balmahoon, Ling Cheng. 2949-2953 [doi]
- Refinements of the third-order term in the fixed error asymptotics of constant-composition codesJonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas. 2954-2958 [doi]
- Minimum energy to send k bits over Rayleigh-fading channelsWei Yang, Giuseppe Durisi, Yury Polyanskiy. 2959-2963 [doi]
- Second-order asymptotics for the discrete memoryless MAC with degraded message setsJonathan Scarlett, Vincent Y. F. Tan. 2964-2968 [doi]
- First- and second-order coding theorems for mixed memoryless channels with general mixtureHideki Yagi, Te Sun Han, Ryo Nomura. 2969-2973 [doi]
- On a two-dimensional antidictionary construction using suffix triesTakahiro Ota, Hiroyoshi Morita. 2974-2978 [doi]
- Compressing sparse sequences under local decodability constraintsAshwin Pananjady, Thomas A. Courtade. 2979-2983 [doi]
- Local recovery in data compression for general sourcesArya Mazumdar, Venkat Chandar, Gregory W. Wornell. 2984-2988 [doi]
- Automata and graph compressionMehryar Mohri, Michael Riley, Ananda Theertha Suresh. 2989-2993 [doi]
- On unequal missing protection of the grouping of RFID tagsYi-Sheng Su, Chung-Hsuan Wang, Huei-Yun Siao. 2994-2998 [doi]
- Improving degrees of freedom of wireless channels using superdirectivityWonseok Jeon, Sae-Young Chung. 2999-3003 [doi]
- Improved information rates for bit-interleaved coded modulationAlfonso Martinez, Li Peng, Alex Alvarado, Albert Guillen i Fabregas. 3004-3007 [doi]
- Lazy is timely: Status updates by an energy harvesting sourceRoy D. Yates. 3008-3012 [doi]