On the public citation graph
Linear and cyclic codes over direct product of finite chain rings
0 signed · 29 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/pl00012382openalex-snapshot
On the Structure of Linear and Cyclic Codes over a Finite Chain Ring
inferredcites →https://doi.org/10.1007/s10623-009-9316-9openalex-snapshot
$${{{\mathbb Z}_2}{{\mathbb Z}_4}}$$ -linear codes: generator matrices and duality
inferredcites →https://doi.org/10.1007/s10623-009-9340-9openalex-snapshot
$${\mathbb{Z}_2\mathbb{Z}_4}$$ -linear codes: rank and kernel
inferredcites →https://doi.org/10.1007/s10623-010-9437-1openalex-snapshot
Maximum distance separable codes over $${\mathbb{Z}_4}$$ and $${\mathbb{Z}_2 \times \mathbb{Z}_4}$$
inferredcites →https://doi.org/10.1016/j.ffa.2016.02.003openalex-snapshot
On double cyclic codes over Z4
inferredcites →https://doi.org/10.1080/00207160.2013.859854openalex-snapshot
On ℤ2ℤ2[u]-additive codes
inferredcites →https://doi.org/10.1080/03081087.2014.952728openalex-snapshot
On ℤprℤps-additive codes
inferredcites →https://doi.org/10.1109/18.312154openalex-snapshot
The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
inferredcites →https://doi.org/10.1109/18.556115openalex-snapshot
Translation-invariant propelinear codes
inferredcites →https://doi.org/10.1109/tit.2004.831789openalex-snapshot
Cyclic and Negacyclic Codes Over Finite Chain Rings
inferredcites →https://doi.org/10.1109/tit.2014.2299791openalex-snapshot
$\BBZ_{2}\BBZ_{4}$ -Additive Cyclic Codes
inferredcites →https://doi.org/10.1109/tit.2016.2611528openalex-snapshot
${\mathbb {Z}}_{2}{\mathbb {Z}}_{4}$ -Additive Cyclic Codes, Generator Polynomials, and Dual Codes
inferredcites →https://doi.org/10.12785/amis/070617openalex-snapshot
The Structure of Z2Z2s-Additive Codes: Bounds on the Minimum Distance
inferredcites →https://doi.org/10.1504/ijicot.2015.072637openalex-snapshot
Double cyclic codes over 𝔽q + u𝔽q + u2𝔽q
inferredcites →https://doi.org/10.3934/amc.2012.6.287openalex-snapshot
Characterization and constructions of self-dual codes over $\mathbb Z_2\times \mathbb Z_4$
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mma.8240openalex-snapshot
Kalman reduced form and pole placement by state feedback for multi‐input linear systems over Hermite rings
inferred← citeshttps://doi.org/10.1007/s00200-019-00397-9openalex-snapshot
Linear codes over $$\mathbb {F}_2 \times (\mathbb {F}_2+v\mathbb {F}_2)$$ and the MacWilliams identities
inferred← citeshttps://doi.org/10.1007/s10623-025-01740-7openalex-snapshot
On Eisenstein additive codes over chain rings and linear codes over mixed alphabets
inferred← citeshttps://doi.org/10.1007/s12095-020-00461-zopenalex-snapshot
Self-dual codes over $\mathbb {F}_{2} \times (\mathbb {F}_{2}+v\mathbb {F}_{2})$
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112310openalex-snapshot
On F 2 R S -cyclic codes and their applications in constructing optimal codes
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114465openalex-snapshot
On Galois LCD codes and LCPs of codes over mixed alphabets
inferred← citeshttps://doi.org/10.1016/j.ffa.2022.102125openalex-snapshot
Galois LCD codes over mixed alphabets
inferred← citeshttps://doi.org/10.1016/j.ffa.2026.102887openalex-snapshot
Galois self-orthogonal Gray images of linear codes over Fq[u]〈u2〉: Applications to EAQECCs, intersecting codes and trellis complexities
inferred← citeshttps://doi.org/10.1109/tit.2022.3215593openalex-snapshot
Double Constacyclic Codes Over Two Finite Commutative Chain Rings
inferred← citeshttps://doi.org/10.3934/amc.2025026openalex-snapshot
On $ {{\mathbb{Z}}_p{\mathbb{Z}}_{p^2}\dots{\mathbb{Z}}_{p^s}} $ -additive codes: Linearity, duality and $ (G_1,G_2,\dots,G_s) $ -codes
inferred← citeshttps://doi.org/10.3934/amc.2025038openalex-snapshot
Construction and enumeration of self-orthogonal, self-dual and complementary-dual Eisenstein additive cyclic codes over finite commutative chain rings
inferred← citeshttps://doi.org/10.48550/arxiv.2105.09547openalex-snapshot
Constacyclic Codes over Commutative Finite Principal Ideal Rings
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.