On the public citation graph
Distances and distance bounds for convolutional codes—an overview
0 signed · 23 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-3-7091-3008-7_1openalex-snapshot
Error Bounds for Tree Codes, Trellis Codes, and Convolutional Codes with Encoding and Decoding Procedures
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/tc.1968.229392openalex-snapshot
Inverses of Linear Sequential Circuits
inferredcites →https://doi.org/10.1109/tcom.1971.1090700openalex-snapshot
Convolutional Codes and Their Performance in Communication Systems
inferredcites →https://doi.org/10.1109/tcom.1971.1090720openalex-snapshot
Nonsystematic convolutional codes for sequential decoding in space applications
inferredcites →https://doi.org/10.1109/tcom.1976.1093316openalex-snapshot
Distance and computation in sequential decoding
inferredcites →https://doi.org/10.1109/tit.1969.1054337openalex-snapshot
A construction technique for random-error-correcting convolutional codes
inferredcites →https://doi.org/10.1109/tit.1970.1054541openalex-snapshot
Convolutional codes I: Algebraic structure
inferredcites →https://doi.org/10.1109/tit.1974.1055223openalex-snapshot
Free distance bounds for convolutional codes
inferredcites →https://doi.org/10.1109/tit.1975.1055397openalex-snapshot
Robustly optimal rate one-half binary convolutional codes (Corresp.)
inferredcites →https://doi.org/10.1147/rd.45.0532openalex-snapshot
A Bound for Error-Correcting Codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4613-0165-3_21openalex-snapshot
Unit Memory Convolutional Codes with Maximum Distance
inferred← citeshttps://doi.org/10.1007/978-1-4615-3998-8_6openalex-snapshot
Sequential Coding Algorithms
inferred← citeshttps://doi.org/10.1007/s002000050120openalex-snapshot
Maximum Distance Separable Convolutional Codes
inferred← citeshttps://doi.org/10.1016/j.sysconle.2004.06.005openalex-snapshot
Convolutional codes with maximum distance profile
inferred← citeshttps://doi.org/10.1109/18.567750openalex-snapshot
On the generalized Hamming weights of convolutional codes
inferred← citeshttps://doi.org/10.1109/18.661531openalex-snapshot
Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder
inferred← citeshttps://doi.org/10.1109/18.796408openalex-snapshot
Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
inferred← citeshttps://doi.org/10.1109/18.825838openalex-snapshot
On classes of convolutional codes that are not asymptotically catastrophic
inferred← citeshttps://doi.org/10.1109/18.930938openalex-snapshot
Constructions of MDS-convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.1995.531511openalex-snapshot
Generalized Hamming weights of convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.1998.708913openalex-snapshot
Convolutional code constructions resulting in maximal or near maximal free distance
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.