Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 62
Volume 62, Number 1, January 2016
- Gérard D. Cohen, Emanuela Fachini, János Körner
:
Zero-Error Capacity of Binary Channels With Memory. 3-7
- Oron Sabag, Haim H. Permuter, Navin Kashyap:
The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint. 8-22 - Igal Sason:
On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem. 23-34 - Yury Polyanskiy, Yihong Wu:
Dissipation of Information in Channels With Input Constraints. 35-55 - Stefano Rini, Andrea J. Goldsmith:
A Unified Graphical Approach to Random Coding for Single-Hop Networks. 56-88 - Jie Hou, Gerhard Kramer:
Short Message Noisy Network Coding With a Decode-Forward Option. 89-107 - Yuval Domb, Meir Feder:
Non-Random Coding Error Bounds for Lattices. 108-120 - Yuval Domb, Ram Zamir, Meir Feder:
The Random Coding Bound Is Tight for the Average Linear Code or Lattice. 121-130 - Jos H. Weber, Kees A. Schouhamer Immink, Simon R. Blackburn:
Pearson Codes. 131-135 - Ryan Gabrys, Eitan Yaakobi, Farzad Farnoud, Frederic Sala, Jehoshua Bruck, Lara Dolecek:
Codes Correcting Erasures and Deletions for Rank Modulation. 136-150 - Yiwei Zhang, Gennian Ge:
Snake-in-the-Box Codes for Rank Modulation Under Kendall's τ-Metric. 151-158 - Lingfei Jin:
A Construction of Permutation Codes From Rational Function Fields and Improvement to the Gilbert-Varshamov Bound. 159-162 - Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson:
Searching for Binary and Nonbinary Block and Convolutional LDPC Codes. 163-183 - Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric de Portzamparc, Jean-Pierre Tillich:
Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups. 184-198 - Jincheng Zhuang, Qi Cheng, Jiyou Li:
On Determining Deep Holes of Generalized Reed-Solomon Codes. 199-207 - Jinfeng Du, Muriel Médard, Ming Xiao, Mikael Skoglund:
Scalable Capacity Bounding Models for Wireless Networks. 208-229 - Daniel Calabuig, Ramy H. Gohary, Halim Yanikomeroglu:
Optimum Transmission Through the Multiple-Antenna Gaussian Multiple Access Channel. 230-243 - Ranga Prasad, Srikrishna Bhashyam, Ananthanarayanan Chockalingam:
On the Gaussian Many-to-One X Channel. 244-259 - Yu-Chih Huang, Krishna R. Narayanan, Tie Liu:
Coding for Parallel Gaussian Bidirectional Relay Channels: A Deterministic Approach. 260-271 - Chang-Ick Song, Cong Ling:
On the Diversity of Linear Transceivers in MIMO AF Relaying Systems. 272-289 - Kevin Luo, Ramy H. Gohary, Halim Yanikomeroglu:
Exploiting the N-to-1 Mapping in Compress-and-Forward Relaying. 290-308 - Hamidreza Ebrahimzadeh Saffar, Masoud Badiei Khuzani, Patrick Mitran:
Time-Asynchronous Gaussian Multiple Access Relay Channel With Correlated Sources. 309-321 - Soheil Gherekhloo, Anas Chaaban, Chen Di, Aydin Sezgin:
(Sub-)Optimality of Treating Interference as Noise in the Cellular Uplink With Weak Interference. 322-356 - Galymzhan Nauryzbayev, Emad Alsusa:
Enhanced Multiplexing Gain Using Interference Alignment Cancellation in Multi-Cell MIMO Networks. 357-369 - Udo Schilcher, Stavros Toumpis, Martin Haenggi, Alessandro Crismani, Günther Brandner, Christian Bettstetter:
Interference Functionals in Poisson Networks. 370-383 - Silas L. Fong:
Classes of Delay-Independent Multimessage Multicast Networks With Zero-Delay Nodes. 384-400 - Alon Kipnis, Andrea J. Goldsmith, Yonina C. Eldar, Tsachy Weissman:
Distortion Rate Function of Sub-Nyquist Sampled Gaussian Sources. 401-429 - Patrick Schulte, Georg Böcherer:
Constant Composition Distribution Matching. 430-434 - Götz E. Pfander, David Francis Walnut:
Sampling and Reconstruction of Operators. 435-458 - Cédric Herzet, Angélique Dremeau, Charles Soussen:
Relaxed Recovery Conditions for OMP/OLS by Exploiting Both Coherence and Decay. 459-470 - Emmanuel Abbe, Afonso S. Bandeira, Georgina Hall:
Exact Recovery in the Stochastic Block Model. 471-487 - Masahiro Yukawa, Shun-ichi Amari:
ℓp-Regularized Least Squares (0<p<1) and Critical Path. 488-502 - Yudong Chen, Huan Xu, Constantine Caramanis, Sujay Sanghavi:
Matrix Completion With Column Manipulation: Near-Optimal Sample-Robustness-Rank Tradeoffs. 503-526 - Richard Nock, Frank Nielsen, Shun-ichi Amari:
On Conformal Divergences and Their Population Minimizers. 527-538 - Mutsuki Kojima, Fumiyasu Komaki:
Relations Between the Conditional Normalized Maximum Likelihood Distributions and the Latent Information Priors. 539-553 - Dan Stahlke:
Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory. 554-577 - David Sutter, Tobias Sutter, Peyman Mohajerin Esfahani, Renato Renner:
Efficient Approximation of Quantum Channel Capacities. 578-598 - Sebastià Martín Molleví, Carles Padró, An Yang:
Secret Sharing, Rank Inequalities, and Information Inequalities. 599-609 - Chaoyun Li, Xiangyong Zeng, Chunlei Li, Tor Helleseth, Ming Li:
Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials. 610-624
Volume 62, Number 2, February 2016
- Ville Junnila, Tero Laihonen:
Information Retrieval With Varying Number of Input Clues. 625-638 - Antonia Wachter-Zeh, Eitan Yaakobi:
Codes for Partially Stuck-At Memory Cells. 639-654 - José Joaquín Bernal, Diana H. Bueno-Carreño, Juan Jacobo Simón:
Apparent Distance and a Notion of BCH Multivariate Codes. 655-668 - Joan-Josep Climent, Diego Napp, Carmen Perea, Raquel Pinto:
Maximum Distance Separable 2D Convolutional Codes. 669-680 - Alonso Sepúlveda Castellanos, Guilherme Chaud Tizziotti:
Two-Point AG Codes on the GK Maximal Curves. 681-686 - Steven T. Dougherty, Josep Rifà, Mercè Villanueva:
Ranks and Kernels of Codes From Generalized Hadamard Matrices. 687-694 - Yang Ding:
On the List Decodability of Burst Errors. 695-702 - Farzad Farnoud Hassanzadeh, Moshe Schwartz, Jehoshua Bruck:
Bounds for Permutation Rate-Distortion. 703-712 - Mohamed F. Mansour:
Turbo Quantization of Oversampled Signals. 713-723 - Sorina Dumitrescu:
On the Design of Optimal Noisy Channel Scalar Quantizer with Random Index Assignment. 724-735 - Inaki Estella Aguerri, Deniz Gündüz:
Joint Source-Channel Coding With Time-Varying Channel and Side-Information. 736-753 - Ge Xu, Wei Liu, Biao Chen:
A Lossy Source Coding Interpretation of Wyner's Common Information. 754-768 - Kumar B. Viswanatha, Emrah Akyol, Kenneth Rose:
Combinatorial Message Sharing and a New Achievable Region for Multiple Descriptions. 769-792 - Aravind R. Iyengar, Paul H. Siegel, Jack Keil Wolf:
On the Capacity of Channels With Timing Synchronization Errors. 793-810 - Farzad Farnoud Hassanzadeh, Moshe Schwartz, Jehoshua Bruck:
The Capacity of String-Duplication Systems. 811-824 - Tal Kopetz, Haim H. Permuter, Shlomo Shamai Shitz:
Multiple Access Channels With Combined Cooperation and Partial Cribbing. 825-848 - Mingyue Ji, Giuseppe Caire, Andreas F. Molisch:
Fundamental Limits of Caching in Wireless D2D Networks. 849-869 - Tasuku Soma:
Multicasting in Linear Deterministic Relay Network by Matrix Completion. 870-875 - Gilles Brassard, Luc Devroye, Claude Gravel:
Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution. 876-890 - Runyao Duan, Andreas J. Winter:
No-Signalling-Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovász Number. 891-914 - Christoph Hirche, Ciara Morgan, Mark M. Wilde:
Polar Codes in Network Quantum Information Theory. 915-924 - Quan Geng, Pramod Viswanath:
The Optimal Noise-Adding Mechanism in Differential Privacy. 925-951 - Quan Geng, Pramod Viswanath:
Optimal Noise Adding Mechanisms for Approximate Differential Privacy. 952-969 - Pengwei Wang, Reihaneh Safavi-Naini:
A Model for Adversarial Wiretap Channels. 970-983 - Jingbo Liu, Paul W. Cuff, Sergio Verdú:
Key Capacity for Product Sources With Application to Stationary Gaussian Processes. 984-1005 - Philippe Gaborit, Olivier Ruatta, Julien Schrek:
On the Complexity of the Rank Syndrome Decoding Problem. 1006-1019 - Alexander Daniel Jones, Ben Adcock, Anders C. Hansen:
On Asymptotic Incoherence and Its Implications for Compressed Sensing of Inverse Problems. 1020-1037 - Amichai Painsky, Saharon Rosset, Meir Feder:
Generalized Independent Component Analysis Over Finite Alphabets. 1038-1053 - Yanjun Han, Yuan Shen, Xiao-Ping Zhang, Moe Z. Win, Huadong Meng:
Performance Limits and Geometric Properties of Array Localization. 1054-1075 - Ki-Hyeon Park, Hong-Yeop Song, Dae San Kim, Solomon W. Golomb:
Optimal Families of Perfect Polyphase Sequences From the Array Structure of Fermat-Quotient Sequences. 1076-1086 - Han Cai, Yang Yang, Zhengchun Zhou, Xiaohu Tang:
Strictly Optimal Frequency-Hopping Sequence Sets With Optimal Family Sizes. 1087-1093
Volume 62, Number 3, March 2016
- Mahdi Cheraghchi, Venkatesan Guruswami:
Capacity of Non-Malleable Codes. 1097-1118 - Yury Polyanskiy:
Upper Bound on List-Decoding Radius of Binary Codes. 1119-1128 - Toni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Constructions and Properties of Linear Locally Repairable Codes. 1129-1143 - Simon R. Blackburn:
Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch. 1144-1149 - Marcelo Firer, Judy L. Walker:
Matched Metrics and Channels. 1150-1156 - Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace Polynomials and Cyclic Subspace Codes. 1157-1165 - Chunming Tang, Nian Li, Yanfeng Qi, Zhengchun Zhou, Tor Helleseth:
Linear Codes With Two or Three Weights From Weakly Regular Bent Functions. 1166-1176 - Torleiv Kløve:
Two Constructions of Covering Sets for Limited-Magnitude Errors. 1177-1182 - Cristobal Camarero, Carmen Martínez:
Quasi-Perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension. 1183-1192 - Christoph Bunte, Amos Lapidoth:
Maximum Rényi Entropy Rate. 1193-1205 - Kostas N. Oikonomou, Peter D. Grünwald:
Explicit Bounds for Entropy Concentration Under Linear Constraints. 1206-1230 - Ritesh Kolte, Ayfer Özgür, Haim H. Permuter:
Cooperative Binning for Semideterministic Channels. 1231-1249 - Arun Padakandla, Aria Ghasemian Sahebi, S. Sandeep Pradhan:
An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes. 1250-1279 - Inaki Estella Aguerri, Deniz Gündüz:
Capacity of a Class of State-Dependent Orthogonal Relay Channels. 1280-1295 - Shraga I. Bross, Yaron Laufer:
Sending a Bivariate Gaussian Source Over a Gaussian MAC With Unidirectional Conferencing Encoders. 1296-1311 - Borzoo Rassouli, Chenxi Hao, Bruno Clerckx:
DoF Analysis of the MIMO Broadcast Channel With Alternating/Hybrid CSIT. 1312-1325 - Rui Wang, Xiaojun Yuan, Raymond W. Yeung:
MIMO Multipair Two-Way Relaying With Distributed Relays: Joint Signal Alignment and Interference Neutralization. 1326-1343 - Namyoon Lee, François Baccelli, Robert W. Heath Jr.:
Spectral Efficiency Scaling Laws in Dense Random Wireless Networks With Multiple Receive Antennas. 1344-1359 - Clement Kam, Sastry Kompella, Gam D. Nguyen, Anthony Ephremides:
Effect of Message Transmission Path Diversity on Status Age. 1360-1374 - Mustafa Ozmen, Mustafa Cenk Gursoy:
Wireless Throughput and Energy Efficiency With Random Arrivals and Statistical Queuing Constraints. 1375-1395 - Bicheng Ying, Ali H. Sayed:
Information Exchange and Learning Dynamics Over Weakly Connected Adaptive Networks. 1396-1414 - Andreas J. Winter, Dong Yang:
Potential Capacities of Quantum Channels. 1415-1424 - Mario Berta, Matthias Christandl, Dave Touchette:
Smooth Entropy Bounds on One-Shot Quantum State Redistribution. 1425-1439 - Rotem Arnon Friedman, Renato Renner, Thomas Vidick:
Non-Signaling Parallel Repetition Using de Finetti Reductions. 1440-1457 - Andrea Montanari, Emile Richard:
Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics. 1458-1484 - Erwan Scornet:
Random Forests and Kernel Methods. 1485-1500 - Alexander Jung, Yonina C. Eldar, Norbert Goertz:
On the Minimax Risk of Dictionary Learning. 1501-1515 - Kyle Luh, Van H. Vu:
Dictionary Learning With Few Samples and Matrix Concentration. 1516-1527 - Yaniv Plan, Roman Vershynin:
The Generalized Lasso With Non-Linear Observations. 1528-1537
Volume 62, Number 4, April 2016
- Eitan Yaakobi, Jehoshua Bruck, Paul H. Siegel:
Constructions and Decoding of Cyclic Codes Over b-Symbol Read Channels. 1541-1551 - Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi:
Efficient Search of Girth-Optimal QC-LDPC Codes. 1552-1564 - Oktay Olmez, Aditya Ramamoorthy:
Fractional Repetition Codes With Flexible Repair From Combinatorial Designs. 1565-1591 - Ankit Singh Rawat, Zhao Song, Alexandros G. Dimakis, Anna Gál:
Batch Codes Through Dense Graphs Without Short Cycles. 1592-1604 - Netanel Raviv, Antonia Wachter-Zeh:
Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius. 1605-1615 - Tuvi Etzion, Elisa Gorla, Alberto Ravagnani, Antonia Wachter-Zeh:
Optimal Ferrers Diagram Rank-Metric Codes. 1616-1630 - Xishuo Liu, Stark C. Draper:
LP-Decodable Multipermutation Codes. 1631-1648 - Sarit Buzaglo, Eitan Yaakobi:
On the Capacity of Constrained Permutation Codes for Rank Modulation. 1649-1666 - Emmanuel Abbe, Noga Alon, Afonso S. Bandeira, Colin Sandon:
Linear Boolean Classification, Coding and the Critical Problem. 1667-1673 - Amin Emad, Olgica Milenkovic:
Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing With Nonuniform Thresholds. 1674-1687 - Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
Semiconstrained Systems. 1688-1702 - Shuxing Li, Maosheng Xiong, Gennian Ge:
Pseudo-cyclic Codes and the Construction of Quantum MDS Codes. 1703-1710 - Markus P. Mueller, Michele Pastena:
A Generalization of Majorization that Characterizes Shannon Entropy. 1711-1720 - Daniel Cariello:
Completely Reducible Maps in Quantum Information Theory. 1721-1732 - Siddharth Karumanchi, Stefano Mancini, Andreas J. Winter, Dong Yang:
Quantum Channel Capacities With Passive Environment Assistance. 1733-1747 - Yifeng Teng, Shenghao Yang, Siwei Wang, Mingfei Zhao:
Tight Bound on Randomness for Violating the Clauser-Horne-Shimony-Holt Inequality. 1748-1757 - Mario Berta, Marco Tomamichel:
The Fidelity of Recovery Is Multiplicative. 1758-1763 - Kia Khezeli, Jun Chen:
A Source-Channel Separation Theorem With Application to the Source Broadcast Problem. 1764-1781 - Hyeji Kim, Benjamin Nachman, Abbas El Gamal:
Superposition Coding Is Almost Always Optimal for the Poisson Broadcast Channel. 1782-1794 - Masahito Hayashi, Shun Watanabe:
Uniform Random Number Generation From Markov Chains: Non-Asymptotic and Asymptotic Analyses. 1795-1822 - Yinfei Xu, Qiao Wang:
Rate Region of the Vector Gaussian CEO Problem With the Trace Distortion Constraint. 1823-1835 - Eva C. Song, Paul Cuff, H. Vincent Poor:
The Likelihood Encoder for Lossy Compression. 1836-1849 - Satyajit Thakor, Alex J. Grant, Terence Chan:
Cut-Set Bounds on Network Information Flow. 1850-1865 - Changho Suh, Naveen Goela, Michael Gastpar:
Computation in Multicast Networks: Function Alignment and Converse Theorems. 1866-1877 - Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran:
Efficient Algorithms for the Data Exchange Problem. 1878-1896 - Maice Costa, Marian Codreanu, Anthony Ephremides:
On the Age of Information in Status Update Systems With Packet Management. 1897-1910