On the public citation graph
Constructing strongly-MDS convolutional codes with maximum distance profile
0 signed · 46 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.1002/9781119098799.fmatteropenalex-snapshot
Fundamentals of Convolutional Coding
inferredcites →https://doi.org/10.1007/978-1-4613-0165-3_2openalex-snapshot
Connections Between Linear Systems and Convolutional Codes
inferredcites →https://doi.org/10.1007/s002000050120openalex-snapshot
Maximum Distance Separable Convolutional Codes
inferredcites →https://doi.org/10.1016/j.laa.2004.06.007openalex-snapshot
Matrix fraction descriptions in convolutional coding
inferredcites →https://doi.org/10.1016/j.laa.2008.02.011openalex-snapshot
On superregular matrices and MDP convolutional codes
inferredcites →https://doi.org/10.1016/j.laa.2013.06.013openalex-snapshot
A new class of superregular matrices and MDP convolutional codes
inferredcites →https://doi.org/10.1016/j.laa.2016.02.034openalex-snapshot
Superregular matrices and applications to convolutional codes
inferredcites →https://doi.org/10.1016/j.sysconle.2004.06.005openalex-snapshot
Convolutional codes with maximum distance profile
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/90.779192openalex-snapshot
End-to-end Internet packet dynamics
inferredcites →https://doi.org/10.1109/9780470544693openalex-snapshot
Fundamentals of Convolutional Coding
inferredcites →https://doi.org/10.1109/isit.2008.4595148openalex-snapshot
Coding over an erasure channel with a large alphabet size
inferredcites →https://doi.org/10.1109/isit.2009.5205686openalex-snapshot
Decoding of MDP convolutional codes over the erasure channel
inferredcites →https://doi.org/10.1109/lcomm.2004.833807openalex-snapshot
Systematic MDS Erasure Codes Based on Vandermonde Matrices
inferredcites →https://doi.org/10.1109/prdc.2001.992706openalex-snapshot
Analysis of using convolutional codes to recover packet losses over burst erasure channels
inferredcites →https://doi.org/10.1109/tit.1973.1055030openalex-snapshot
Structural analysis of convolutional codes via dual codes
inferredcites →https://doi.org/10.1109/tit.1985.1057113openalex-snapshot
On generator matrices of MDS codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.2005.862100openalex-snapshot
Strongly-MDS convolutional codes
inferredcites →https://doi.org/10.1109/tit.2011.2171530openalex-snapshot
Decoding of Convolutional Codes Over the Erasure Channel
inferredcites →https://doi.org/10.1109/tit.2015.2509075openalex-snapshot
Maximum Distance Separable 2D Convolutional Codes
inferredcites →https://doi.org/10.1137/050638977openalex-snapshot
The Existence of Strongly MDS Convolutional Codes
inferredcites →https://doi.org/10.5167/uzh-44714openalex-snapshot
Reverse-maximum distance profile convolutional codes over the erasure channel
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-3-319-49984-0_4openalex-snapshot
On Optimal Extended Row Distance Profile
inferred← citeshttps://doi.org/10.1007/s10623-016-0204-9openalex-snapshot
On MDS convolutional codes over $${\mathbb {Z}}_{p^{r}}$$ Z p r
inferred← citeshttps://doi.org/10.1007/s10623-017-0346-4openalex-snapshot
Concatenation of convolutional codes and rank metric codes for multi-shot network coding
inferred← citeshttps://doi.org/10.1007/s10623-019-00661-6openalex-snapshot
Necessary field size and probability for MDP and complete MDP convolutional codes
inferred← citeshttps://doi.org/10.1007/s13398-019-00744-yopenalex-snapshot
Block Toeplitz matrices for burst-correcting convolutional codes
inferred← citeshttps://doi.org/10.1007/s13398-020-00850-2openalex-snapshot
1/n Turbo codes from linear system point of view
inferred← citeshttps://doi.org/10.1016/j.ffa.2020.101677openalex-snapshot
Systematic maximum sum rank codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2021.101877openalex-snapshot
On the existence and construction of maximum distance profile convolutional codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2023.102205openalex-snapshot
Construction of systematic (k + 1,k) memory MDS sliding window codes over embedded fields
inferred← citeshttps://doi.org/10.1016/j.laa.2016.02.034openalex-snapshot
Superregular matrices and applications to convolutional codes
inferred← citeshttps://doi.org/10.1080/03081087.2023.2169232openalex-snapshot
Weighted Reed–Solomon convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.2019.8849486openalex-snapshot
Unrestricted Generalized Column Distances: A Wider Definition
inferred← citeshttps://doi.org/10.1109/itw44776.2019.8988926openalex-snapshot
An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures
inferred← citeshttps://doi.org/10.1109/tit.2018.2802540openalex-snapshot
Rate $(n-1)/n$ Systematic Memory Maximum Distance Separable Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2870436openalex-snapshot
Column Distances of Convolutional Codes Over ${\mathbb Z}_{p^r}$
inferred← citeshttps://doi.org/10.1109/tit.2020.2977638openalex-snapshot
Locally Repairable Convolutional Codes With Sliding Window Repair
inferred← citeshttps://doi.org/10.1109/tit.2020.2999987openalex-snapshot
Generalized Column Distances
inferred← citeshttps://doi.org/10.1109/tit.2020.3015698openalex-snapshot
Complete j-MDP Convolutional Codes
inferred← citeshttps://doi.org/10.1142/s0219498819501056openalex-snapshot
Complete MDP convolutional codes
inferred← citeshttps://doi.org/10.1142/s0219498821502078openalex-snapshot
On the left primeness of some polynomial matrices with applications to convolutional codes
inferred← citeshttps://doi.org/10.3390/axioms13030197openalex-snapshot
Optimal Construction for Decoding 2D Convolutional Codes over an Erasure Channel
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.