Universal decoding for finite-state channels
From MaRDI portal
Publication:3689085
DOI10.1109/TIT.1985.1057068zbMATH Open0571.94009MaRDI QIDQ3689085FDOQ3689085
Authors: Jacob Ziv 
Publication date: 1985
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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
Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35) Error probability in coding theory (94B70)
Cited In (13)
- Universal Decoding for Gaussian Intersymbol Interference Channels
- Universal Algorithms for Channel Decoding of Uncompressed Sources
- On the decoding of convolutional codes on an unknown channel
- Universal coding algorithm for a family of context Markov sources
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- SPRT and CUSUM in hidden Markov models
- Minimax Universal Decoding With an Erasure Option
- Universal decoding for source-channel coding with side information
- A parallel systems approach to universal receivers
- Title not available (Why is that?)
- Universal detection of messages via finite-state channels
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)
