Universal decoding for channels with memory

DOI10.1109/18.705540zbMATH Open0964.94017OpenAlexW2154966010MaRDI QIDQ4701153FDOQ4701153

Authors: Meir Feder, Amos Lapidoth 

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/effbf240dd527be88c2222b5aa0c3159b2f2c0eb

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

zbMATH Keywords

compound channelGilbert-Elliott channelfinite-state channelrandom-coding error exponentGaussian intersymbol interference channelsuniversal decoder

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cited In (11)

• Improving the generalized likelihood ratio test for unknown linear gaussian channels
• Universal Communication—Part II: Channels With Memory
• Universal Algorithms for Channel Decoding of Uncompressed Sources
• Universal decoding for finite-state channels
• On the decoding of convolutional codes on an unknown channel
• A Successive Decoding Strategy for Channels With Memory
• A parallel systems approach to universal receivers
• Majority-Based Tracking Forecast Memories for Stochastic LDPC Decoding
• Universal coding for discrete memoryless sources uniform with respect to output
• Universal detection of messages via finite-state channels
• Title not available (Why is that?)

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)