On the public citation graph
Bidirectional sequential decoding
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.1016/s0019-9958(74)90876-6openalex-snapshot
Convolutional codes III. Sequential decoding
inferredcites →https://doi.org/10.1109/18.135640openalex-snapshot
Sequential decoding based on an error criterion
inferredcites →https://doi.org/10.1109/18.45271openalex-snapshot
A fast algorithm for computing distance spectrum of convolutional codes
inferredcites →https://doi.org/10.1109/26.216512openalex-snapshot
Bidirectional breadth-first algorithms for the decoding of convolutional codes
inferredcites →https://doi.org/10.1109/49.29615openalex-snapshot
An algorithm for computing the distance spectrum of trellis codes
inferredcites →https://doi.org/10.1109/tc.1968.229392openalex-snapshot
Inverses of Linear Sequential Circuits
inferredcites →https://doi.org/10.1109/tcom.1966.1089324openalex-snapshot
The Performance of Sequential Decoding in Conjunction with Efficient Modulation
inferredcites →https://doi.org/10.1109/tcom.1971.1090721openalex-snapshot
A High-Speed Sequential Decoder: Prototype Design and Test
inferredcites →https://doi.org/10.1109/tcom.1977.1093791openalex-snapshot
A multiple stack algorithm for erasurefree decoding of convolutional codes
inferredcites →https://doi.org/10.1109/tcom.1984.1096023openalex-snapshot
Sequential Coding Algorithms: A Survey and Cost Analysis
inferredcites →https://doi.org/10.1109/tit.1967.1053977openalex-snapshot
A lower bound to the distribution of computation for sequential decoding
inferredcites →https://doi.org/10.1109/tit.1968.1054167openalex-snapshot
Reversible convolutional codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1972.1054821openalex-snapshot
An efficient algorithm for computing free distance (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1973.1055028openalex-snapshot
Comments on "An efficient algorithm for computing free distance" by Bahl, L., et al.
inferredcites →https://doi.org/10.1109/tit.1975.1055397openalex-snapshot
Robustly optimal rate one-half binary convolutional codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1975.1055463openalex-snapshot
Generalized stack algorithms for decoding convolutional codes
inferredcites →https://doi.org/10.1147/rd.136.0675openalex-snapshot
Fast Sequential Decoding Algorithm Using a Stack
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471219282.eot348openalex-snapshot
Sequential Decoding of Convolutional Codes
inferred← citeshttps://doi.org/10.1109/18.720542openalex-snapshot
Modulation and coding for linear Gaussian channels
inferred← citeshttps://doi.org/10.1109/18.850682openalex-snapshot
Near-optimal limited-search detection on ISI/CDMA channels and decoding of long convolutional codes
inferred← citeshttps://doi.org/10.1109/18.945254openalex-snapshot
Cutoff rate and signal design for the quasi-static Rayleigh-fading space-time channel
inferred← citeshttps://doi.org/10.1109/26.747805openalex-snapshot
A bidirectional multiple stack algorithm
inferred← citeshttps://doi.org/10.1109/eurcon.2001.937757openalex-snapshot
A new bidirectional algorithm for decoding trellis codes
inferred← citeshttps://doi.org/10.1109/glocom.1998.776581openalex-snapshot
Near Shannon limit decoding for 1% packet error rate
inferred← citeshttps://doi.org/10.1109/glocom.2005.1577921openalex-snapshot
Single antenna interference cancellation using a list-sequential (LISS) algorithm
inferred← citeshttps://doi.org/10.1109/icassp49660.2025.10889909openalex-snapshot
Sequential Decoding of Multiple Traces Over the Syndrome Trellis for Synchronization Errors
inferred← citeshttps://doi.org/10.1109/iccs.2002.1182492openalex-snapshot
Creeper: an algorithm for decoding convolutional codes
inferred← citeshttps://doi.org/10.1109/iciea.2013.6566637openalex-snapshot
Design and implementation of high throughput bidirectional Fano decoding
inferred← citeshttps://doi.org/10.1109/isit.2002.1023532openalex-snapshot
The systolic bidirectional algorithm for decoding trellis codes
inferred← citeshttps://doi.org/10.1109/isit.2005.1523500openalex-snapshot
Closest point search in lattices using sequential decoding
inferred← citeshttps://doi.org/10.1109/pimrc.2009.5450140openalex-snapshot
Bidirectional Fano algorithm for high throughput sequential decoding
inferred← citeshttps://doi.org/10.1109/ssp.2007.4301314openalex-snapshot
Iterative Stack-Based Detection for Unknown ISI Channels
inferred← citeshttps://doi.org/10.1109/tcomm.2007.896097openalex-snapshot
The List-Sequential (LISS) Algorithm and Its Application
inferred← citeshttps://doi.org/10.1109/tcomm.2011.062011.100236openalex-snapshot
High Throughput Parallel Fano Decoding
inferred← citeshttps://doi.org/10.1109/telsks.1999.804740openalex-snapshot
An application of the bidirectional stack algorithm to speech coding
inferred← citeshttps://doi.org/10.1109/tit.2011.2158876openalex-snapshot
Signal Codes: Convolutional Lattice Codes
inferred← citeshttps://doi.org/10.1134/s0032946023030018openalex-snapshot
Convolutional Codes with Optimum Bidirectional Distance Profile
inferred← citeshttps://doi.org/10.1201/9781420041545-36openalex-snapshot
A Read Channel for Magnetic Recording
inferred← citeshttps://doi.org/10.25781/kaust-f50smopenalex-snapshot
Bidirectional Fano Algorithm for Lattice Coded MIMO Channels
inferred← citeshttps://doi.org/10.31857/s0555292323030014openalex-snapshot
SVERTOChNYE KODY S OPTIMAL'NYM DVUSTORONNIM PROFILEM RASSTOYaNIY
showing the first 24 of 25 · page through all 25
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.