Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 57
Volume 57, Number 1, January 2011
- Te Sun Han:
Multicasting Multiple Correlated Sources to Multiple Sinks Over a Noisy Channel Network. 4-13
- Aman Jain, Sanjeev R. Kulkarni, Sergio Verdú:
Multicasting in Large Wireless Networks: Bounds on the Minimum Energy Per Bit. 14-32 - Olivier Rioul
:
Information Theoretic Proofs of Entropy Power Inequalities. 33-55 - Wei Kang, Sennur Ulukus:
A New Data Processing Inequality and Its Applications in Distributed Source and Channel Coding. 56-69 - Manjesh Kumar Hanawal, Rajesh Sundaresan:
Guessing Revisited: A Large Deviations Approach. 70-78 - Aaron B. Wagner:
On Distributed Compression of Linear Functions. 79-94 - Yingbin Liang, Gerhard Kramer, H. Vincent Poor:
On the Equivalence of Two Achievable Regions for the Broadcast Channel. 95-100 - Yonatan Kaspi, Neri Merhav:
Error Exponents for Broadcast Channels With Degraded Message Sets. 101-123 - Chao Tian, Suhas N. Diggavi, Shlomo Shamai:
Approximate Characterizations for the Gaussian Source Broadcast Distortion Region. 124-136 - Ersen Ekrem, Sennur Ulukus:
Secrecy in Cooperative Relay Broadcast Channels. 137-155 - Vinod M. Prabhakaran, Pramod Viswanath:
Interference Channels With Source Cooperation. 156-186 - Vinod M. Prabhakaran, Pramod Viswanath:
Interference Channels With Destination Cooperation. 187-209 - Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor:
Noisy-Interference Sum-Rate Capacity of Parallel Gaussian Interference Channels. 210-226 - Dinkar Vasudevan, Satish Babu Korada:
Polymatroidal Flows on Two Classes of Information Networks. 227-233 - David Gesbert, Marios Kountouris:
Rate Scaling Laws in Multicell Networks Under Distributed Power Control and User Scheduling. 234-244 - Mehdi Rasti, Ahmad R. Sharafat, Jens Zander:
Pareto and Energy-Efficient Distributed Power Control With Feasibility Check in Wireless Networks. 245-255 - Murat Alanyali, Maxim Dashouk:
Occupancy Distributions of Homogeneous Queueing Systems Under Opportunistic Scheduling. 256-266 - Randy Cogill, Brooke Shrader, Anthony Ephremides:
Stable Throughput for Multicast With Random Linear Coding. 267-281 - Oliver Johnson, Matthew Aldridge, Robert J. Piechocki:
Interference Alignment-Based Sum Capacity Bounds for Random Dense Gaussian Interference Networks. 282-290 - Thanh Tùng Kim, H. Vincent Poor:
On the Secure Degrees of Freedom of Relaying With Half-Duplex Feedback. 291-302 - Qian Li, Kwok Hung Li, Kah Chan Teh:
Achieving Optimal Diversity-Multiplexing Tradeoff for Full-Duplex MIMO Multihop Relay Networks. 303-316 - Raymond H. Y. Louie, Matthew R. McKay, Iain B. Collings:
Open-Loop Spatial Multiplexing and Diversity Communications in Ad Hoc Networks. 317-344 - Vasanthan Raghavan, Akbar M. Sayeed:
Sublinear Capacity Scaling Laws for Sparse MIMO Channels. 345-364 - Natalia Silberstein, Tuvi Etzion:
Enumerative Coding for Grassmannian Space. 365-374 - Velimir M. Ilic, Miomir S. Stankovic, Branimir Todorovic:
Entropy Message Passing. 375-380 - Ido Tal, Ron M. Roth:
Convex Programming Upper Bounds on the Capacity of 2-D Constraints. 381-391 - Martianus Frederic Ezerman, Markus Grassl, Patrick Solé:
The Weights in MDS Codes. 392-396 - Changli Ma, Liwei Zeng, Yang Liu, Dengguo Feng, Cunsheng Ding:
The Weight Enumerator of a Class of Cyclic Codes. 397-402 - Shuo-Yen Robert Li, Qifu Tyler Sun:
Network Coding Theory Via Commutative Algebra. 403-415 - Min Tan, Raymond W. Yeung, Siu-Ting Ho, Ning Cai:
A Unified Framework for Linear Network Coding. 416-423 - Ning Cai, Raymond W. Yeung:
Secure Network Coding on a Wiretap Network. 424-435 - Minji Kim, Jay Kumar Sundararajan, Muriel Médard, Atilla Eryilmaz, Ralf Kötter:
Network Coding in a Multicast Switch. 436-460 - Aditya Ramamoorthy:
Minimum Cost Distributed Source Coding Over a Network. 461-475 - Animesh Kumar, Prakash Ishwar, Kannan Ramchandran:
High-Resolution Distributed Sampling of Bandlimited Fields With Low-Precision Sensors. 476-492 - Tingyao Xiong, Jonathan I. Hall:
Modifications of Modified Jacobi Sequences. 493-504 - Nam Yul Yu, Guang Gong:
Near-Complementary Sequences With Low PMEPR for Peak Power Control in Multicarrier Communications. 505-513 - Antonio Napolitano, Manlio Tesauro:
Almost-Periodic Higher Order Statistic Estimation. 514-533 - Georgios Fellouris, George V. Moustakides:
Decentralized Sequential Hypothesis Testing Using Asynchronous Communication. 534-548 - Giorgio Gnecco, Marcello Sanguineti:
On a Variational Norm Tailored to Variable-Basis Approximation Schemes. 549-558 - Laurent Jacques, David K. Hammond, Mohamed-Jalal Fadili:
Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine. 559-571 - Hongsong Shi, Shaoquan Jiang, Reihaneh Safavi-Naini, Mohammed Ashraful Tuhin:
On Optimal Secure Message Transmission by Public Discussion. 572-585 - Fatma Abdelkefi:
Correction to "Performance of Sigma-Delta Quantizations in Finite Frames". 586
Volume 57, Number 2, February 2011
- Iwan M. Duursma:
Two-Point Coordinate Rings for GK-Curves. 593-600 - Yingquan Wu:
On Expanded Cyclic and Reed-Solomon Codes. 601-620 - Vladimir Sidorenko, Lan Jiang, Martin Bossert:
Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes. 621-632 - Ralf Koetter, Jun Ma, Alexander Vardy:
The Re-Encoding Transformation in Algebraic List-Decoding of Reed-Solomon Codes. 633-647 - Arshad Ahmed, Ralf Koetter, Naresh R. Shanbhag:
VLSI Architectures for Soft-Decision Decoding of Reed-Solomon Codes. 648-667 - Phong S. Nguyen, Henry D. Pfister, Krishna R. Narayanan:
On Multiple Decoding Attempts for Reed-Solomon Codes: A Rate-Distortion Approach. 668-691 - Marcel Fernandez, José Moreira, Miguel Soriano:
Identifying Traitors Using the Koetter-Vardy Algorithm. 692-704 - Venkatesan Guruswami, Atri Rudra:
Soft Decoding, Dual BCH Codes, and Better List-Decodable varepsilon-Biased Codes. 705-717 - Venkatesan Guruswami, Johan Håstad, Swastik Kopparty:
On the List-Decodability of Random Linear Codes. 718-725 - G. David Forney Jr.:
Minimal Realizations of Linear Systems: The "Shortest Basis" Approach. 726-737 - Heide Gluesing-Luerssen, Elizabeth A. Weaver:
Linear Tail-Biting Trellises: Characteristic Generators and the BCJR-Construction. 738-751 - Ali Al-Bashabsheh, Yongyi Mao:
Normal Factor Graphs and Holographic Transformations. 752-763 - Mohsen Bayati, Andrea Montanari:
The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing. 764-785 - Jonathan S. Yedidia, Yige Wang, Stark C. Draper:
Divide and Concur and Difference-Map BP Decoders for LDPC Codes. 786-802 - Shrinivas Kudekar, Thomas J. Richardson, Rüdiger L. Urbanke:
Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC. 803-834 - Ali Emre Pusane, Roxana Smarandache, Pascal O. Vontobel, Daniel J. Costello Jr.:
Deriving Good LDPC Convolutional Codes from LDPC Block Codes. 835-857 - Shadi Abu-Surra, Dariush Divsalar, William E. Ryan:
Enumerators for Protograph-Based Ensembles of LDPC and Generalized LDPC Codes. 858-886 - Nissim Halabi, Guy Even:
LP Decoding of Regular LDPC Codes in Memoryless Channels. 887-897 - Wittawat Kositwattanarerk, Gretchen L. Matthews:
Lifting the Fundamental Cone and Enumerating the Pseudocodewords of a Parity-Check Code. 898-909 - Alexander Barg, Arya Mazumdar:
On the Number of Errors Correctable with Codes on Graphs. 910-919 - Michael Tüchler, Andrew C. Singer:
Turbo Equalization: An Overview. 920-952 - Hakim Alhussien, Jaekyun Moon:
The Error-Pattern-Correcting Turbo Equalizer: Spectrum Thinning at High SNRs. 953-971 - Ralf Koetter, Michelle Effros, Muriel Médard:
A Theory of Network Equivalence - Part I: Point-to-Point Channels. 972-995 - B. Javad Ebrahimi, Christina Fragouli:
Algebraic Algorithms for Vector Network Coding. 996-1007 - Michael Langberg, Alexander Sprintson:
On the Hardness of Approximating the Network Coding Capacity. 1008-1014 - Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
Network Coding for Computing: Cut-Set Bounds. 1015-1030 - Maximilien Gadouleau, Alban Goupil:
A Matroid Framework for Noncoherent Random Network Communications. 1031-1045 - Mahdi Jafari Siavoshani, Soheil Mohajer, Christina Fragouli, Suhas N. Diggavi:
On the Capacity of Noncoherent Network Coding. 1046-1066 - Theodoros K. Dikaliotis, Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Hongyi Yao, Michelle Effros, Jörg Kliewer, Elona Erez:
Multiple-Access Network Information-Flow and Correction Codes. 1067-1079 - Shurui Huang, Aditya Ramamoorthy, Muriel Médard:
Minimum Cost Mirror Sites Using Network Coding: Replication versus Coding at the Source Nodes. 1080-1091 - Atilla Eryilmaz, Desmond S. Lun, B. T. Swapna:
Control of Multi-Hop Communication Networks for Inter-Session Network Coding. 1092-1110 - Yao Li, Emina Soljanin, Predrag Spasojevic:
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding. 1111-1123 - Danilo Silva, Frank R. Kschischang:
Universal Secure Network Coding via Rank-Metric Codes. 1124-1135 - Chi Kin Ngai, Raymond W. Yeung, Zhixue Zhang:
Network Generalized Hamming Weight. 1136-1143 - Sukwon Kim, Tracey Ho, Michelle Effros, Amir Salman Avestimehr:
Network Error Correction With Unequal Link Capacities. 1144-1164 - Tuvi Etzion, Alexander Vardy:
Error-Correcting Codes in Projective Space. 1165-1173
Volume 57, Number 3, March 2011
- Yasutada Oohama:
Performance Analysis of the Interval Algorithm for Random Number Generation Based on Number Systems. 1177-1185 - Ofer Shayevitz, Meir Feder:
Optimal Feedback Communication Via Posterior Matching. 1186-1222 - Young-Han Kim, Amos Lapidoth, Tsachy Weissman:
Error Exponents for the Gaussian Channel With Active Noisy Feedback. 1223-1236 - Kostis Xenoulis, Nicholas Kalouptsidis:
Achievable Rates for Nonlinear Volterra Channels. 1237-1248 - Hon-Fah Chong, Mehul Motani:
On Achievable Rates for the General Relay Channel. 1249-1266 - Giacomo Como, Serdar Yüksel:
On the Capacity of Memoryless Finite-State Multiple-Access Channels With Asymmetric State Information at the Encoders. 1267-1273 - Abolfazl S. Motahari, Amir K. Khandani:
To Decode the Interference or to Consider It as Noise. 1274-1283 - Vasanthan Raghavan, Akbar M. Sayeed, Venugopal V. Veeravalli:
Semiunitary Precoding for Spatially Correlated MIMO Channels. 1284-1298 - Jagadeesh Harshan, B. Sundar Rajan:
On Two-User Gaussian Multiple Access Channels With Finite Input Constellations. 1299-1327 - Shuo-Yen Robert Li, Xuesong Jonathan Tan:
Mux/Demux Queues, FIFO Queues, and Their Construction by Fiber Memories. 1328-1343 - David I. Shuman, Mingyan Liu, Owen Q. Wu:
Energy-Efficient Transmission Scheduling With Strict Underflow Constraints. 1344-1367 - Srikanth Jagabathula, Devavrat Shah:
Fair Scheduling in Networks Through Packet Election. 1368-1381 - G. David Forney Jr.:
Codes on Graphs: Duality and MacWilliams Identities. 1382-1397 - Atri Rudra:
Limits to List Decoding of Random Codes. 1398-1408 - Shenghao Yang, Raymond W. Yeung, Chi Kin Ngai:
Refined Coding Bounds and Code Constructions for Coherent Network Error Correction. 1409-1424 - Changho Suh, Kannan Ramchandran:
Exact-Repair MDS Code Construction Using Interference Alignment. 1425-1442 - Jia Wang, Jun Chen, Lei Zhao, Paul Cuff, Haim H. Permuter:
On the Role of the Refinement Layer in Multiple Description Coding and Scalable Coding. 1443-1456 - Jian Lu, Qiao Wang:
On the Rate Loss of Multiple Sources Codes in the Wyner-Ziv Setting. 1457-1465 - Dominique Bontemps:
Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes. 1466-1478 - Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol:
Index Coding With Side Information. 1479-1494 - Dinesh Krithivasan, S. Sandeep Pradhan:
Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region. 1495-1519 - Sorina Dumitrescu:
Fast Encoder Optimization for Multi-Resolution Scalar Quantizer Design. 1520-1529 - Zongduo Dai, Guang Gong, Hong-Yeop Song, Dingfeng Ye:
Trace Representation and Linear Complexity of Binary eth Power Residue Sequences of Period p. 1530-1547 - David Gross:
Recovering Low-Rank Matrices From Few Coefficients in Any Basis. 1548-1566 - Venkatesh Saligrama, Manqi Zhao:
Thresholded Basis Pursuit: LP Algorithm for Order-Wise Optimal Support Recovery for Sparse and Approximately Sparse Signals From Noisy Random Measurements. 1567-1586 - Jayakrishnan Unnikrishnan, Dayu Huang, Sean P. Meyn, Amit Surana, Venugopal V. Veeravalli:
Universal and Composite Hypothesis Testing via Mismatched Divergence. 1587-1603 - Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli, Sean P. Meyn:
Minimax Robust Quickest Change Detection. 1604-1614 - Stilian Stoev, George Michailidis, Murad S. Taqqu:
Estimating Heavy-Tail Exponents Through Max Self-Similarity. 1615-1636 - Shahar Z. Kovalsky, Guy Cohen, Joseph M. Francos:
Strongly Consistent Estimation of the Sample Distribution of Noisy Continuous-Parameter Fields. 1637-1644 - Divyanshu Vats, José M. F. Moura:
Telescoping Recursive Representations and Estimation of Gauss-Markov Random Fields. 1645-1663 - Gérard Biau, Benoît Patra:
Sequential Quantile Prediction of Time Series. 1664-1674 - Yaron Rachlin, Rohit Negi, Pradeep K. Khosla:
The Sensing Capacity of Sensor Networks. 1675-1691 - Ery Arias-Castro:
Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions. 1692-1706 - Alexander Goldenshluger, Assaf Zeevi:
A Note on Performance Limitations in Bandit Problems With Side Information. 1707-1713 - Vincent Y. F. Tan, Animashree Anandkumar, Lang Tong, Alan S. Willsky:
A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures. 1714-1735 - Marc Mézard, Cristina Toninelli:
Group Testing With Random Pools: Optimal Two-Stage Algorithms. 1736-1745 - Ulrich Faigle, Alexander Schönhuth:
Efficient Tests for Equivalence of Hidden Markov Processes and Quantum Random Walks. 1746-1753 - Fernando G. S. L. Brandão, Nilanjana Datta:
One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps. 1754-1760 - Min-Hsiu Hsieh, Wen-Tai Yen, Li-Yi Hsu:
High Performance Entanglement-Assisted Quantum LDPC Codes Need Little Entanglement. 1761-1769 - Severin Winkler, Jürg Wullschleger, Stefan Wolf:
Bit Commitment From Nonsignaling Correlations. 1770-1779 - Yanbin Pan, Yingpu Deng:
A Ciphertext-Only Attack Against the Cai-Cusick Lattice-Based Public-Key Cryptosystem. 1780-1785 - Benoît Libert, Damien Vergnaud:
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption. 1786-1802 - Gregory Neven:
Efficient Sequential Aggregate Signed Data. 1803-1815 - Jung Hee Cheon, Stanislaw Jarecki, Taekyoung Kwon, Mun-Kyu Lee:
Fast Exponentiation Using Split Exponents. 1816-1826 - Axel Roch:
Claude E. Shannon, Spielzeug, Leben und die geheime Geschichte seiner Theorie der Information. 1827-1828
Volume 57, Number 4, April 2011
- Yury Polyanskiy, Harold Vincent Poor, Sergio Verdú:
Dispersion of the Gilbert-Elliott Channel. 1829-1848 - Laurent Guille,