Universal Algorithms for Channel Decoding of Uncompressed Sources

DOI10.1109/TIT.2008.920187zbMATH Open1328.94101OpenAlexW2154176017MaRDI QIDQ3604472FDOQ3604472

Authors Erik Ordentlich, Gadiel Seroussi, Sergio Verdú, Krishnamurthy Viswanathan 

Publication date 24 February 2009

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

Full work available at URL https://doi.org/10.1109/tit.2008.920187

zbMATH Keywords

denoisingbelief propagationlossless compressionsoft decodinguniversal algorithmsjoint source-channel decodingdiscrete memoryless channelschannel decoding

Mathematics Subject Classification ID

Source coding (94A29) Linear codes (general theory) (94B05) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• Universal decoding for source-channel coding with side information
• On the universality of the LZ-based decoding algorithm
• Universal decoding for finite-state channels
• Universal decoding for channels with memory
• Multi-alphabet universal coding of memoryless sources

Cited In (11)

• Unconditional bases and bit-level compression
• Universal Decoding for Gaussian Intersymbol Interference Channels
• Universal decoding for finite-state channels
• Universal discrete denoising: known channel
• Universal coding algorithm for a family of context Markov sources
• Universal Zero-Delay Joint Source–Channel Coding
• Quantizers with uniform decoders and channel-optimized encoders
• Universal decoding for source-channel coding with side information
• On the universality of the LZ-based decoding algorithm
• Universal Lossless Compression of Erased Symbols
• Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case

This page was built for publication: Universal Algorithms for Channel Decoding of Uncompressed Sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604472)