On the public citation graph

Quasi-cyclic unit memory convolutional codes

0 signed · 42 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1049/ep.1968.0141openalex-snapshot
Shift Register Sequences
inferredcites →https://doi.org/10.1109/tcom.1976.1093316openalex-snapshot
Distance and computation in sequential decoding
inferredcites →https://doi.org/10.1109/tit.1970.1054478openalex-snapshot
Circulant bases for cyclic codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1970.1054541openalex-snapshot
Convolutional codes I: Algebraic structure
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.1976.1055519openalex-snapshot
Minimum weight convolutional codewords of finite length (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1976.1055531openalex-snapshot
Structure and constructions of cyclic convolutional codes
inferredcites →https://doi.org/10.1109/tit.1976.1055557openalex-snapshot
Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1978.1055850openalex-snapshot
Further results on binary convolutional codes with an optimum distance profile (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1979.1056014openalex-snapshot
Some optimal partial-unit-memory codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1980.1056194openalex-snapshot
Asymptotically catastrophic convolutional codes
inferredcites →https://doi.org/10.1109/tit.1983.1056739openalex-snapshot
Bounds on distances and error exponents of unit memory codes
inferredcites →https://doi.org/10.1109/tit.1987.1057356openalex-snapshot
An updated table of minimum-distance bounds for binary linear codes
inferredcites →https://doi.org/10.1137/0137027openalex-snapshot
A Connection Between Block and Convolutional Codes
inferredcites →https://doi.org/10.1142/9361openalex-snapshot
Shift Register Sequences

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-3-319-49984-0_4openalex-snapshot
On Optimal Extended Row Distance Profile
inferred← citeshttps://doi.org/10.1007/s00200-006-0014-9openalex-snapshot
On Doubly-Cyclic Convolutional Codes
inferred← citeshttps://doi.org/10.1016/j.laa.2005.06.023openalex-snapshot
On the weight distribution of convolutional codes
inferred← citeshttps://doi.org/10.1016/j.laa.2007.03.004openalex-snapshot
State space realizations and monomial equivalence for convolutional codes
inferred← citeshttps://doi.org/10.1049/el:19921111openalex-snapshot
New optimal partial unit memory codes
inferred← citeshttps://doi.org/10.1049/el:19931351openalex-snapshot
New optimal partial unit memory codes based on extended BCH codes
inferred← citeshttps://doi.org/10.1049/iet-com.2012.0810openalex-snapshot
Multiscale unit‐memory convolutional codes
inferred← citeshttps://doi.org/10.1109/18.108274openalex-snapshot
On unit constraint-length convolutional codes
inferred← citeshttps://doi.org/10.1109/18.256525openalex-snapshot
Using combinatorial optimization to design good unit-memory convolutional codes
inferred← citeshttps://doi.org/10.1109/18.259645openalex-snapshot
Bounded distance decoding of unit memory codes
inferred← citeshttps://doi.org/10.1109/18.508862openalex-snapshot
A directed search approach for unit-memory convolutional codes
inferred← citeshttps://doi.org/10.1109/18.567735openalex-snapshot
Two-step trellis decoding of partial unit memory convolutional codes
inferred← citeshttps://doi.org/10.1109/18.568719openalex-snapshot
Low-complexity decoding of partial unit memory codes on precoded partial-response channels
inferred← citeshttps://doi.org/10.1109/isit.1991.695252openalex-snapshot
Some Partial Unit Memory Convolutional Codes
inferred← citeshttps://doi.org/10.1109/isit.2005.1523421openalex-snapshot
Reed-Solomon convolutional codes
inferred← citeshttps://doi.org/10.1109/tit.2005.862100openalex-snapshot
Strongly-MDS convolutional codes
inferred← citeshttps://doi.org/10.1109/tit.2008.917664openalex-snapshot
On the MacWilliams Identity for Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2009.2021302openalex-snapshot
A MacWilliams Identity for Convolutional Codes: The General Case
inferred← citeshttps://doi.org/10.1109/tit.2016.2588506openalex-snapshot
Construction of Partial-Unit-Memory MDS Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.3031207openalex-snapshot
Cyclic and Convolutional Codes With Locality
inferred← citeshttps://doi.org/10.1142/s0219498806001855openalex-snapshot
A CLASS OF ONE-DIMENSIONAL MDS CONVOLUTIONAL CODES
inferred← citeshttps://doi.org/10.3934/amc.2009.3.179openalex-snapshot
On isometries for convolutional codes
inferred← citeshttps://doi.org/10.48550/arxiv.0812.5104openalex-snapshot
On Quantum and Classical Error Control Codes: Constructions and Applications
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.