Error-resilient first-order multiplexed source codes: performance bounds, design and decoding algorithms

DOI10.1109/TSP.2006.870609MaRDI QIDQ4587762zbMATH OpenOpenAlexFDO

Authors Hervé Jégou, Christine Guillemot

Publication date 30 October 2017

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Joint design of fixed-rate source codes and multiresolution channel codes
• Erasure decoding of convolutional codes using first-order representations
• Decoding mixed errors and erasures in permutation codes
• Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Correction
• scientific article; zbMATH DE number 3920373
• Optimal Multiplexed Erasure Codes for Streaming Messages With Different Decoding Delays
• A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes (Corresp.)
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• On the constructions of multiple-burst error-correcting codes
• Error-correcting codes for a compound channel

This page was built for publication: Error-resilient first-order multiplexed source codes: performance bounds, design and decoding algorithms

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