TIT 2010 - PDF Preprint Papers

TIT 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TIT-2010 Paper

click to vote

TIT
2010

300views Education» more TIT 2010»

Polar codes are optimal for lossy source coding

12 years 11 months ago

Download infoscience.epfl.ch

We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...

Satish Babu Korada, Rüdiger L. Urbanke

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	300	Polar codes are optimal for lossy source coding	claim
2	174	Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation	claim
3	173	Asymptotic critical transmission radius for k-connectivity in wireless ad hoc networks	claim
4	171	Analysis of orthogonal matching pursuit using the restricted isometry property	claim
5	170	Belief propagation estimation of protein and domain interactions using the sum-product algorithm	claim
6	170	Correcting charge-constrained errors in the rank-modulation scheme	claim
7	163	Power-controlled feedback and training for two-way MIMO channels	claim
8	161	MIMO Gaussian channels with arbitrary inputs: optimal precoding and power allocation	claim
9	160	Parameterized splitting systems for the discrete logarithm	claim
10	160	Bounds on the rate of 2-D bit-stuffing encoders	claim
11	158	Belief propagation, Dykstra's algorithm, and iterated information projections	claim
12	156	Bandwidth and power allocation for cooperative strategies in Gaussian relay networks	claim
13	155	On the capacity achieving covariance matrix for Rician MIMO channels: an asymptotic approach	claim
14	154	A universal scheme for Wyner-Ziv coding of discrete sources	claim
15	153	On the information rates of the plenoptic function	claim
16	150	Information-theoretic key agreement of multiple terminals: part I	claim
17	148	Compressed genotyping	claim
18	146	Cooperation with an untrusted relay: a secrecy perspective	claim
19	146	Information propagation speed in mobile and delay tolerant networks	claim
20	144	Lossy source compression using low-density generator matrix codes: analysis and algorithms	claim
21	144	Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel	claim
22	143	Asynchronous CDMA systems with random spreading-part I: fundamental limits	claim
23	141	Distributed averaging via lifted Markov chains	claim
24	140	On the analytic wavelet transform	claim
25	140	Capacity regions and sum-rate capacities of vector Gaussian interference channels	claim
26	140	Iterative decoding threshold analysis for LDPC convolutional codes	claim
27	138	Functional compression through graph coloring	claim
28	137	Average case analysis of multichannel sparse recovery using convex relaxation	claim
29	137	Channel coding rate in the finite blocklength regime	claim
30	137	Stable recovery of sparse signals and an oracle inequality	claim
31	136	The approximate capacity of the many-to-one and one-to-many Gaussian interference channels	claim
32	136	The existence of concatenated codes list-decodable up to the hamming bound	claim
33	133	Secure transmission with multiple antennas I: the MISOME wiretap channel	claim
34	131	Characterization of SINR region for interfering links with constrained power	claim
35	130	Affine Grassmann codes	claim
36	130	Pseudo-random functions and parallelizable modes of operations of a block cipher	claim
37	130	The power of convex relaxation: near-optimal matrix completion	claim
38	129	Channel-optimized quantum error correction	claim
39	129	Random access in wireless networks with overlapping cells	claim
40	129	Two-way source coding with a helper	claim
41	128	General classes of performance lower bounds for parameter estimation: part II: Bayesian bounds	claim
42	128	Shannon-theoretic limits on noisy compressive sampling	claim
43	125	Target detection via network filtering	claim
44	124	On the capacity of the precision-resolution system	claim
45	124	Storage coding for wear leveling in flash memories	claim
46	124	Soft-input soft-output single tree-search sphere decoding	claim
47	123	Outage exponents of block-fading channels with power allocation	claim
48	122	Biological information as set-based complexity	claim
49	122	Piecewise polynomial estimation of a regression function	claim
50	121	Power of a public random permutation and its application to authenticated encryption	claim
51	121	Mismatched estimation and relative entropy	claim
52	118	Joint sampling distribution between actual and estimated classification errors for linear discriminant analysis	claim
53	118	Counterexamples to a proposed stam inequality on finite groups	claim
54	118	On integer values of Kloosterman sums	claim
55	115	On resource allocation in fading multiple-access channels-an efficient approximate projection approach	claim
56	114	Multiuser MIMO achievable rates with downlink training and channel state	claim
57	114	Convergence of min-sum message-passing for convex optimization	claim
58	114	Duality for poset codes	claim
59	114	The balanced unicast and multicast capacity regions of large wireless networks	claim
60	113	Asynchronous CDMA systems with random spreading-part II: design criteria	claim
61	112	Asymmetric multilevel diversity coding and asymmetric Gaussian multiple descriptions	claim
62	112	Codes for deletion and insertion channels with segmented errors	claim
63	112	Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by random sampling	claim
64	112	Twice-universal simulation of Markov sources and individual sequences	claim
65	111	On correctable errors of binary linear codes	claim
66	111	Designing floating codes for expected performance	claim
67	111	Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications	claim
68	110	Error rates of the maximum-likelihood detector for arbitrary constellations: convex/concave behavior and applications	claim
69	110	On network interference management	claim
70	110	Secure communications with insecure feedback: breaking the high-SNR ceiling	claim
71	108	Optimal pairings	claim
72	107	On the efficiency of shortened cyclic single-burst-correcting codes	claim
73	107	On the optimum distance profiles about linear block codes	claim
74	107	Rate distortion and denoising of individual data using Kolmogorov complexity	claim
75	107	Optimal Error Correction for Computationally Bounded Noise	claim
76	107	Information inequalities for joint distributions, with interpretations and applications	claim
77	105	Multigroup ML decodable collocated and distributed space-time block codes	claim
78	105	DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models	claim
79	104	Nonparametric statistical inference for ergodic processes	claim
80	104	Semiorthogonal space-time block codes	claim
81	103	Codes in permutations and error correction for rank modulation	claim
82	103	Knuth's balanced codes revisited	claim
83	103	Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes	claim
84	103	Fast optimal decoding of multiplexed orthogonal designs by conditional optimization	claim
85	103	Performance bounds for erasure, list and decision feedback schemes with linear block codes	claim
86	102	On instantaneous relaying	claim
87	101	Wideband fading channel capacity with training and partial feedback	claim
88	101	Separation principles in wireless networking	claim
89	100	Theoretical and empirical results for recovery from multiple measurements	claim
90	100	Successive refinement of vector sources under individual distortion criteria	claim
91	99	Capacity of Channels With Action-Dependent States	claim
92	99	Squeezing the Arimoto-Blahut algorithm for faster convergence	claim
93	98	QR decomposition of Laurent polynomial matrices sampled on the unit circle	claim
94	98	Pruning network coding traffic by network coding: a new class of max-flow algorithms	claim
95	98	Pairwise intersession network coding on directed networks	claim
96	97	Periodic orbits and equilibria in glass models for gene regulatory networks	claim
97	97	Why does the Kronecker model result in misleading capacity estimates?	claim
98	96	Codes for asymmetric limited-magnitude errors with application to multilevel flash memories	claim
99	96	Beyond Nyquist: efficient sampling of sparse bandlimited signals	claim
100	96	Wavelet packets of fractional Brownian motion: asymptotic analysis and spectrum estimation	claim
101	96	New bounds for restricted isometry constants	claim
102	95	Wyner-Ziv coding over broadcast channels: digital schemes	claim
103	94	Rewriting codes for joint information storage in flash memories	claim
104	93	Matrix completion from a few entries	claim
105	93	Coordination capacity	claim
106	91	Correction to "on full diversity space-time block codes with partial interference cancellation group decoding"	claim
107	91	Physics of the shannon limits	claim
108	90	Correcting limited-magnitude errors in the rank-modulation scheme	claim
109	90	Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels	claim
110	88	Multiple-Input Multiple-Output Gaussian Broadcast Channels With Common and Confidential Messages	claim
111	88	Zero-rate feedback can achieve the empirical capacity	claim
112	88	Limits of performance of quantitative polymerase chain reaction systems	claim
113	87	Silence-based communication	claim
114	87	Population encoding with Hodgkin-Huxley neurons	claim
115	86	Distributed lossy averaging	claim
116	85	Typical peak sidelobe level of binary sequences	claim
117	85	Sparse non-Gaussian component analysis	claim
118	84	Constant-rank codes and their connection to constant-dimension codes	claim
119	84	Joint scheduling and resource allocation in CDMA systems	claim
120	83	Two-dimensional constrained coding based on tiling	claim
121	82	Symmetry breaking in soft clustering decoding of neural codes	claim
122	82	On the spectral efficiency of noncoherent doubly selective block-fading channels	claim
123	82	Average message delivery time for small-world networks in the continuum limit	claim
124	82	On the hops present in costas permutations	claim
125	81	Generalizing capacity: new definitions and capacity theorems for composite channels	claim
126	81	On the construction of skew quasi-cyclic codes	claim
127	81	Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes	claim
128	81	Rates of convergence of the functional k-nearest neighbor estimate	claim
129	80	Monotonicity, Thinning, and Discrete Versions of the Entropy Power Inequality	claim
130	80	Optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4	claim
131	76	Tighter bounds on the capacity of finite-state channels via Markov set-chains	claim
132	76	Uncertainty principles and vector quantization	claim
133	70	A lower bound on the optimum distance profiles of the second-order Reed-Muller codes	claim
134	61	Tunstall code, Khodak variations, and random walks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers