On the public citation graph
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial
0 signed · 327 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/ett.4460060510openalex-snapshot
Weight distributions and bounds for turbo‐codes
inferredcites →https://doi.org/10.1002/ett.4460110304openalex-snapshot
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
inferredcites →https://doi.org/10.1002/j.1538-7305.1959.tb03905.xopenalex-snapshot
Probability of Error for Optimal Codes in a Gaussian Channel
inferredcites →https://doi.org/10.1007/3-540-46796-3_2openalex-snapshot
RA Codes Achieve AWGN Channel Capacity
inferredcites →https://doi.org/10.1007/3-540-54303-1_146openalex-snapshot
Chernoff bound of trellis coded modulation over correlated rayleigh channel
inferredcites →https://doi.org/10.1007/978-1-4613-0165-3_11openalex-snapshot
BSC Thresholds for Code Ensembles Based on “Typical Pairs” Decoding
inferredcites →https://doi.org/10.1007/bf02998578openalex-snapshot
New results on serial concatenated and accumulated-convolutional turbo code performance
inferredcites →https://doi.org/10.1007/bf02998579openalex-snapshot
Bounds on the error probability ofml decoding for block and turbo-block codes
inferredcites →https://doi.org/10.1007/bf02998580openalex-snapshot
Comparison of iterative decoder performance with union bounds for short frame turbo codes
inferredcites →https://doi.org/10.1007/bf02998585openalex-snapshot
Serial concatenation of interleaved convolutional codes andM-ary continuous phase modulations
inferredcites →https://doi.org/10.1007/bf02999683openalex-snapshot
The random coded modulation: performance and euclidean distance spectrum evaluation
inferredcites →https://doi.org/10.1007/s100510070085openalex-snapshot
Turbo codes: the phase transition
inferredcites →https://doi.org/10.1016/0012-365x(92)90579-5openalex-snapshot
On the weight enumerator of product codes
inferredcites →https://doi.org/10.1016/c2013-0-10754-4openalex-snapshot
Table of Integrals, Series, and Products
inferredcites →https://doi.org/10.1016/s0012-365x(96)00107-0openalex-snapshot
A lower bound on the probability of a union
inferredcites →https://doi.org/10.1016/s0012-365x(99)00246-0openalex-snapshot
A lower bound on the probability of a finite union of events
inferredcites →https://doi.org/10.1016/s0019-9958(67)91200-4openalex-snapshot
Lower bounds to error probability for coding on discrete memoryless channels. II
inferredcites →https://doi.org/10.1017/s0021900200104164openalex-snapshot
An upper bound for the probability of a union
inferredcites →https://doi.org/10.1049/el:19970362openalex-snapshot
Near Shannon limit performance of low density paritycheck codes
inferredcites →https://doi.org/10.1049/el:19981198openalex-snapshot
Performance bounds of continuous and blockwisedecoded turbo codes in Rician fading channel
inferredcites →https://doi.org/10.1049/el:19991464openalex-snapshot
Approach for deriving performance bounds ofpunctured turbo codes
inferredcites →https://doi.org/10.1049/el:20000478openalex-snapshot
Evaluation of transfer functions for puncturedturbo codes
inferredcites →https://doi.org/10.1049/el:20010496openalex-snapshot
Maximum likelihood decoding bounds for high rateturbocodes over Lorentzian channels
inferredcites →https://doi.org/10.1049/ip-com:20000826openalex-snapshot
Improved union bounds on turbo codes performance
inferredcites →https://doi.org/10.1088/0305-4470/36/43/032openalex-snapshot
Average and reliability error exponents in low-density parity-check codes
inferredcites →https://doi.org/10.1103/physreve.66.046120openalex-snapshot
Dynamic phase transition for decoding algorithms
inferredcites →https://doi.org/10.1109/18.144721openalex-snapshot
On computing the weight spectrum of cyclic codes
inferredcites →https://doi.org/10.1109/18.335901openalex-snapshot
Techniques of bounding the probability of decoding error for block coded modulation structures
inferredcites →https://doi.org/10.1109/18.335935openalex-snapshot
Bounds on the decoding error probability of binary linear codes via their spectra
inferredcites →https://doi.org/10.1109/18.340469openalex-snapshot
On information rates for mismatched decoders
inferredcites →https://doi.org/10.1109/18.382038openalex-snapshot
A lower bound on the error probability for signals in white Gaussian noise
inferredcites →https://doi.org/10.1109/18.45271openalex-snapshot
A fast algorithm for computing distance spectrum of convolutional codes
inferredcites →https://doi.org/10.1109/18.481810openalex-snapshot
Voronoi regions for binary linear block codes
inferredcites →https://doi.org/10.1109/18.485713openalex-snapshot
Unveiling turbo codes: some results on parallel concatenated coding schemes
inferredcites →https://doi.org/10.1109/18.532911openalex-snapshot
The weight distribution of the third-order Reed-Muller code of length 512
inferredcites →https://doi.org/10.1109/18.605611openalex-snapshot
The weight distributions of extended binary primitive BCH codes of length 128
inferredcites →https://doi.org/10.1109/18.61116openalex-snapshot
On the error probability of signals in additive white Gaussian noise
inferredcites →https://doi.org/10.1109/18.669119openalex-snapshot
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
inferredcites →https://doi.org/10.1109/18.720542openalex-snapshot
Modulation and coding for linear Gaussian channels
inferredcites →https://doi.org/10.1109/18.720551openalex-snapshot
Fading channels: information-theoretic and communications aspects
inferredcites →https://doi.org/10.1109/18.737529openalex-snapshot
A comparison of known codes, random codes, and the best codes
inferredcites →https://doi.org/10.1109/18.737535openalex-snapshot
On the Voronoi neighbor ratio for binary linear block codes
inferredcites →https://doi.org/10.1109/18.737550openalex-snapshot
A lower bound on the error probability for signals in white Gaussian noise
inferredcites →https://doi.org/10.1109/18.771140openalex-snapshot
Multilevel codes: theoretical concepts and practical design rules
inferredcites →https://doi.org/10.1109/18.771235openalex-snapshot
Evaluating the performance of convolutional codes over block fading channels
inferredcites →https://doi.org/10.1109/18.771236openalex-snapshot
On the weight distribution of terminated convolutional codes
inferredcites →https://doi.org/10.1109/18.782147openalex-snapshot
Random coding techniques for nonrandom codes
inferredcites →https://doi.org/10.1109/18.782170openalex-snapshot
Which codes have cycle-free Tanner graphs?
inferredcites →https://doi.org/10.1109/18.796409openalex-snapshot
On interleaved, differentially encoded convolutional codes
inferredcites →https://doi.org/10.1109/18.817506openalex-snapshot
Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
inferredcites →https://doi.org/10.1109/18.817517openalex-snapshot
On coding for block fading channels
inferredcites →https://doi.org/10.1109/18.887846openalex-snapshot
Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit
inferredcites →https://doi.org/10.1109/18.910577openalex-snapshot
The capacity of low-density parity-check codes under message-passing decoding
inferredcites →https://doi.org/10.1109/18.910578openalex-snapshot
Design of capacity-approaching irregular low-density parity-check codes
inferredcites →https://doi.org/10.1109/18.915684openalex-snapshot
Performance bounds for high rate linear codes over partial-response channels
inferredcites →https://doi.org/10.1109/18.923750openalex-snapshot
Tighter bounds on the error probability of fixed convolutional codes
inferredcites →https://doi.org/10.1109/18.945248openalex-snapshot
On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes
inferredcites →https://doi.org/10.1109/18.959254openalex-snapshot
Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
inferredcites →https://doi.org/10.1109/18.992777openalex-snapshot
On ensembles of low-density parity-check codes: asymptotic distance distributions
inferredcites →https://doi.org/10.1109/18.995552openalex-snapshot
Fading channels: how perfect need "perfect side information" be?
inferredcites →https://doi.org/10.1109/18.995649openalex-snapshot
An average weight-distance enumerator for binary expansions of Reed-Solomon codes
inferredcites →https://doi.org/10.1109/26.129197openalex-snapshot
Bounds on the error performance of coding for nonindependent Rician-fading channels
inferredcites →https://doi.org/10.1109/26.141419openalex-snapshot
A simple upper bound on the error probability for orthogonal signals in white noise
inferredcites →https://doi.org/10.1109/26.310602openalex-snapshot
Chernoff bound of trellis-coded modulation over correlated fading channels
inferredcites →https://doi.org/10.1109/26.328978openalex-snapshot
Achievable performance over the correlated Rician channel
inferredcites →https://doi.org/10.1109/26.489088openalex-snapshot
The error probability of M-ary PSK block coded modulation schemes
inferredcites →https://doi.org/10.1109/26.536907openalex-snapshot
On the weight distribution of linear block codes formed from convolutional codes
inferredcites →https://doi.org/10.1109/26.539767openalex-snapshot
Near optimum error correcting coding and decoding: turbo-codes
inferredcites →https://doi.org/10.1109/26.659479openalex-snapshot
Some new twists to problems involving the Gaussian probability integral
inferredcites →https://doi.org/10.1109/26.681398openalex-snapshot
New performance bounds for turbo codes
inferredcites →https://doi.org/10.1109/26.764924openalex-snapshot
Performance bounds for turbo-coded modulation systems
inferredcites →https://doi.org/10.1109/26.774833openalex-snapshot
A serial concatenation approach to iterative demodulation and decoding
inferredcites →https://doi.org/10.1109/26.795818openalex-snapshot
The union bound for turbo-coded modulation systems over fading channels
inferredcites →https://doi.org/10.1109/26.911451openalex-snapshot
Performance analysis of turbo-equalized partial response channels
inferredcites →https://doi.org/10.1109/26.917774openalex-snapshot
Performance of trellis-coded CPM with iterative demodulation and decoding
inferredcites →https://doi.org/10.1109/26.966054openalex-snapshot
Serially concatenated continuous phase modulation with iterative decoding
inferredcites →https://doi.org/10.1109/4234.585802openalex-snapshot
Performance of continuous and blockwise decoded turbo codes
inferredcites →https://doi.org/10.1109/4234.831034openalex-snapshot
Improved upper bounds on the ensemble performance of ML decoded low density parity check codes
inferredcites →https://doi.org/10.1109/4234.846501openalex-snapshot
Generation of bivariate Rayleigh and Nakagami-m fading envelopes
inferredcites →https://doi.org/10.1109/4234.901815openalex-snapshot
Using the Fourier transform to compute the weight distribution of a binary linear block code
inferredcites →https://doi.org/10.1109/49.29615openalex-snapshot
An algorithm for computing the distance spectrum of trellis codes
inferredcites →https://doi.org/10.1109/49.661105openalex-snapshot
Design and analysis of turbo codes on Rayleigh fading channels
inferredcites →https://doi.org/10.1109/49.661108openalex-snapshot
Performance evaluation of superorthogonal turbo codes in AWGN and flat Rayleigh fading channels
inferredcites →https://doi.org/10.1109/49.661111openalex-snapshot
Analysis, design, and iterative decoding of double serially concatenated codes with interleavers
inferredcites →https://doi.org/10.1109/49.924866openalex-snapshot
Improved tangential sphere bound on the bit-error probability of concatenated codes
inferredcites →https://doi.org/10.1109/49.924868openalex-snapshot
On the theory and performance of trellis termination methods for turbo codes
inferredcites →https://doi.org/10.1109/50.908727openalex-snapshot
BER performance of turbo-coded PPM CDMA systems on optical fiber
inferredcites →https://doi.org/10.1109/ctmc.1994.512606openalex-snapshot
Weight distribution and performance of the iterated product of single-parity-check codes
inferredcites →https://doi.org/10.1109/eeei.2000.924389openalex-snapshot
A lower bound on the probability of decoding error over a BSC channel
inferredcites →https://doi.org/10.1109/eeei.2006.321095openalex-snapshot
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
inferredcites →https://doi.org/10.1109/glocom.1999.831739openalex-snapshot
BER bounds on parallel concatenated single parity check arrays and zigzag codes
inferredcites →https://doi.org/10.1109/glocom.2001.965563openalex-snapshot
Generalized product accumulate codes: analysis and performance
inferredcites →https://doi.org/10.1109/glocom.2001.965672openalex-snapshot
Bounds on the performance of turbo codes on Nakagami fading channels with diversity combining
inferredcites →https://doi.org/10.1109/glocom.2003.1258506openalex-snapshot
An improved upper bound on the performance of convolutional codes over quasi-static fading channels
inferredcites →https://doi.org/10.1109/glocom.2003.1258512openalex-snapshot
Performance Analysis of Coded OFDM Systems Over Frequency-Selective Fading Channels
inferredcites →https://doi.org/10.1109/glocom.2004.1378000openalex-snapshot
Maximum likelihood decoding analysis of accumulate-repeat-accumulate codes
inferredcites →https://doi.org/10.1109/glocom.2005.1577833openalex-snapshot
Asymptotic weight distributions of irregular repeat-accumulate codes
inferredcites →https://doi.org/10.1109/icc.2000.853571openalex-snapshot
Transfer function bounds on performance of binary turbo-coding followed by M-ary orthogonal signal mapping through interleaver
inferredcites →https://doi.org/10.1109/icpwc.1999.759658openalex-snapshot
Error performance bounds of turbo-codes employing nonuniform interleavers
inferredcites →https://doi.org/10.1109/isit.1997.613011openalex-snapshot
Bit-interleaved coded modulation
inferredcites →https://doi.org/10.1109/isit.1997.613020openalex-snapshot
On the ensemble performance of turbo codes
inferredcites →https://doi.org/10.1109/isit.1997.613266openalex-snapshot
Bounds on coding gain versus decoding delay for spherical codes on the Gaussian channel
inferredcites →https://doi.org/10.1109/isit.1997.613310openalex-snapshot
Expurgating the union bound to error probability: a generalization of the Verdu-Shields theorem
inferredcites →https://doi.org/10.1109/isit.1998.708609openalex-snapshot
Improved union bound on linear codes for the input-binary AWGN channel, with applications to turbo codes
inferredcites →https://doi.org/10.1109/isit.1998.708872openalex-snapshot
Union bounds on the performance of product codes
inferredcites →https://doi.org/10.1109/isit.2003.1228283openalex-snapshot
Information-theoretic lower bounds on the bit error probability of codes on graphs
inferredcites →https://doi.org/10.1109/isit.2004.1365139openalex-snapshot
Weight distributions of LDPC code ensembles: combinatorics meets statistical physics
inferredcites →https://doi.org/10.1109/isit.2005.1523728openalex-snapshot
Enumerators for protograph ensembles of LDPC codes
inferredcites →https://doi.org/10.1109/isit.2006.261625openalex-snapshot
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
inferredcites →https://doi.org/10.1109/isit.2006.261700openalex-snapshot
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
inferredcites →https://doi.org/10.1109/isit.2006.262129openalex-snapshot
Ensemble Weight Enumerators for Protograph LDPC Codes
inferredcites →https://doi.org/10.1109/lcomm.2003.814705openalex-snapshot
An upper bound on turbo codes performance over quasi-static fading channels
inferredcites →https://doi.org/10.1109/lcomm.2004.832779openalex-snapshot
On the Input-Output Weight Enumerators of Product Accumulate Codes
inferredcites →https://doi.org/10.1109/lcomm.2005.01013openalex-snapshot
Efficient expression and bound for pairwise error probability in Rayleigh fading channels, with application to union bounds for turbo codes
inferredcites →https://doi.org/10.1109/lcomm.2005.1496596openalex-snapshot
The Engdahl-Zigangirov bound for binary coded systems over block-fading channels
inferredcites →https://doi.org/10.1109/lcomm.2005.1506713openalex-snapshot
Critical point for maximum likelihood decoding of linear block codes
inferredcites →https://doi.org/10.1109/milcom.2003.1290121openalex-snapshot
Performance analysis of binary coded systems over Rician block fading channels
inferredcites →https://doi.org/10.1109/proc.1980.11696openalex-snapshot
The technology of error-correcting codes
inferredcites →https://doi.org/10.1109/tcomm.2003.815057openalex-snapshot
Tight exponential upper bounds on the ml decoding error probability of block codes over fully interleaved fading channels
inferredcites →https://doi.org/10.1109/tcomm.2003.820746openalex-snapshot
Upper bounds to error probabilities of coded systems beyond the cutoff rate
inferredcites →https://doi.org/10.1109/tcomm.2004.831386openalex-snapshot
Performance Analysis of Coded Communication Systems on Nakagami Fading Channels With Selection Combining Diversity
inferredcites →https://doi.org/10.1109/tcomm.2004.840630openalex-snapshot
Serial Concatenated TCM With an Inner Accumulate Code—Part I: Maximum-Likelihood Analysis
inferredcites →https://doi.org/10.1109/tcomm.2004.840632openalex-snapshot
Improved Algorithms for the Determination of Turbo-Code Weight Distributions
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.1965.1053730openalex-snapshot
A simple derivation of the coding theorem and some applications
inferredcites →https://doi.org/10.1109/tit.1973.1054971openalex-snapshot
The random coding bound is tight for the average code (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1985.1057107openalex-snapshot
An approximation to the weight distribution of binary linear codes
inferredcites →https://doi.org/10.1109/tit.2002.1003833openalex-snapshot
Coding theorems for turbo code ensembles
inferredcites →https://doi.org/10.1109/tit.2002.1013147openalex-snapshot
Variance of the turbo code performance bound over the interleavers
inferredcites →https://doi.org/10.1109/tit.2002.801408openalex-snapshot
Upper bounds on the rate of LDPC codes
inferredcites →https://doi.org/10.1109/tit.2002.801476openalex-snapshot
More results on the weight enumerator of product codes
inferredcites →https://doi.org/10.1109/tit.2002.805064openalex-snapshot
Variations on the Gallager bounds, connections, and applications
inferredcites →https://doi.org/10.1109/tit.2002.805065openalex-snapshot
On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders
inferredcites →https://doi.org/10.1109/tit.2003.811907openalex-snapshot
The serial concatenation of rate-1 codes through uniform random interleavers
inferredcites →https://doi.org/10.1109/tit.2003.813560openalex-snapshot
Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
inferredcites →https://doi.org/10.1109/tit.2003.817453openalex-snapshot
On performance limits of space-time codes: a sphere-packing bound approach
inferredcites →https://doi.org/10.1109/tit.2003.820018openalex-snapshot
Low-rate turbo-Hadamard codes
inferredcites →https://doi.org/10.1109/tit.2003.821995openalex-snapshot
Product Accumulate Codes: A Class of Codes With Near-Capacity Performance and Low Decoding Complexity
inferredcites →https://doi.org/10.1109/tit.2003.822577openalex-snapshot
Lower Bounds on the Error Probability of Block Codes Based on Improvements on de Caen's Inequality
inferredcites →https://doi.org/10.1109/tit.2004.824917openalex-snapshot
On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
inferredcites →https://doi.org/10.1109/tit.2004.826644openalex-snapshot
Box and Match Techniques Applied to Soft-Decision Decoding
inferredcites →https://doi.org/10.1109/tit.2004.828064openalex-snapshot
Asymptotic Enumeration Methods for Analyzing LDPC Codes
inferredcites →https://doi.org/10.1109/tit.2004.833352openalex-snapshot
Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A
inferredcites →https://doi.org/10.1109/tit.2004.834850openalex-snapshot
Performance Analysis of Turbo-SPC Codes
inferredcites →https://doi.org/10.1109/tit.2004.836666openalex-snapshot
Generalized Tangential Sphere Bound on the MLDecoding Error Probability of Linear Binary Block Codes in AWGN Interference
inferredcites →https://doi.org/10.1109/tit.2004.836667openalex-snapshot
Rate-Compatible Puncturing of Low-Density Parity-Check Codes
inferredcites →https://doi.org/10.1109/tit.2004.838090openalex-snapshot
Sphere-Packing Bounds Revisited for Moderate Block Lengths
inferredcites →https://doi.org/10.1109/tit.2004.838091openalex-snapshot
A New Upper Bound on the ML DecodingError Probability of Linear Binary Block Codes in AWGN Interference
inferredcites →https://doi.org/10.1109/tit.2005.846431openalex-snapshot
The ML Decoding Performance of LDPC Ensembles Over $ BBZ _q$
inferredcites →https://doi.org/10.1109/tit.2005.850079openalex-snapshot
Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
inferredcites →https://doi.org/10.1109/tit.2005.853320openalex-snapshot
Tight Bounds for LDPC and LDGM Codes Under MAP Decoding
inferredcites →https://doi.org/10.1109/tit.2005.860414openalex-snapshot
Coded modulation in the block-fading channel: coding theorems and code construction
inferredcites →https://doi.org/10.1109/tit.2006.871615openalex-snapshot
Reliable channel regions for good binary codes transmitted over parallel channels
inferredcites →https://doi.org/10.1109/tit.2006.878176openalex-snapshot
Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix
inferredcites →https://doi.org/10.1109/tit.2006.881739openalex-snapshot
Determination of the Local Weight Distribution of Binary Linear Block Codes
inferredcites →https://doi.org/10.1109/tit.2006.883541openalex-snapshot
Weight Distribution of Low-Density Parity-Check Codes
inferredcites →https://doi.org/10.1109/tit.2006.888999openalex-snapshot
New Gallager Bounds in Block-Fading Channels
inferredcites →https://doi.org/10.1109/tit.2006.889462openalex-snapshot
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
inferredcites →https://doi.org/10.1109/tit.2006.890725openalex-snapshot
On the Error Exponents of Improved Tangential Sphere Bounds
inferredcites →https://doi.org/10.1109/tit.2007.892807openalex-snapshot
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
inferredcites →https://doi.org/10.1109/tit.2007.899543openalex-snapshot
Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes
inferredcites →https://doi.org/10.1109/tmag.2002.801877openalex-snapshot
Bounds for low-density parity-check codes over partial response channels
inferredcites →https://doi.org/10.1109/twc.2003.821138openalex-snapshot
On the Performance of Efficient Coding Techniques Over Fading Channels
inferredcites →https://doi.org/10.1109/vetecf.2002.1040780openalex-snapshot
Performance analysis of coded systems over block fading channels
inferredcites →https://doi.org/10.1109/vetecs.2004.1388916openalex-snapshot
Performance analysis of bit-interleaved space-time coding for OFDM in block fading channels
inferredcites →https://doi.org/10.1109/wirles.2005.1549648openalex-snapshot
Capacity achieving LDPC codes through puncturing
inferredcites →https://doi.org/10.17760/d20234675openalex-snapshot
Turbo codes and turbo coded modulation systems
inferredcites →https://doi.org/10.2307/2344305openalex-snapshot
Information Theory and Reliable Communication.
inferredcites →https://doi.org/10.2307/2534031openalex-snapshot
Bonferroni-Type Inequalities with Applications.
inferredcites →https://doi.org/10.48550/arxiv.cs/0410028openalex-snapshot
Life Above Threshold: From List Decoding to Area Theorem and MSE
inferredcites →https://doi.org/10.48550/arxiv.cs/0412111openalex-snapshot
On the asymptotic accuracy of the union bound
inferredcites →https://doi.org/10.48550/arxiv.cs/0505057openalex-snapshot
Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes
inferredcites →https://doi.org/10.48550/arxiv.cs/0506083openalex-snapshot
Maxwell Construction: The Hidden Bridge between Iterative and Maximum a Posteriori Decoding
inferredcites →https://doi.org/10.48550/arxiv.cs/0508072openalex-snapshot
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
inferredcites →https://doi.org/10.48550/arxiv.cs/0510045openalex-snapshot
Why We Can Not Surpass Capacity: The Matching Condition
inferredcites →https://doi.org/10.48550/arxiv.cs/0512075openalex-snapshot
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach
inferredcites →https://doi.org/10.48550/arxiv.cs/0601095openalex-snapshot
On the Weight Enumerator and the Maximum Likelihood Performance of Linear Product Codes
inferredcites →https://doi.org/10.5075/epfl-thesis-3072openalex-snapshot
Asymptotic and finite-length analysis of low-density parity-check codes
inferredcites →https://doi.org/10.7551/mitpress/4347.001.0001openalex-snapshot
Low-Density Parity-Check Codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-981-97-1568-8_10openalex-snapshot
Performance Analysis of Maximum-Likelihood Decoding of Polar Codes
inferred← citeshttps://doi.org/10.1016/b978-0-12-801950-4.00008-1openalex-snapshot
Physical layer design
inferred← citeshttps://doi.org/10.1016/j.matcom.2019.02.005openalex-snapshot
The parameterized Gallager’s first bounds based on conditional triplet-wise error probability
inferred← citeshttps://doi.org/10.1016/j.phycom.2019.03.004openalex-snapshot
Efficient error-correcting codes in the short blocklength regime
inferred← citeshttps://doi.org/10.1016/s0924-8099(07)80009-6openalex-snapshot
Course 2 Modern coding theory: The statistical mechanics and computer science point of view
inferred← citeshttps://doi.org/10.1017/9781316822708openalex-snapshot
A Foundation in Digital Communication
inferred← citeshttps://doi.org/10.1049/iet-com.2018.5198openalex-snapshot
Short block length trellis‐based codes for interference channels
inferred← citeshttps://doi.org/10.1063/1.4759596openalex-snapshot
Bayes decoding for discrete linear channels with semantic value of information
inferred← citeshttps://doi.org/10.1109/access.2025.3646937openalex-snapshot
Pareto-Optimal Frozen Set Design for Polar Codes With Dynamic Frozen Bits Under Small-List SCL Decoding
inferred← citeshttps://doi.org/10.1109/allerton.2009.5394503openalex-snapshot
Robust detection of random variables using sparse measurements
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120384openalex-snapshot
Properties of the MMSE of “bad” codes
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483281openalex-snapshot
A refinement of the random coding bound
inferred← citeshttps://doi.org/10.1109/asms-spsc.2010.5586853openalex-snapshot
A tighter upper bound on the error probability of signals in white Gaussian noise
inferred← citeshttps://doi.org/10.1109/eeei.2006.321095openalex-snapshot
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
inferred← citeshttps://doi.org/10.1109/eeei.2006.321097openalex-snapshot
Log-Domain Calculation of the 1959 Sphere-Packing Bound with Application to M-ary PSK Block Coded Modulation
inferred← citeshttps://doi.org/10.1109/eeei.2006.321119openalex-snapshot
On the Error Exponents of Improved Tangential-Sphere Bounds
inferred← citeshttps://doi.org/10.1109/globecom38437.2019.9014221openalex-snapshot
Total Variation Distance and Improved Random Coding Union Bounds
inferred← citeshttps://doi.org/10.1109/globecom42002.2020.9322551openalex-snapshot
On Approximation, Bounding & Exact Calculation of Block Error Probability for Random Codes
inferred← citeshttps://doi.org/10.1109/icnp59255.2023.10355600openalex-snapshot
DFH: Improving the Reliability of LR-FHSS via Dynamic Frequency Hopping
inferred← citeshttps://doi.org/10.1109/ieeeconf44664.2019.9048806openalex-snapshot
List Decoding of Short Codes for Communication over Unknown Fading Channels
inferred← citeshttps://doi.org/10.1109/isit.1997.613011openalex-snapshot
Bit-interleaved coded modulation
inferred← citeshttps://doi.org/10.1109/isit.2006.261625openalex-snapshot
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
inferred← citeshttps://doi.org/10.1109/isit.2006.261824openalex-snapshot
On the Performance of Sphere Decoding of Block Codes
inferred← citeshttps://doi.org/10.1109/isit.2008.4595131openalex-snapshot
The limits of coding with joint constraints on detected and undetected error rates
inferred← citeshttps://doi.org/10.1109/isit.2009.5205439openalex-snapshot
Coset codes for compound multiple access channels with common information
inferred← citeshttps://doi.org/10.1109/isit.2009.5205822openalex-snapshot
Lower bounds on the graphical complexity of finite-length LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2010.5513453openalex-snapshot
Robust lossy detection using sparse measurements: The regular case
inferred← citeshttps://doi.org/10.1109/isit.2011.6033847openalex-snapshot
Linear error correcting codes with anytime reliability
inferred← citeshttps://doi.org/10.1109/isit.2011.6034108openalex-snapshot
New techniques for upper-bounding the MLD performance of binary linear codes
inferred← citeshttps://doi.org/10.1109/isit.2013.6620780openalex-snapshot
Extending Divsalar's bound to nonbinary codes with two dimensional constellations
inferred← citeshttps://doi.org/10.1109/isit.2014.6875086openalex-snapshot
Source-channel coding with multiple classes
inferred← citeshttps://doi.org/10.1109/isit.2014.6875419openalex-snapshot
Lower bounds on the error probability of turbo codes
inferred← citeshttps://doi.org/10.1109/isit.2015.7282728openalex-snapshot
On the Rényi divergence and the joint range of relative entropies
inferred← citeshttps://doi.org/10.1109/isit.2015.7282757openalex-snapshot
Improved Hamming sphere bounds on the MLD performance of binary linear codes
inferred← citeshttps://doi.org/10.1109/isit.2017.8006637openalex-snapshot
Performance of ML decoding for ensembles of binary and nonbinary regular LDPC codes of finite lengths
inferred← citeshttps://doi.org/10.1109/isit.2019.8849543openalex-snapshot
On the Error Probability of Optimal Codes in Gaussian Channels under Maximal Power Constraint
inferred← citeshttps://doi.org/10.1109/isit.2019.8849653openalex-snapshot
Error Exponents of Typical Random Codes for the Colored Gaussian Channel
inferred← citeshttps://doi.org/10.1109/isit.2019.8849672openalex-snapshot
On Construction of Polar Subcodes with Large Kernels
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174287openalex-snapshot
Tangential-Sphere Bound Revisited
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518274openalex-snapshot
Hybrid Non-Binary Repeated Polar Codes For Low-SNR Regime
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206448openalex-snapshot
Tight Upper Bounds on the Error Probability of Spinal Codes over Fading Channels
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653670openalex-snapshot
On the Error Probability of RPA Decoding of Reed-Muller Codes over BMS Channels
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653968openalex-snapshot
Gallager’s Random Coding Bound for Classical-Quantum Channels and Beyond
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195370openalex-snapshot
On the Weight Spectrum of Rate-Compatible Polar Codes
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195397openalex-snapshot
On the Average Weight Spectrum of Pre-Transformed Rate-Compatible Polar Codes
inferred← citeshttps://doi.org/10.1109/istc.2016.7593131openalex-snapshot
Sphere bound revisited: A new simulation approach to performance evaluation of binary linear codes over AWGN channels
inferred← citeshttps://doi.org/10.1109/ita.2008.4601067openalex-snapshot
An improved sphere-packing bound for finite-length codes over symmetric memoryless channels
inferred← citeshttps://doi.org/10.1109/ita.2013.6502988openalex-snapshot
New non-asymptotic random channel coding theorems
inferred← citeshttps://doi.org/10.1109/itw.2008.4578615openalex-snapshot
Gallager-Type Bounds for Non-Binary Linear Block Codes over Memoryless Symmetric Channels
inferred← citeshttps://doi.org/10.1109/itw.2009.5351236openalex-snapshot
Performance bounds for erasure, list and feedback schemes with linear block codes
inferred← citeshttps://doi.org/10.1109/itw.2009.5351471openalex-snapshot
On the channel statistics in Hybrid ARQ systems for correlated channels
inferred← citeshttps://doi.org/10.1109/itw.2013.6691287openalex-snapshot
New geometrical spectra of linear codes with applications to performance analysis
inferred← citeshttps://doi.org/10.1109/itw.2017.8277934openalex-snapshot
Physical-layer network coding: A random coding error exponent perspective
inferred← citeshttps://doi.org/10.1109/jlt.2007.915272openalex-snapshot
Multimode Fiber as Random Code Generator— Application to Massively Parallel MIMO Transmission
inferred← citeshttps://doi.org/10.1109/jsac.2009.090812openalex-snapshot
Analysis and design of punctured rate-1/2 turbo codes exhibiting low error floors
inferred← citeshttps://doi.org/10.1109/lcomm.2014.032014.132681openalex-snapshot
Refinement of the DS2 Bound and its Extensions for Discrete Memoryless Symmetric Channels
inferred← citeshttps://doi.org/10.1109/ncc.2012.6176886openalex-snapshot
Diversity order vs rate in an AWGN channel
inferred← citeshttps://doi.org/10.1109/red.2016.7779336openalex-snapshot
Directed search decoding of polar codes with Reed-Solomon kernel
inferred← citeshttps://doi.org/10.1109/rfid-ta.2016.7750727openalex-snapshot
Performance analysis of systematic linear codes over AWGN channels
inferred← citeshttps://doi.org/10.1109/spawc.2017.8227651openalex-snapshot
Short codes with mismatched channel state information: A case study
inferred← citeshttps://doi.org/10.1109/tac.2016.2529960openalex-snapshot
Linear Time-Invariant Anytime Codes for Control Over Noisy Channels
inferred← citeshttps://doi.org/10.1109/tcomm.2009.07.070344openalex-snapshot
The augmented state diagram and its application to convolutional and turbo codes
inferred← citeshttps://doi.org/10.1109/tcomm.2009.07.070587openalex-snapshot
A channel representation method for the study of hybrid retransmission-based error control
inferred← citeshttps://doi.org/10.1109/tcomm.2009.10.080402openalex-snapshot
Performance of sphere decoding of block codes
inferred← citeshttps://doi.org/10.1109/tcomm.2011.042111.090321openalex-snapshot
Evolutionary Algorithm Aided Interleaver Design for Serially Concatenated Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2011.071111.100485openalex-snapshot
Optimum Power and Rate Allocation for Coded V-BLAST: Instantaneous Optimization
inferred← citeshttps://doi.org/10.1109/tcomm.2012.122712.120225openalex-snapshot
New Techniques for Upper-Bounding the ML Decoding Performance of Binary Linear Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2366131openalex-snapshot
Spatial Coupling of Generator Matrices: A General Approach to Design Good Codes at a Target BER
inferred← citeshttps://doi.org/10.1109/tcomm.2017.2704586openalex-snapshot
Randomized Convolutional Codes for the Wiretap Channel
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2879107openalex-snapshot
LDPC Codes Over the BEC: Bounds and Decoding Algorithms
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2924897openalex-snapshot
Analysis of the Block Error Probability of Concatenated Polar Code Ensembles
inferred← citeshttps://doi.org/10.1109/tcomm.2021.3052539openalex-snapshot
On Approximation, Bounding & Exact Calculation of Average Block Error Probability for Random Code Ensembles
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3299972openalex-snapshot
A Genie-Aided Approach to Error Floor Estimation for Spatially Coupled Serially Concatenated Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3439431openalex-snapshot
Frozen Set Design for Precoded Polar Codes
inferred← citeshttps://doi.org/10.1109/tit.2006.890725openalex-snapshot
On the Error Exponents of Improved Tangential Sphere Bounds
inferred← citeshttps://doi.org/10.1109/tit.2007.892807openalex-snapshot
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
inferred← citeshttps://doi.org/10.1109/tit.2007.899543openalex-snapshot
Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes
inferred← citeshttps://doi.org/10.1109/tit.2007.909071openalex-snapshot
Gallager Bounds for Noncoherent Decoders in Fading Channels
inferred← citeshttps://doi.org/10.1109/tit.2007.915705openalex-snapshot
Incremental Redundancy Cooperative Coding for Wireless Networks: Cooperative Diversity, Coding, and Transmission Energy Gains
inferred← citeshttps://doi.org/10.1109/tit.2008.2011443openalex-snapshot
Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels
inferred← citeshttps://doi.org/10.1109/tit.2008.920216openalex-snapshot
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
inferred← citeshttps://doi.org/10.1109/tit.2008.926383openalex-snapshot
Performance of Space–Time Codes: Gallager Bounds and Weight Enumeration
inferred← citeshttps://doi.org/10.1109/tit.2008.928274openalex-snapshot
Capacity Achieving LDPC Codes Through Puncturing
inferred← citeshttps://doi.org/10.1109/tit.2009.2021305openalex-snapshot
On Universal Properties of Capacity-Approaching LDPC Code Ensembles
inferred← citeshttps://doi.org/10.1109/tit.2009.2025576openalex-snapshot
Improvement of Gallager Upper Bound and its Variations for Discrete Channels
inferred← citeshttps://doi.org/10.1109/tit.2010.2040965openalex-snapshot
Error Rates of the Maximum-Likelihood Detector for Arbitrary Constellations: Convex/Concave Behavior and Applications
inferred← citeshttps://doi.org/10.1109/tit.2010.2050797openalex-snapshot
Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes
inferred← citeshttps://doi.org/10.1109/tit.2011.2132570openalex-snapshot
Coset Codes for Compound Multiple Access Channels With Common Information
inferred← citeshttps://doi.org/10.1109/tit.2011.2158489openalex-snapshot
On Universal LDPC Code Ensembles Over Memoryless Symmetric Channels
inferred← citeshttps://doi.org/10.1109/tit.2011.2162176openalex-snapshot
Tight Performance Bounds for Permutation Invariant Binary Linear Block Codes Over Symmetric Channels
inferred← citeshttps://doi.org/10.1109/tit.2013.2267772openalex-snapshot
On Convexity of Error Rates in Digital Communications
inferred← citeshttps://doi.org/10.1109/tit.2014.2333000openalex-snapshot
List Permutation Invariant Linear Codes: Theory and Applications
inferred← citeshttps://doi.org/10.1109/tit.2014.2345374openalex-snapshot
Refinement of the Random Coding Bound
inferred← citeshttps://doi.org/10.1109/tit.2015.2449852openalex-snapshot
New Nonasymptotic Channel Coding Theorems for Structured Codes
inferred← citeshttps://doi.org/10.1109/tit.2015.2504100openalex-snapshot
On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem
inferred← citeshttps://doi.org/10.1109/tit.2016.2588496openalex-snapshot
Multi-Class Source-Channel Coding
inferred← citeshttps://doi.org/10.1109/tit.2017.2757496openalex-snapshot
Arimoto–Rényi Conditional Entropy and Bayesian $M$ -Ary Hypothesis Testing
inferred← citeshttps://doi.org/10.1109/tit.2017.2787571openalex-snapshot
Systematic Block Markov Superposition Transmission of Repetition Codes
inferred← citeshttps://doi.org/10.1109/tit.2021.3063311openalex-snapshot
Error Probability Bounds for Gaussian Channels Under Maximal and Average Power Constraints
inferred← citeshttps://doi.org/10.1109/tit.2022.3207802openalex-snapshot
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding
inferred← citeshttps://doi.org/10.1109/tvt.2011.2106809openalex-snapshot
Extrinsic Information Transfer Analysis and Design of Block-Based Intermediate Codes
inferred← citeshttps://doi.org/10.1109/twc.2022.3159807openalex-snapshot
Hybrid Non-Binary Repeated Polar Codes
inferred← citeshttps://doi.org/10.1109/wcnc.2018.8377116openalex-snapshot
Short packet physical-layer network coding with mismatched channel state information
inferred← citeshttps://doi.org/10.1109/wcsp.2010.5633822openalex-snapshot
Turbo-equalization of LDPC coded MIMO inner/outer scheduling
inferred← citeshttps://doi.org/10.1109/wirles.2005.1549648openalex-snapshot
Capacity achieving LDPC codes through puncturing
inferred← citeshttps://doi.org/10.11591/ijeecs.v29.i2.pp816-824openalex-snapshot
Single parity check node adapted to polar codes with dynamic frozen bit equivalent to binary linear block codes
inferred← citeshttps://doi.org/10.1186/s13638-016-0769-zopenalex-snapshot
On the use of ordered statistics decoders for low-density parity-check codes in space telecommand links
inferred← citeshttps://doi.org/10.14288/1.0071660openalex-snapshot
Binary-coded modulation and applications in free-space optics
inferred← citeshttps://doi.org/10.1561/0100000064openalex-snapshot
Concentration of Measure Inequalities in Information Theory, Communications, and Coding
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.2572openalex-snapshot
Improved Sphere Bound on the MLD Performance of Binary Linear Block Codes via Voronoi Region
inferred← citeshttps://doi.org/10.23919/cje.2014.10851232openalex-snapshot
Amended Truncated Union Bounds on the ML Decoding Performance of Binary Linear Codes over AWGN Channels
inferred← citeshttps://doi.org/10.3390/e23020199openalex-snapshot
Error Exponents and α-Mutual Information
inferred← citeshttps://doi.org/10.3390/e23070841openalex-snapshot
List Decoding of Arıkan’s PAC Codes
inferred← citeshttps://doi.org/10.3929/ethz-a-007052679openalex-snapshot
Refinement of the random coding bound
inferred← citeshttps://doi.org/10.48550/arxiv.0801.0352openalex-snapshot
The price of certainty: "waterslide curves" and the gap to capacity
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4927openalex-snapshot
Serial Concatenation of RS Codes with Kite Codes: Performance Analysis, Iterative Decoding and Design
inferred← citeshttps://doi.org/10.48550/arxiv.1108.3832openalex-snapshot
Coding in the Presence of Semantic Value of Information: Unequal Error Protection Using Poset Decoders
inferred← citeshttps://doi.org/10.48550/arxiv.1112.4236openalex-snapshot
Error Correcting Codes for Distributed Control
inferred← citeshttps://doi.org/10.48550/arxiv.1202.0592openalex-snapshot
On Parameterized Gallager's First Bounds for Binary Linear Codes over AWGN Channels
inferred← citeshttps://doi.org/10.48550/arxiv.1308.3303openalex-snapshot
Upper Bounds On the ML Decoding Error Probability of General Codes over AWGN Channels
inferred← citeshttps://doi.org/10.48550/arxiv.1401.5305openalex-snapshot
Bounds on the ML Decoding Error Probability of RS-Coded Modulation over AWGN Channels
inferred← citeshttps://doi.org/10.48550/arxiv.1405.2524openalex-snapshot
Spatial Coupling of Generator Matrix: A General Approach to Design of Good Codes at a Target BER
inferred← citeshttps://doi.org/10.48550/arxiv.1506.08331openalex-snapshot
On Bounding the Union Probability Using Partial Weighted Information
inferred← citeshttps://doi.org/10.48550/arxiv.1610.00873openalex-snapshot
Code Design for Short Blocks: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1610.06712openalex-snapshot
A New Simulation Approach to Performance Evaluation of Binary Linear Codes in the Extremely Low Error Rate Region
inferred← citeshttps://doi.org/10.48550/arxiv.1705.05528openalex-snapshot
Short Codes with Mismatched Channel State Information: A Case Study
inferred← citeshttps://doi.org/10.48550/arxiv.1901.05409openalex-snapshot
Low-Complexity Joint Channel Estimation and List Decoding of Short Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1908.05889openalex-snapshot
Polar Codes: Analysis and Construction Based on Polar Spectrum
inferred← citeshttps://doi.org/10.48550/arxiv.2011.04930openalex-snapshot
Selectively Precoded Polar Codes
inferred← citeshttps://doi.org/10.48550/arxiv.2108.08716openalex-snapshot
NB QC-LDPC Coded QAM Signals with Optimized Mapping: Bounds and Simulation Results
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607002openalex-snapshot
Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607003openalex-snapshot
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607004openalex-snapshot
On the Error Exponents of Some Improved Tangential-Sphere Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0608042openalex-snapshot
An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
inferred← citeshttps://doi.org/10.7907/7431-fh32openalex-snapshot
Distributed Control and Computing: Optimal Estimation, Error Correcting Codes, and Interactive Protocols
inferred← citeshttps://doi.org/10.7907/tqrj-gm19openalex-snapshot
New Approaches to the Analysis and Design of Reed-Solomon Related Codes
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.