The following pages link to M. Lentmaier (Q174184):
Displayed 19 items.
- Some results concerning the design and decoding of turbo-codes (Q1812377) (← links)
- On the theory of low-density convolutional codes. II (Q1812388) (← links)
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices (Q2577283) (← links)
- Spatially Coupled LDPC Codes Constructed From Protographs (Q2977284) (← links)
- Analytic Expressions for the Bit Error Probabilities of Rate-<tex>$1/2$</tex>Memory<tex>$2$</tex>Convolutional Encoders (Q3547231) (← links)
- An analysis of the block error probability performance of iterative decoding (Q3547232) (← links)
- Distance Bounds for an Ensemble of LDPC Convolutional Codes (Q3549108) (← links)
- (Q4502613) (← links)
- Spatially Coupled Turbo-Like Codes (Q4566483) (← links)
- Asymptotic analysis of superorthogonal turbo codes (Q4679895) (← links)
- Braided Block Codes (Q4975886) (← links)
- Braided Convolutional Codes: A New Class of Turbo-Like Codes (Q4976052) (← links)
- Girth Analysis and Design of Periodically Time-Varying SC-LDPC Codes (Q5001624) (← links)
- Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling (Q5001752) (← links)
- Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator (Q5030366) (← links)
- Code Design Based on Connecting Spatially Coupled Graph Chains (Q5211393) (← links)
- Iterative Decoding Threshold Analysis for LDPC Convolutional Codes (Q5281275) (← links)
- Mathematical analysis of an iterative decoding algorithm for low-density codes (Q5930867) (← links)
- Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding (Q6193561) (← links)