On the public citation graph
Decoding linear block codes using a priority-first search: performance analysis and suboptimal version
0 signed · 44 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4899-2174-1openalex-snapshot
Error-Correction Coding for Digital Communications
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/0166-5316(83)90018-4openalex-snapshot
Probability and statistics with reliability, queuing and computer science applications
inferredcites →https://doi.org/10.1016/0306-4573(85)90100-1openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving.
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/18.21246openalex-snapshot
Coset codes. II. Binary lattices and related codes
inferredcites →https://doi.org/10.1109/18.259636openalex-snapshot
Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes
inferredcites →https://doi.org/10.1109/18.335888openalex-snapshot
Soft trellis-based decoder for linear block codes
inferredcites →https://doi.org/10.1109/18.42214openalex-snapshot
Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
inferredcites →https://doi.org/10.1109/18.79928openalex-snapshot
More efficient soft decoding of the Golay codes
inferredcites →https://doi.org/10.1109/18.86973openalex-snapshot
Reduced lists of error patterns for maximum likelihood soft decoding
inferredcites →https://doi.org/10.1109/26.79287openalex-snapshot
Bit-level soft-decision decoding of Reed-Solomon codes
inferredcites →https://doi.org/10.1109/tit.1967.1054010openalex-snapshot
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
inferredcites →https://doi.org/10.1109/tit.1974.1055186openalex-snapshot
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1974.1055217openalex-snapshot
A decoding algorithm for binary block codes andJ-ary output channels (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1978.1055821openalex-snapshot
Efficient maximum likelihood decoding of linear block codes using a trellis
inferredcites →https://doi.org/10.1109/tit.1979.1056120openalex-snapshot
Decoding linear block codes for minimizing word error rate (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1982.1056468openalex-snapshot
Reduced-search soft-decision trellis coding of linear block codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1986.1057189openalex-snapshot
Optimal soft decision block decoders based on fast Hadamard transform
inferredcites →https://doi.org/10.1137/0137027openalex-snapshot
A Connection Between Block and Convolutional Codes
inferredcites →https://doi.org/10.1145/1056441.1056445openalex-snapshot
Review of "Principles of Artificial Intelligence by Nils J. Nilsson", Tioga Publishing Company, Palo Alto, CA, ISBN 0-935382-01-1.
inferredcites →https://doi.org/10.2307/2288237openalex-snapshot
Probability and Statistics With Reliability, Queuing, and Computer Science Applications.
inferredcites →https://doi.org/10.2307/2314609openalex-snapshot
An Introduction to Probability Theory and Its Applications.
inferredcites →https://doi.org/10.5860/choice.26-3310openalex-snapshot
Algorithmics: theory and practice
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1049/ip-com:20050008openalex-snapshot
Performance evaluation of maximum-likelihood decoded linear binary block codes in AWGN interference using Bonferroni-type and geometrical bounds
inferred← citeshttps://doi.org/10.1093/ietfec/e88-a.10.2721openalex-snapshot
A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding
inferred← citeshttps://doi.org/10.1109/18.490541openalex-snapshot
Computationally efficient soft-decision decoding of linear block codes based on ordered statistics
inferred← citeshttps://doi.org/10.1109/18.737530openalex-snapshot
Efficient heuristic search algorithms for soft-decision decoding of linear block codes
inferred← citeshttps://doi.org/10.1109/access.2018.2866396openalex-snapshot
An Improved $A^{\ast}$ Decoding Algorithm With List Decoding
inferred← citeshttps://doi.org/10.1109/acssc.2003.1292291openalex-snapshot
An optimal two-stage decoding algorithm for linear block codes
inferred← citeshttps://doi.org/10.1109/icc.2004.1312583openalex-snapshot
A new adaptive two-stage maximum-likelihood decoding algorithm for linear block codes
inferred← citeshttps://doi.org/10.1109/isncc58260.2023.10323858openalex-snapshot
Link Analysis and Shortest Path Algorithm for Money Laundry Detection
inferred← citeshttps://doi.org/10.1109/itw.2003.1216757openalex-snapshot
Asymptotic analysis of A* maximum-likelihood decoding with reliability reordering
inferred← citeshttps://doi.org/10.1109/tcomm.2005.849790openalex-snapshot
A New Adaptive Two-Stage Maximum-Likelihood Decoding Algorithm for Linear Block Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2013.020813.120216openalex-snapshot
Advanced Information of Parity Bits for Decoding Short Linear Block Codes Using the A* Algorithm
inferred← citeshttps://doi.org/10.1109/tcomm.2015.2466233openalex-snapshot
On $A^{\ast}$ Algorithms for Decoding Short Linear Block Codes
inferred← citeshttps://doi.org/10.1109/tit.2004.826644openalex-snapshot
Box and Match Techniques Applied to Soft-Decision Decoding
inferred← citeshttps://doi.org/10.1109/tit.2006.887510openalex-snapshot
Reliability-Based Soft-Decision Decoding With Multiple Biases
inferred← citeshttps://doi.org/10.1109/wcnc.2010.5506478openalex-snapshot
An Improved A* Algorithm for Decoding Linear Block Codes
inferred← citeshttps://doi.org/10.1109/wcnc.2012.6214045openalex-snapshot
A∗ decoding for a block coded scheme with interblock memory
inferred← citeshttps://doi.org/10.1109/wcnc.2014.6952162openalex-snapshot
Tree-search decoding with path constraints for linear block codes
inferred← citeshttps://doi.org/10.20428/jst.v13i2.76openalex-snapshot
An Improved Trellis Decoding Algorithm for Maximum Likelihood Decoding of Linear Block Codes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0601023openalex-snapshot
Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0701026openalex-snapshot
Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.