Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
From MaRDI portal
(Redirected from Publication:4085609)
Cited in
(47)- QAM modulations with \(q\)-ary turbo codes
- On viewing block codes as finite automata.
- Dynamic programming in digital communications: Viterbi decoding to turbo multiuser detection
- A probabilistic cryptanalytic method for a time-variant permutation generator
- Multi-feedback interference cancellation algorithms for OFDM systems over doubly-selective channels
- On maximum length convolutional codes under a trellis complexity constraint
- Linear-constant log-map, a fast accurate algorithm for map decoding
- Improved equalization and joint iterative detection
- A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio
- Matrix theory for minimal trellises
- A survey on fast correlation attacks
- An iterative algorithm and low complexity hardware architecture for fast acquisition of long PN codes in UWB systems
- Turbo equalization of serially concatenated turbo codes using a predictive DFE-based receiver
- A novel design methodology for high-performance programmable decoder cores for AA-LDPC codes
- Performance limits of compound codes with symbol-based iterative decoding
- Iterative decoding of parallel concatenated block codes and coset based MAP decoding algorithm for F24 code
- An accurate density evolution analysis for a finite-state Markov channel
- A decoding approach to fault tolerant control of linear systems with quantised disturbance input
- Memory-reduced maximum a posteriori probability decoding for high-throughput parallel turbo decoders
- On the accuracy of the MAP inference in HMMs
- Evaluation of channel coding and decoding algorithms using discrete chaotic maps
- An improved decision feedback equalization usinga prioriinformation
- The PS-BCJR algorithm for joint frequency synchronization and data decoding in TCM systems
- Two-dimensional iterative processing for DAB receivers based on trellis-decomposition
- Decoding technique of concatenated hadamard codes and its performance
- Markov regime switching in mean and in fractional integration parameter
- On the Distortion of Locality Sensitive Hashing
- The distortion of locality sensitive hashing
- Link-Level Aspects
- New near shannon limit codes: Zigzag codes and concatenated zigzag codes
- The source-channel separation theorem revisited
- Decoding of turbo codes in symmetric alpha-stable noise
- Low-complexity Gaussian detection for MIMO systems
- Multiary turbo code fitting for unitary space-time modulation and its MAP decoding algorithm
- Computational aspects of DNA mixture analysis
- Joint binary image deconvolution and blur identification in the context of two-dimensional storage channels
- Generalized column weights and equivalences of convolutional codes
- Message-passing algorithms for inference and optimization
- VLSI architectures for sliding-window-based space-time turbo Trellis code decoders
- Minimal trellises for non-degenerate and degenerate decoding of quantum stabilizer codes
- Risk averse asset allocation in a context of climate change with reinforcement learning and hidden Markov models
- Iterative signal reconstruction of deliberately clipped SMT signals
- On the entropy of a hidden Markov process
- Joint source and channel decoding for variable length encoded turbo codes
- An iterative decoding algorithm for fusion of multimodal information
- Medium access in spread-spectrum ad hoc networks with multiuser detection
- A turbo receiver combined with CFO compensation in frequency-domain for OFDMA uplink
This page was built for publication: Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4085609)