Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2017: Aachen, Germany
- 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017. IEEE 2017, ISBN 978-1-5090-4096-4
- Ryan Gabrys, Eitan Yaakobi, Mario Blaum, Paul H. Siegel:
Constructions of partial MDS codes over small fields. 1-5 - Irene Marquez Corbella
, Jean-Pierre Tillich:
Attaining capacity with iterated (U|U + V) codes based on AG codes and Koetter-Vardy soft decoding. 6-10 - Anoosheh Heidarzadeh, Alex Sprintson:
An algebraic-combinatorial proof technique for the GM-MDS conjecture. 11-15 - Igor V. Zhilin, Alexey Kreshchuk, Victor V. Zyablov:
On the code distance of a woven block code construction. 16-20 - Sara D. Cardell, Marcelo Firer, Diego Napp:
Generalized column distances for convolutional codes. 21-25 - Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat:
A unified ensemble of concatenated convolutional codes. 26-30 - Ido B. Gattegno, Haim H. Permuter, Shlomo Shamai, Ayfer Özgür:
Cooperative binning for semi-deterministic channels with non-causal state information. 31-35 - Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
A new achievable rate region for multiple-access channel with states. 36-40 - Parham Noorzad, Michelle Effros, Michael Langberg:
The benefit of encoder cooperation in the presence of state information. 41-45 - Arnaud Marsiglietti, Victoria Kostina:
A lower bound on the differential entropy for log-concave random variables with applications to rate-distortion theory. 46-50 - Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
H(X) vs. H(f(X)). 51-55 - Thomas A. Courtade:
Concavity of entropy power: Equivalent formulations and generalizations. 56-60 - Alexander Span, Vahid Aref, Henning Bülow, Stephan ten Brink:
On time-bandwidth product of multi-soliton pulses. 61-65 - Kamran Keykhosravi, Erik Agrell:
A novel demodulation scheme for a memoryless optical interference channel. 66-70 - Yerzhan Sapenov, Anas Chaaban, Zouheir Rezki, Mohamed-Slim Alouini:
Optical MISO IM/DD channels: Optimality of spatial repetition codes among DC-offset STBCs. 71-75 - Mingming Cai, J. Nicholas Laneman, Bertrand M. Hochwald:
Beamforming codebook compensation for beam squint with channel capacity constraint. 76-80 - Ali Bereyhi, Mohammad Ali Sedaghat, Ralf R. Müller:
Asymptotics of nonlinear LSE precoders with applications to transmit antenna selection. 81-85 - Wassim Tabikh, Dirk T. M. Slock, Yi Yuan-Wu:
MIMO IBC beamforming with combined channel estimate and covariance CSIT. 86-90 - Wasim Huleihel, Or Ordentlich:
How to quantize n outputs of a binary symmetric channel to n - 1 bits? 91-95 - Bobak Nazer, Or Ordentlich, Yury Polyanskiy:
Information-distilling quantizers. 96-100 - Shraga I. Bross, Hagai Zalach:
Distortion bounds for source broadcasting and asymmetric data transmission with bandwidth expansion. 101-105 - Meryem Benammar, Abdellatif Zaidi:
Rate-distortion region of a gray-wyner problem with side-information. 106-110 - Georg Pichler, Pablo Piantanida, Gerald Matz:
A multiple description CEO problem with log-loss distortion. 111-115 - Shun Watanabe:
Neyman-Pearson test for zero-rate multiterminal hypothesis testing. 116-120 - Boris Ryabko, Andrey Guskov, Irina Selivanova:
Using data-compressors for statistical analysis of problems on homogeneity testing and classification. 121-125 - Te Sun Han, Ryo Nomura:
First- and second-order hypothesis testing for mixed memoryless sources with general mixture. 126-130 - Elie Najm, Roy D. Yates, Emina Soljanin:
Status updates through M/G/1/1 queues with HARQ. 131-135 - Clement Kam, Sastry Kompella, Gam D. Nguyen, Jeffrey E. Wieselthier, Anthony Ephremides:
Information freshness and popularity in mobile caching. 136-140 - Roy D. Yates, Philippe Ciblat, Aylin Yener, Michèle Angela Wigger:
Age-optimal constrained cache updating. 141-145 - Simon R. Blackburn, Tuvi Etzion, Maura B. Paterson:
PIR schemes with small download complexity and low storage requirements. 146-150 - Hilal Asi, Eitan Yaakobi:
Nearly optimal constructions of PIR and batch codes. 151-155 - Christian Schindelhauer, Andreas Jakoby, Sven Köhler:
Cyclone codes. 156-160 - Haobo Wang, Sudarsan V. S. Ranganathan, Richard D. Wesel:
Approaching capacity using incremental redundancy without feedback. 161-165 - Swanand Kadhe, A. Robert Calderbank:
Rate optimal binary linear locally repairable codes with small availability. 166-170 - Jie Hao, Shu-Tao Xia, Bin Chen:
On optimal ternary locally repairable codes. 171-175 - M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
A study on the impact of locality in the decoding of binary cyclic codes. 176-180 - Mostafa Shahabinejad, Majid Khabbazian, Masoud Ardakani:
Locally repairable codes with the optimum average information locality. 181-185 - Lan V. Truong, Vincent Y. F. Tan:
Error exponent of the common-message broadcast channel with variable-length feedback. 186-190 - Ran Averbuch, Neri Merhav:
Exact random coding exponents and universal decoders for the degraded broadcast channel. 191-195 - Kasper Fløe Trillingsgaard, Wei Yang, Giuseppe Durisi, Petar Popovski:
Feedback halves the dispersion for some two-user broadcast channels with common message. 196-200 - Chih-Hua Chang, Chih-Chun Wang:
A new capacity-approaching protocol for general 1-to-K broadcast packet erasure channels with ACK/NACK. 201-205 - Lin Song, Fady Alajaji, Tamás Linder:
On the capacity of burst noise-erasure channels with and without feedback. 206-210 - Tao Liu, Guangyue Han:
The ARMA(k) Gaussian feedback capacity. 211-215 - Oron Sabag, Haim H. Permuter, Navin Kashyap:
An optimal coding scheme for the BIBO channel with a no-repeated-ones input constraint. 216-220 - Xu Zhang, Wei Cui, Yulong Liu:
Compressed sensing with prior information via maximizing correlation. 221-225 - Maxime Ferreira Da Costa, Wei Dai:
Low dimensional atomic norm representations in line spectral estimation. 226-230 - Yanting Ma, Cynthia Rush, Dror Baron:
Analysis of approximate message passing with a class of non-separable denoisers. 231-235 - Thomas Wiese, Lorenz Weiland, Wolfgang Utschick:
Inexact projected gradients on unions of subspaces. 236-240 - D. I. De Silva, N. Kodagoda, S. R. Kodituwakku, A. J. Pinidiyaarachchi:
Analysis and enhancements of a cognitive based complexity measure. 241-245 - Sichen Zhong, Yue Zhao:
Generic cospark of a matrix can be computed in polynomial time. 246-250 - Kazuyuki Amano:
Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy. 251-255 - Maciej Skorski:
On the complexity of estimating Rènyi divergences. 256-260 - Haobo Wang, Nathan Wong, Alexander M. Baldauf, Christopher K. Bachelor, Sudarsan V. S. Ranganathan, Dariush Divsalar, Richard D. Wesel:
An information density approach to analyzing and optimizing incremental redundancy with feedback. 261-265 - Deli Qiao:
Outage effective capacity of buffer-aided diamond relay systems using HARQ-IR. 266-270 - Ulrich Speidel, Sven Puchinger, Martin Bossert:
Constraints for coded tunnels across long latency bottlenecks with ARQ-based congestion control. 271-275 - Yi Li, Mustafa Cenk Gursoy, Senem Velipasalar:
Throughput of HARQ-IR with finite blocklength codes and QoS constraints. 276-280 - Rajai Nasser, Joseph M. Renes:
Polar codes for arbitrary classical-quantum channels and arbitrary cq-MACs. 281-285 - Hao-Chung Cheng, Min-Hsiu Hsieh, Marco Tomamichel:
Sphere-packing bound for symmetric classical-quantum channels. 286-290 - Mark M. Wilde, Marco Tomamichel, Mario Berta:
A meta-converse for private communication over quantum channels. 291-295 - Hao-Chung Cheng, Min-Hsiu Hsieh:
Moderate deviations for classical-quantum channels. 296-300 - Joseph M. Renes:
Duality of channels and codes. 299-306 - Zbigniew Golebiewski, Abram Magner, Wojciech Szpankowski:
Entropy of some general plane trees. 301-305 - Ayush Jain, Rakesh Kumar Bansal:
On optimality and redundancy of side information version of SWLZ. 306-310 - Takahiro Ota, Hiroyoshi Morita:
Two-dimensional source coding by means of subblock enumeration. 311-315 - Roy D. Yates, Elie Najm, Emina Soljanin, Jing Zhong:
Timely updates over an erasure channel. 316-320 - Yin Sun, Yury Polyanskiy, Elif Uysal-Biyikoglu:
Remote estimation of the Wiener process over a channel with random delay. 321-325 - Antzela Kosta, Nikolaos Pappas, Anthony Ephremides, Vangelis Angelakis:
Age and value of information: Non-linear age case. 326-330 - Roy D. Yates, Sanjit K. Kaul:
Status updates over unreliable multiaccess channels. 331-335 - Peter Beelen, Sven Puchinger, Johan Sebastian Rosenkilde:
Twisted reed-solomon codes. 336-340 - Shu Lin, Khaled A. S. Abdel-Ghaffar, Juane Li, Keke Liu:
Iterative soft-decision decoding of reed-solomon codes of prime lengths. 341-345 - Hoang Dau, Olgica Milenkovic:
Optimal repair schemes for some families of full-length reed-solomon codes. 346-350 - Hoang Dau, Iwan M. Duursma, Han Mao Kiah, Olgica Milenkovic:
Repairing reed-solomon codes with two erasures. 351-355 - Sven Puchinger, Johan Rosenkilde:
Decoding of interleaved Reed-Solomon codes using improved power decoding. 356-360 - Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Average spectra for ensembles of LDPC codes and applications. 361-365 - Dimitris Achlioptas, S. Hamed Hassani, Wei Liu, Rüdiger L. Urbanke:
Time-invariant LDPC convolutional codes. 366-370 - Yanfang Liu, Pablo M. Olmos, Tobias Koch:
On LDPC code ensembles with generalized constraints. 371-375 - Laurent Schmalen, Vahid Aref, Fanny Jardel:
Non-uniformly coupled LDPC codes: Better thresholds, smaller rate-loss, and less complexity. 376-380 - Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Reed-solomon based nonbinary globally coupled LDPC codes: Correction of random errors and bursts of erasures. 381-385 - Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Characterizing the rate-memory tradeoff in cache networks within a factor of 2. 386-390 - Chao Tian:
A computer-aided investigation on the fundamental limits of caching. 391-395 - An Liu, Vincent K. N. Lau, Giuseppe Caire:
Capacity scaling of wireless device-to-device caching networks under the physical model. 396-400 - Jingjing Zhang, Petros Elia:
Wireless coded caching: A topological perspective. 401-405 - Yufan Huang, Huaiyu Dai:
Multiplex conductance and gossip based information spreading in multiplex networks. 406-410 - Luca Barletta, Stefano Rini:
Capacity of discrete-time wiener phase noise channels to within a constant gap. 411-415 - Malcolm Egan, Samir Medina Perlaza, Vyacheslav Kungurtsev:
Capacity sensitivity in additive non-Gaussian noise channels. 416-420 - Omur Ozel, Sennur Ulukus, Pulkit Grover:
Communicating under temperature and energy harvesting constraints. 421-425 - Alex Dytso, Ronit Bustin, H. Vincent Poor, Shlomo Shamai Shitz:
On additive channels with generalized Gaussian noise. 426-430 - Anas Chaaban, Lav R. Varshney, Mohamed-Slim Alouini:
The capacity of injective semi-deterministic two-way channels. 431-435 - George V. Moustakides, Tony Yaacoub, Yajun Mei:
Sequential estimation based on conditional cost. 436-440 - Ronan Kerviche, Saikat Guha, Amit Ashok:
Fundamental limit of resolving two point sources limited by an arbitrary point spread function. 441-445 - Ashwin Pananjady, Martin J. Wainwright, Thomas A. Courtade:
Denoising linear models with permuted data. 446-450 - Saeid Haghighatshoar, Giuseppe Caire:
Signal recovery from unlabeled samples. 451-455 - Abhishek Agarwal, Larkin Flodin, Arya Mazumdar:
Estimation of sparsity via simple measurements. 456-460 - Qing He, Di Yuan, Anthony Ephremides:
On optimal link scheduling with deadlines for emptying a wireless network. 461-465 - Chang-Sik Choi, Jae Oh Woo, Jeffrey G. Andrews:
On the coverage probability of a spatially correlated network. 466-470 - Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Daniela Tuninetti:
Efficiently finding simple schedules in Gaussian half-duplex relay line networks. 471-475 - Dimitris Cheliotis, Ioannis Kontoyiannis, Michail Loulakis, Stavros Toumpis:
Exact speed and transmission cost in a simple one-dimensional wireless delay-tolerant network. 476-480 - Takayuki Nozaki, Takafumi Nakano, Tadashi Wadayama:
Analysis of breakdown probability of wireless sensor networks with unreliable relay nodes. 481-485 - R. M. Sundaram, Arup Kumar Das, Devendra Jalihal, Venkatesh Ramaiyan:
Optimal frame synchronization over a finite state Markov channel. 486-490 - Sidharth Jaggi, Michael Langberg:
Two-way interference channels with jammers. 491-495 - Christoph Rachinger, Ralf R. Müller, Johannes B. Huber:
Bit-interleaved coded modulation for phase shift keying on the hypersphere. 496-500 - Keigo Takeuchi:
Rigorous dynamics of expectation-propagation-based signal recovery from unitarily invariant measurements. 501-505 - Ezio Biglieri, Emanuele Viterbo:
Geometrically uniform differential vector signaling schemes. 506-510 - Thibault Lesieur, Léo Miolane, Marc Lelarge, Florent Krzakala, Lenka Zdeborová:
Statistical and computational phase transitions in spiked tensor estimation. 511-515 - Jinchi Chen, Yulong Liu:
Corrupted sensing with sub-Gaussian measurements. 516-520 - Huan Zhang, Yulong Liu, Hong Lei:
On the phase transition of corrupted sensing. 521-525 - Jinming Wen, Xiao-Wen Chang, Chintha Tellambura:
On the success probability of the box-constrained rounding and Babai detectors. 526-530 - Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang:
A characterization of sampling patterns for low-tucker-rank tensor completion problem. 531-535 - Stefan M. Moser, Michail Mylonakis, Ligong Wang, Michèle A. Wigger:
Asymptotic capacity results for MIMO wireless optical communication. 536-540 - Joyson Sebastian, Ayan Sengupta, Suhas N. Diggavi:
On capacity of noncoherent MIMO with asymmetric link strengths. 541-545 - Anas Chaaban, Aydin Sezgin, Mohamed-Slim Alouini:
On the degrees-of-freedom of the MIMO three-way channel with intermittent connectivity. 546-550 - Giorgio Taricco, Giuseppa Alfano:
Outage information rate of spatially correlated multi-cluster scattering MIMO channels. 551-555 - Sha Hu, Fredrik Rusek:
A generalized zero-forcing precoder for multiple antenna Gaussian broadcast channels. 556-560 - Yu-Pin Hsu, Eytan H. Modiano, Lingjie Duan:
Age of information: Design and analysis of optimal scheduling algorithms. 561-565 - Jing Zhong, Roy D. Yates, Emina Soljanin:
Backlog-adaptive compression: Age of information. 566-570 - Yoshiaki Inoue, Hiroyuki Masuyama, Tetsuya Takine, Toshiyuki Tanaka:
The stationary distribution of the age of information in FCFS single-server queues. 571-575 - Ahmed M. Bedewy, Yin Sun, Ness B. Shroff:
Age-optimal information updates in multihop networks. 576-580 - Ting-Yi Wu, Lav R. Varshney, Vincent Y. F. Tan:
Communication over a channel that wears out. 581-585 - Ishay Haviv, Michael Langberg, Moshe Schwartz, Eitan Yaakobi:
Non-linear cyclic codes that attain the Gilbert-Varshamov bound. 586-588 - Cheuk Ting Li, Abbas El Gamal:
Strong functional representation lemma and applications to coding theorems. 589-593 - Sihuang Hu, Nir Weinberger, Ofer Shayevitz:
On the VC-dimension of binary codes. 594-598 - Jonathan Detchart, Jérôme Lacan:
Polynomial ring transforms for efficient XOR-based erasure coding. 604-608 - Wentao Huang, Jehoshua Bruck