On the universality of the LZ-based decoding algorithm

DOI10.1109/18.705554zbMATH Open0933.94018OpenAlexW2098720252MaRDI QIDQ4701154FDOQ4701154

Authors: Amos Lapidoth, Jacob Ziv 

Publication date: 21 November 1999

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

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

Recommendations

• On the Limitations of the Naive Lattice Decoding
• Universal Decoding for the Typical Random Code and for the Expurgated Code
• A universal lattice code decoder for fading channels
• Universal bound on the performance of lattice codes
• Universal Algorithms for Channel Decoding of Uncompressed Sources
• On the complete decoding of binary linear codes (Corresp.)
• Efficient algorithms for Lempel-Ziv encoding
• On the Decoding of Lattices Constructed via a Single Parity Check
• On the characterization of linear uniquely decodable codes
• scientific article; zbMATH DE number 1498796

zbMATH Keywords

error exponentLempel-Ziv parsingfinite-state channelsElliott channeluniversal decoder

Mathematics Subject Classification ID

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

Cited In (3)

• Further results on decoders for<tex>Q</tex>-ary output channels (Corresp.)
• Universal Algorithms for Channel Decoding of Uncompressed Sources
• Universal detection of messages via finite-state channels

This page was built for publication: On the universality of the LZ-based decoding algorithm

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