2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)

publication venue for

Benefits of Jointly Training Autoencoders: An Improved Neural Tangent Kernel Analysis. 67:4669-4692. 2021
Infinite Families of Quantum-Classical Hybrid Codes. 67:2847-2856. 2021
A Coded Compressed Sensing Scheme for Unsourced Multiple Access. 66:6509-6533. 2020
Remarks on the Rényi Entropy of a Sum of IID Random Variables. 66:2898-2903. 2020
Capacity-Achieving Private Information Retrieval Codes From MDS-Coded Databases With Minimum Message Size. 66:4904-4916. 2020
On the Storage Cost of Private Information Retrieval. 66:7539-7549. 2020
Peak Age of Information in Priority Queuing Systems. 67:373-390. 2020
Weakly Secure Symmetric Multilevel Diversity Coding. 66:7033-7055. 2020
Capacity-Achieving Private Information Retrieval Codes With Optimal Message Size and Upload Cost. 65:7613-7627. 2019
Lattices Over Algebraic Integers With an Application to Compute-and-Forward. 64:6863-6877. 2018
LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel. 64:1561-1594. 2018
Caching and Delivery via Interference Elimination. 64:1548-1560. 2018
Approaching Capacity at High Rates With Iterative Hard-Decision Decoding. 63:5752-5773. 2017
Construction $pi _{A}$ and $pi _{D}$ Lattices: Construction, Goodness, and Decoding Algorithms. 63:5718-5733. 2017
Edge Coloring and Stopping Sets Analysis in Product Codes With MDS Components. 63:1439-1462. 2017
Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals. 63:3368-3385. 2017
Matched multiuser Gaussian source channel communications via uncoded schemes. 63:4155-4171. 2017
On the Tradeoff Region of Secure Exact-Repair Regenerating Codes. 63:7253-7266. 2017
Correction to “A Unifying Variational Perspective on Some Fundamental Information Theoretic Inequalities”. 62:4356-4357. 2016
Successive Omniscience. 62:3270-3289. 2016
Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes. 62:4024-4038. 2016
Multilevel Diversity Coding With Regeneration. 62:4833-4847. 2016
Coding for Parallel Gaussian Bidirectional Relay Channels: A Deterministic Approach. 62:260-271. 2015
Lattices Over Eisenstein Integers for Compute-and-Forward. 61:5306-5321. 2015
Broadcasting Correlated Vector Gaussians. 61:2465-2477. 2015
Gaussian State Amplification with Noisy Observations. 61:4587-4597. 2015
Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs. 61:1933-1947. 2015
Polar codes for multiple descriptions. 61:107-119. 2015
Systematic Error-Correcting Codes for Rank Modulation. 61:17-32. 2014
Private Broadcasting Over Independent Parallel Channels. 60:5173-5187. 2014
On the Relationships Among Optimal Symmetric Fix-Free Codes. 60:4567-4583. 2014
On the Relationships Among Optimal Symmetric Fix-Free Codes. 60:4567-4583. 2014
Distributed Compression of Linear Functions: Partial Sum-Rate Tightness and Gap to Optimal Sum-Rate. 60:2835-2855. 2014
Decentralized Learning for Multiplayer Multiarmed Bandits. 60:2331-2345. 2014
Secure Message Transmission With Small Public Discussion. 60:2373-2390. 2014
Optimality and approximate optimality of source-channel separation in networks. 60:904-918. 2014
Precoding for Outage Probability Minimization on Block Fading Channels. 59:8250-8266. 2013
A Deterministic Polynomial-Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks. 59:7541-7552. 2013
A Unifying Variational Perspective on Some Fundamental Information Theoretic Inequalities. 59:7132-7148. 2013
Multilevel Coding Schemes for Compute-and-Forward with Flexible Decoding. 59:7613-7631. 2013
Symmetrical Multilevel Diversity Coding and Subset Entropy Inequalities. 60:84-103. 2013
A Deterministic Polynomial-Time Algorithm for Constructing a Multicast Coding Scheme for Linear Deterministic Relay Networks. 59:7541-7552. 2013
A Unifying Variational Perspective on Some Fundamental Information Theoretic Inequalities. 59:7132-7148. 2013
On Modulo-Sum Computation Over an Erasure Multiple-Access Channel. 59:4129-4138. 2013
First-Passage Time and Large-Deviation Analysis for Erasure Channels with Memory. 59:5547-5565. 2013
Near-Optimal Quantization and Linear Network Coding for Relay Networks. 59:2777-2793. 2013
Trajectory Codes for Flash Memory. 59:4530-4541. 2013
Gaussian Robust Sequential and Predictive Coding. 59:3635-3652. 2013
Secure Symmetrical Multilevel Diversity Coding. 59:3572-3581. 2013
Capacity-achieving polar codes for arbitrarily permuted parallel channels. 59:1505-1516. 2013
Worst-Case Expected-Capacity Loss of Slow-Fading Channels. 59:3764-3779. 2013
New Results on Multiple-Input Multiple-Output Broadcast Channels With Confidential Messages. 59:1346-1359. 2013
Nonuniform Codes for Correcting Asymmetric Errors in Data Storage. 59:2988-3002. 2013
Code-Rate Selection, Queueing Behavior, and the Correlated Erasure Channel. 59:397-407. 2012
A New Sufficient Condition for Sum-Rate Tightness in Quadratic Gaussian Multiterminal Source Coding. 59:408-423. 2012
On Optimal and Achievable Fix-Free Codes. 58:5112-5129. 2012
A Factor Graph Approach to Clock Offset Estimation in Wireless Sensor Networks. 58:4244-4260. 2012
On the Equivalence Between Stein and De Bruijn Identities. 58:7045-7067. 2012
Optimal Function Computation in Directed and Undirected Graphs. 58:3407-3418. 2012
On the Capacity and Programming of Flash Memories. 58:1549-1564. 2012
Secret Writing on Dirty Paper: A Deterministic View. 58:3419-3429. 2012
Secure Network Coding for Wiretap Networks of Type II. 58:1361-1371. 2012
On Outage Capacity in the Low Power Regime. 58:888-896. 2012
The Sum-Rate Bound for a New Class of Quadratic Gaussian Multiterminal Source Coding Problems. 58:693-707. 2012
Minimum expected distortion in Gaussian source coding with fading side information. 58:5725-5739. 2012
On Effectiveness of Application-Layer Coding. 57:6673-6691. 2011
On the Sum-Rate Loss of Quadratic Gaussian Multiterminal Source Coding. 57:5588-5614. 2011
Low-Density Graph Codes for Coded Cooperation on Slow Fading Relay Channels. 57:4202-4218. 2011
Network Coding in Node-Constrained Line and Star Networks. 57:4452-4468. 2011
On Scalability of Routing Tables in Dense Flat-Label Wireless Networks. 57:4302-4314. 2011
Position Modulation Code for Rewriting Write-Once Memories. 57:3692-3697. 2011
Secret Writing on Dirty Paper: A Deterministic View. 58:3419-3429. 2011
A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks. 57:3005-3015. 2011
On Multiple Decoding Attempts for Reed–Solomon Codes: A Rate-Distortion Approach. 57:668-691. 2011
Approximate characterizations for the Gaussian source broadcast distortion region. 57:124-136. 2011
Latent capacity region: A case study on symmetric broadcast with common messages. 57:3273-3285. 2011
The achievable distortion region of sending a bivariate gaussian source on the gaussian broadcast channel. 57:6419-6427. 2011
Joint Physical Layer Coding and Network Coding for Bidirectional Relaying. 56:5641-5654. 2010
Multiple-Input Multiple-Output Gaussian Broadcast Channels with Common and Confidential Messages. 56:5477-5487. 2010
Joint Source Channel Coding with Side Information using Hybrid Digital Analog Codes. 56:4922-4940. 2010
Rewriting Codes for Joint Information Storage in Flash Memories. 56:5300-5313. 2010
Storage Coding for Wear Leveling in Flash Memories. 56:5290-5299. 2010
Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels. 56:4286-4300. 2010
Multiple-Input Multiple-Output Gaussian Broadcast Channels with Confidential Messages. 56:4215-4227. 2010
On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory. 56:3187-3195. 2010
On the Index Coding Problem and its Relation to Network Coding and Matroid Theory. 56:3187-3195. 2010
Coding for the Nonorthogonal Amplify-and-Forward Cooperative Channel. 56:2601-2610. 2010
On Minimum Variance Unbiased Estimation of Clock Offset in a Two-Way Message Exchange Mechanism. 56:2893-2904. 2010
Correcting Charge-Constrained Errors in the Rank-Modulation Scheme. 56:2112-2120. 2010
On the Construction of Skew Quasi-Cyclic Codes. 56:2081-2090. 2010
A Vector Generalization of Costa's Entropy-Power Inequality with Applications. 56:1865-1879. 2010
On the Multimessage Capacity Region for Undirected Ring Networks. 56:1930-1947. 2010
Queueing Analysis of a Butterfly Network for Comparing Network Coding to Classical Routing. 56:1890-1908. 2010
Joint Sampling Distribution Between Actual and Estimated Classification Errors for Linear Discriminant Analysis. 56:784-804. 2010
Asymmetric multilevel diversity coding and asymmetric Gaussian multiple descriptions. 56:4367-4387. 2010
New coding schemes for the symmetric K-description problem. 56:5344-5365. 2010
A Note on the Rate of Decay of Mean-Squared Error with SNR for the AWGN Channel. 56:332-335. 2010
Energy-Efficient Estimation of Clock Offset for Inactive Nodes in Wireless Sensor Networks. 56:582-596. 2010
The Capacity Region of the Degraded Multiple-Input Multiple-Output Compound Broadcast Channel. 55:5011-5023. 2009
A Note on the Secrecy Capacity of the Multiple-Antenna Wiretap Channel. 55:2547-2553. 2009
Rank Modulation for Flash Memories. 55:2659-2673. 2009
On Practical Design for Joint Distributed Source and Network Coding. 55:1709-1720. 2009
A coding algorithm for constant weight vectors: A geometric approach based on dissections. 55:1051-1060. 2009
Approximating the gaussian multiple description rate region under symmetric distortion constraints. 55:3869-3891. 2009
Multiple description coding for stationary Gaussian sources. 55:2868-2881. 2009
Remote vector gaussian source coding with decoder side information under mutual information and distortion constraints. 55:4676-4680. 2009
Clifford Code Constructions of Operator Quantum Error-Correcting Codes. 54:5760-5765. 2008
Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information. 54:3907-3928. 2008
On Multiterminal Source Code Design. 54:2278-2302. 2008
Space–Time Coding Techniques With Bit-Interleaved Coded Modulations for MIMO Block-Fading Channels. 54:2156-2178. 2008
User Cooperation in the Absence of Phase Information at the Transmitters. 54:1197-1206. 2008
Multiuser successive refinement and multiple description coding. 54:921-931. 2008
Side-information scalable source coding. 54:5591-5608. 2008
Successive refinement for hypothesis testing and lossless one-helper problem. 54:4666-4681. 2008
Successive refinement via broadcast: Optimizing expected distortion of a Gaussian source over a Gaussian fading channel. 54:2903-2918. 2008
On One-to-One Codes for Memoryless Cost Channels. 54:367-379. 2008
Multisource, Multidestination, Multirelay Wireless Networks. 53:3586-3595. 2007
Quality of Service Analysis for WirelessUser-Cooperation Networks. 53:3833-3842. 2007
On the Distortion SNR Exponent of Hybrid Digital–Analog Space–Time Coding. 53:2867-2878. 2007
Resource Allocation and Quality of Service Evaluation for Wireless Communication Systems Using Fluid Models. 53:1767-1777. 2007
Accurate Approximation of QAM Error Probability on Quasi-Static MIMO Channels and its Application to Adaptive Modulation. 53:1151-1160. 2007
On Quantum and Classical BCH Codes. 53:1183-1188. 2007
Communicating Probability Distributions. 53:518-525. 2007
On multistage successive refinement for Wyner-Ziv source coding with degraded side informations. 53:2946-2960. 2007
An MSE-Based Transfer Chart for Analyzing Iterative Decoding Schemes Using a Gaussian Approximation. 53:22-38. 2007
Network Tomography of Binary Network Performance Characteristics. 52:5373-5388. 2006
How Dense Should a Sensor Network Be for Detection with Correlated Observations?. 52:5099-5106. 2006
Nonbinary Stabilizer Codes Over Finite Fields. 52:4892-4914. 2006
Slepian–Wolf Coded Nested Lattice Quantization for Wyner–Ziv Coding: High-Rate Performance Analysis and Code Design. 52:4358-4379. 2006
Explicit Loss Inference in Multicast Tomography. 52:3852-3855. 2006
Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix. 52:3746-3756. 2006
On the $ heta $-Coverage and Connectivity of Large Random Networks. 52:2289-2299. 2006
On the Path-Loss Attenuation Regime for Positive Cost and Linear Scaling of Transport Capacity in Wireless Networks. 52:2313-2328. 2006
Opportunistic Orthogonal Writing on Dirty Paper. 52:1828-1846. 2006
On Code Design for the Slepian–Wolf Problem and Lossless Multiterminal Networks. 52:1495-1507. 2006
On Quasi-Cyclic Interleavers for Parallel Turbo Codes. 52:1732-1739. 2006
A/D Conversion With Imperfect Quantizers. 52:874-885. 2006
On Error Exponents of Modulo Lattice Additive Noise Channels. 52:454-471. 2006
Multiple description quantization via Gram-Schmidt orthogonalization. 52:5197-5217. 2006
On Dualities in Multiterminal Coding Problems. 52:307-315. 2006
Computing the Channel Capacity and Rate-Distortion Function With Two-Sided State Information. 51:4418-4425. 2005
Multidimensional Mappings for Iteratively Decoded BICM on Multiple-Antenna Channels. 51:3337-3346. 2005
Computing the Capacity of a MIMO Fading Channel Under PSK Signaling. 51:1794-1803. 2005
Learn More, Sample Less: Control of Volume and Variance in Network Measurement. 51:1756-1775. 2005
An Achievable Rate for the Multiple-Level Relay Channel. 51:1348-1358. 2005
On the Monomiality of Nice Error Bases. 51:1084-1089. 2005
The Transport Capacity of Wireless Networks Over Fading Channels. 51:834-847. 2005
Multicluster Interleaving on Paths and Cycles. 51:597-611. 2005
A Mass Formula and Rank of $BBZ_{4}$ Cyclic Codes of Length $2^{e}$. 50:3306-3312. 2004
On Space–Time Coding in the Presence of Spatio-Temporal Correlation. 50:1910-1926. 2004
Performance Bounds for Space–Time Block Codes with Receive Antenna Selection. 50:2130-2137. 2004
Distance Spectra and Performance Bounds of Space-Time Trellis Codes Over Quasi-Static Fading Channels. 50:1820-1831. 2004
Compression of Words Over a Partially Commutative Alphabet. 50:1425-1441. 2004
A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation. 50:748-767. 2004
Optimality and suboptimality of multiple-description vector quantization with a lattice codebook. 50:2458-2468. 2004
Universal multiple description scalar quantization: Analysis and design. 50:2089-2102. 2004
Product Accumulate Codes: A Class of Codes With Near-Capacity Performance and Low Decoding Complexity. 50:31-46. 2004
A Correction to the Proof of a Lemma in “The Capacity of Wireless Networks”. 49:3117-3117. 2003
Towards an Information Theory of Large Networks: An Achievable Rate Region. 49:1877-1894. 2003
Lattice Decoding for Joint Detection in Direct-Sequence CDMA Systems. 49:1030-1037. 2003
Beyond Stabilizer Codes I: Nice Error Bases. 48:2392-2395. 2002
Beyond Stabilizer Codes II: Clifford Codes. 48:2396-2399. 2002
Asymptotic Analysis of Blind Cyclic Correlation-Based Symbol-Rate Estimators. 48:1922-1934. 2002
Iterative Multiuser Joint Decoding: Unified Framework and Asymptotic Analysis. 48:1772-1793. 2002
Multicast Topology Inference From Measured End-To-End Loss. 48:26-45. 2002
Complementary Sequences for ISI Channel Estimation. 47:1145-1152. 2001
On Optimal Permutation Codes. 47:2961-2971. 2001
A probabilistic approach to some asymptotics in noiseless communication. 46:1246-1262. 2000
On random rotations diversity and minimum MSE decoding of lattices. 46:1584-1589. 2000
The capacity of wireless networks. 46:388-404. 2000
On a geometric view of multiuser detection for synchronous DS/CDMA channels. 46:2723-2731. 2000
Multicast-based inference of network-internal loss characteristics. 45:2462-2480. 1999
A universal lattice code decoder for fading channels. 45:1639-1642. 1999
Variable-to-fixed length codes and the conservation of entropy. 45:1612-1620. 1999
Signal space diversity: a power- and bandwidth-efficient diversity technique for the Rayleigh fading channel. 44:1453-1467. 1998
Redundancy of the Lempel-Ziv string matching code. 44:787-791. 1998
Data compression and harmonic analysis. 44:2435-2476. 1998
Multihead detection for multitrack recording channels. 44:2988-2997. 1998
Generalized Tunstall codes for sources with memory. 43:658-668. 1997
Redundancy of the Lempel-Ziv incremental parsing rule. 43:9-21. 1997
Good lattice constellations for both Rayleigh fading and Gaussian channels. 42:502-518. 1996
Coding for two-head recording systems. 41:747-755. 1995
Synchronizable codes for the optical OPPM channel. 40:1097-1107. 1994
Arithmetic coding for finite-state noiseless channels. 40:100-107. 1994
Modulation and coding for throughput-efficient optical systems. 40:1313-1326. 1994
Some notes on Varn coding. 40:181-186. 1994
Image compression through wavelet transform coding. 38:719-746. 1992
On the synchronizability and detectability of random PPM sequences. v:146-156. 1992
Some optimal and suboptimal receivers deriving information from nonsynchronized Poisson data. v:157-165. 1992
Sequence estimation and synchronization from nonsynchronized samples. 37:1649-1657. 1991
Optimum delay and sequence estimation from incomplete data. 36:202-208. 1990
On the synchronizability and detectability of random PPM sequences. 35:146-156. 1989
Some optimal and suboptimal receivers deriving information from nonsynchronized Poisson data. 35:157-165. 1989
On PPM sequences with good autocorrelation properties. 34:571-576. 1988
Comparison of generalized Q- function algorithms (Corresp.). 33:591-596. 1987
On the calculation of the generalizedQ-function via Parl's method (Corresp.). 32:817-824. 1986
The Trade-Off Between Privacy and Fidelity via Ehrhart Theory 2020
Latency Analysis for Distributed Coded Storage Systems 2019
A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems 2018
Coding for Secure Write-Efficient Memories 2016
Rank-Modulation Rewrite Coding for Flash Memories 2015
Generalized Cut-Set Bounds for Broadcast Networks 2015
On the Minimum Energy of Sending Correlated Sources Over the Gaussian MAC 2014
On the Generalized Gaussian CEO Problem 2012
A Digital Interface for Gaussian Relay and Interference Networks: Lifting Codes from the Discrete Superposition Model 2011
Near-Capacity Dirty-Paper Code Design: A Source-Channel Coding Approach 2009
On the Distortion SNR Exponent of Some Layered Transmission Schemes 2008
An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems 2007
On code design for the Slepian-Wolf problem and lossless multiterminal networks 2006

2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) Journal

Overview

publication venue for

Identity

International Standard Serial Number (ISSN)