Construction of fast recovery codes using a new optimal importance sampling method

DOI10.1109/18.959280MaRDI QIDQ4544746zbMATH OpenOpenAlexFDO

Authors Michael Yung Chung Wei, Lei Wei

Publication date 4 August 2002

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

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

zbMATH Keywords

importance samplingfast simulationMarkov systemsequential decodingfast recovery convolutional codes

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

• New importance sampling methods for simulating sequential decoders
• Importance Sampling for Tanner Trees
• A class of optimum importance sampling strategies
• Optimal importance sampling for Markovian systems with applications to tandem queues
• Nearly optimal importance sampling for Monte Carlo simulation of loss systems

Cited in

(1)

• Importance Sampling for Tanner Trees

This page was built for publication: Construction of fast recovery codes using a new optimal importance sampling method

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