The following pages link to Fred Daneshgaran (Q2705965):
Displaying 13 items.
- Permutation fixed points with application to estimation of minimum distance of turbo codes (Q2705967) (← links)
- The iterative collapse algorithm: a novel approach for the design of long constraint length Viterbi decoders. I (Q2726595) (← links)
- Problem of localisation in networks of randomly deployed nodes: asymptotic and finite analysis, and thresholds (Q2854449) (← links)
- An Extensive Search for Good Punctured Rate->tex<$ kover k+1$>/tex<Recursive Convolutional Codes for Serially Concatenated Convolutional Codes (Q3546760) (← links)
- Interleaver Design for Serially Concatenated Convolutional Codes: Theory and Application (Q3546761) (← links)
- Iterative Joint Channel Decoding of Correlated Sources Employing Serially Concatenated Convolutional Codes (Q3546762) (← links)
- Interleaver Pruning for Construction of Variable-Length Turbo Codes (Q3546764) (← links)
- Linear Subcodes of Turbo Codes With Improved Distance Spectra (Q3546765) (← links)
- Simplified Viterbi decoding of geometrically uniform TCM codes (Q4340401) (← links)
- Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexity (Q4503425) (← links)
- Optimized turbo codes for delay constrained applications (Q4544786) (← links)
- Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD (Q4584398) (← links)
- Soft decoding of short/medium length codes using ordered statistics for quantum key distribution (Q5037878) (← links)
