The following pages link to Daniel J. jun. Costello (Q1429268):
Displaying 50 items.
- (Q734255) (redirect page) (← links)
- On the error-correcting capability of LDPC codes (Q734256) (← links)
- On the redundancy of universal lossless coding for general piecewise stationary sources (Q1429269) (← links)
- (Q2577282) (redirect page) (← links)
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices (Q2577283) (← links)
- Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources .I. The regular case (Q2705978) (← links)
- Probabilistic construction of large constraint length trellis codes for sequential decoding (Q2726161) (← links)
- LDPC Code Designs, Constructions, and Unification (Q2835535) (← links)
- Design of Spatially Coupled LDPC Codes Over GF $(q)$ for Windowed Decoding (Q2976601) (← links)
- Spatially Coupled LDPC Codes Constructed From Protographs (Q2977284) (← links)
- Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs (Q2983384) (← links)
- Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes (Q2989458) (← links)
- A distance spectrum interpretation of turbo codes (Q3129456) (← links)
- Low Density Parity Check Convolutional Codes Derived from Quasi-Cyclic Block Codes (Q3448742) (← links)
- Trellis-coded multidimensional phase modulation (Q3481632) (← links)
- An algorithm for computing the distance spectrum of trellis codes (Q3495029) (← links)
- An analysis of the block error probability performance of iterative decoding (Q3547232) (← links)
- Universal Lossless Coding for Sources With Repeating Statistics (Q3547616) (← links)
- (Q3547636) (← links)
- LDPC Block and Convolutional Codes Based on Circulant Matrices (Q3547695) (← links)
- A network coding approach to cooperative diversity (Q3548951) (← links)
- Distance Bounds for an Ensemble of LDPC Convolutional Codes (Q3549108) (← links)
- Laminated turbo codes: A new class of block-convolutional codes (Q3604452) (← links)
- Decoding of DBEC-TBED Reed-Solomon Codes (Q3783210) (← links)
- (Q3797097) (← links)
- A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes (Q3818226) (← links)
- Generalized minimum distance decoding algorithms for Qary output channels (Corresp.) (Q3869251) (← links)
- Asymptotically catastrophic convolutional codes (Q3880746) (← links)
- Error probability and free distance bounds for two-user tree codes on multiple-access channels (Q3919593) (← links)
- New multilevel codes over GF(q) (Q4008326) (← links)
- (Q4041438) (← links)
- Free distance bounds for convolutional codes (Q4053459) (← links)
- Distance and computation in sequential decoding (Q4111465) (← links)
- Truncation Error Probability in Viterbi Decoding (Q4123230) (← links)
- A multiple stack algorithm for erasurefree decoding of convolutional codes (Q4140852) (← links)
- An analysis of sequential decoding for specific time-invariant convolutional codes (Q4161243) (← links)
- An algebraic construction for q-ary shift register sequences (Q4166694) (← links)
- Binary convolutional codes for a multiple-access channel (Corresp.) (Q4170642) (← links)
- Trellis coding with multidimensional QAM signal sets (Q4202049) (← links)
- (Q4283417) (← links)
- (Q4283422) (← links)
- Robustly good trellis codes (Q4337931) (← links)
- Sequential decoding of trellis codes at high spectral efficiencies (Q4392404) (← links)
- (Q4460808) (← links)
- A multilevel approach to constructing trellis-matched codes for binary-input partial-response channels (Q4503463) (← links)
- (Q4535936) (← links)
- New deterministic interleaver designs for turbo codes (Q4545802) (← links)
- On the frame-error rate of concatenated turbo codes (Q4552958) (← links)
- Applications of error-control coding (Q4701202) (← links)
- On the weight distribution of terminated convolutional codes (Q4701426) (← links)
