The following pages link to Igal Sason (Q383868):
Displaying 48 items.
- (Q220455) (redirect page) (← links)
- Tightened exponential bounds for discrete-time conditionally symmetric martingales with bounded jumps (Q383869) (← links)
- Improved lower bounds on the total variation distance for the Poisson approximation (Q2435772) (← links)
- Concentration of Measure Inequalities in Information Theory, Communications, and Coding (Q2871543) (← links)
- On Rényi Entropy Power Inequalities (Q2976401) (← links)
- $f$ -Divergence Inequalities (Q2976479) (← links)
- Projection Theorems for the Rényi Divergence on $\alpha $ -Convex Sets (Q2976618) (← links)
- On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem (Q2977031) (← links)
- On the Corner Points of the Capacity Region of a Two-User Gaussian Interference Channel (Q2977365) (← links)
- Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding (Q2978759) (← links)
- Achieving Marton’s Region for Broadcast Channels Using Polar Codes (Q2978767) (← links)
- Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels (Q2989361) (← links)
- Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity (Q3547478) (← links)
- On Achievable Rate Regions for the Gaussian Interference Channel (Q3547588) (← links)
- Parity-check density versus performance of binary linear block codes over memoryless symmetric channels (Q3547589) (← links)
- Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel (Q3547590) (← links)
- Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity (Q3548176) (← links)
- On the Error Exponents of Improved Tangential Sphere Bounds (Q3548226) (← links)
- Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications (Q3548260) (← links)
- On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications (Q3548287) (← links)
- Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes (Q3548894) (← links)
- Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes (Q3549022) (← links)
- An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels (Q3604469) (← links)
- Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598] (Q3604679) (← links)
- On interleaved, differentially encoded convolutional codes (Q4503481) (← links)
- Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum (Q4503522) (← links)
- On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes (Q4544670) (← links)
- Arimoto–Rényi Conditional Entropy and Bayesian $M$ -Ary Hypothesis Testing (Q4566615) (← links)
- Variations on the Gallager bounds, connections, and applications (Q4677625) (← links)
- On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders (Q4677626) (← links)
- Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels (Q4975754) (← links)
- Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel (Q4975882) (← links)
- On Universal Properties of Capacity-Approaching LDPC Code Ensembles (Q4975909) (← links)
- On Universal LDPC Code Ensembles Over Memoryless Symmetric Channels (Q5273481) (← links)
- Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes (Q5281338) (← links)
- Entropy Bounds for Discrete Random Variables via Maximal Coupling (Q5346243) (← links)
- Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures (Q5375578) (← links)
- Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial (Q5898666) (← links)
- Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial (Q5900269) (← links)
- Variations on the Gallager bounds with some applications (Q5951416) (← links)
- On $f$-Divergences: Integral Representations, Local Behavior, and Inequalities (Q6300470) (← links)
- On Data-Processing and Majorization Inequalities for $f$-Divergences with Applications (Q6328665) (← links)
- An Integral Representation of the Logarithmic Function with Applications in Information Theory (Q6330969) (← links)
- On Relations Between the Relative entropy and $\chi^2$-Divergence, Generalizations and Applications (Q6339301) (← links)
- Some Useful Integral Representations for Information-Theoretic Analyses (Q6340548) (← links)
- Information Inequalities via Submodularity and a Problem in Extremal Graph Theory (Q6397699) (← links)
- Observations on the Lov\'asz $\theta$-Function, Graph Capacity, Eigenvalues, and Strong Products (Q6422810) (← links)
- Observations on Graph Invariants with the Lov\'asz $\vartheta$-Function (Q6513982) (← links)
