Universal decoding for finite-state channels
From MaRDI portal
Publication:3689085
Recommendations
- Universal Decoding for Arbitrary Channels Relative to a Given Class of Decoding Metrics
- Universal Algorithms for Channel Decoding of Uncompressed Sources
- Universal decoding for channels with memory
- Universal Decoding for the Typical Random Code and for the Expurgated Code
- Universal decoding for source-channel coding with side information
- Linear Universal Decoding for Compound Channels
- Universal decoding for memoryless Gaussian channels with a deterministic interference
- Universal detection of messages via finite-state channels
- Universal Decoding for Gaussian Intersymbol Interference Channels
- Universal coding for discrete memoryless sources uniform with respect to output
Cited in
(13)- Universal coding algorithm for a family of context Markov sources
- Universal decoding for source-channel coding with side information
- scientific article; zbMATH DE number 3463521 (Why is no real title available?)
- A parallel systems approach to universal receivers
- Universal detection of messages via finite-state channels
- SPRT and CUSUM in hidden Markov models
- scientific article; zbMATH DE number 3496010 (Why is no real title available?)
- Universal Decoding for Gaussian Intersymbol Interference Channels
- scientific article; zbMATH DE number 3601521 (Why is no real title available?)
- On the decoding of convolutional codes on an unknown channel
- scientific article; zbMATH DE number 3793938 (Why is no real title available?)
- Universal Algorithms for Channel Decoding of Uncompressed Sources
- Minimax Universal Decoding With an Erasure Option
This page was built for publication: Universal decoding for finite-state channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689085)
