Universal decoding for channels with memory
From MaRDI portal
Recommendations
- Universal decoding for finite-state channels
- On the universality of the LZ-based decoding algorithm
- Universal decoding for memoryless Gaussian channels with a deterministic interference
- On the decoding of convolutional codes on an unknown channel
- Universal Algorithms for Channel Decoding of Uncompressed Sources
Cited in
(13)- Universal detection of messages via finite-state channels
- Universal Communication—Part II: Channels With Memory
- A Successive Decoding Strategy for Channels With Memory
- Universal Algorithms for Channel Decoding of Uncompressed Sources
- Universal decoding for finite-state channels
- scientific article; zbMATH DE number 3478759 (Why is no real title available?)
- Universal decoding for memoryless Gaussian channels with a deterministic interference
- Universal delay estimation for discrete channels
- On the decoding of convolutional codes on an unknown channel
- Majority-Based Tracking Forecast Memories for Stochastic LDPC Decoding
- Improving the generalized likelihood ratio test for unknown linear gaussian channels
- A parallel systems approach to universal receivers
- Universal coding for discrete memoryless sources uniform with respect to output
This page was built for publication: Universal decoding for channels with memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701153)
