Sequential decoding based on an error criterion
From MaRDI portal
Publication:4008331
DOI10.1109/18.135640zbMATH Open0749.94021OpenAlexW2129563708MaRDI QIDQ4008331FDOQ4008331
Authors: John B. Anderson 
Publication date: 27 September 1992
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.135640
Recommendations
Viterbi algorithmsearch regionbinary symmetric channelblock codesstack algorithmsequential decodingerror criterionchannel decoding\(M\)- algorithmdecoder algorithmsFano-like algorithmsGallager reliability exponent
Cited In (15)
- ARQ with Sequential Decoding of Packetized Data: Queueing Analysis
- Computationally Optimal Metric-First Code Tree Search Algorithms
- A unified framework for tree search decoding: rediscovering the sequential decoder
- Variable-length codes and the Fano metric
- On decoding by error location and dependent sets of error positions
- Title not available (Why is that?)
- Search properties of some sequential decoding algorithms
- A branching process analysis of the average number of computations of the stack algorithm
- On-the-fly decoder for multiple byte errors
- Sequential decoding with trellis shaping
- Comparative analysis of sequential decoding algorithms
- MHD Free Convection from a Vertical Semi‐Infinite Flat Plate with a Step Change in the Magnetic Field
- Sequential Decoding - The Computation Problem*
- Decoding a perturbed sequence generated by an LFSR
- Sequence acquisition using bit estimation techniques
This page was built for publication: Sequential decoding based on an error criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4008331)
