On the public citation graph
A Z/sub 8/-linear lift of the binary Golay code and a nonlinear binary (96,2/sup 37/,24)-code
0 signed · 18 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/3-540-63163-1_21openalex-snapshot
Formal duality of linearly presentable codes over a Galois field
inferredcites →https://doi.org/10.1007/bf02940872openalex-snapshot
Linearly representable codes over chain rings
inferredcites →https://doi.org/10.1023/a:1008240319733openalex-snapshot
Construction of a (64, 2 37, 12) Code via Galois Rings
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.796395openalex-snapshot
Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44828-4_25openalex-snapshot
On the Minimum Distance of Some Families of ℤ2 k-Linear Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_13openalex-snapshot
An Introduction to Ring-Linear Coding Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-59435-9_25openalex-snapshot
On the F p -Linearity of the Generalized Gray Map Image of a $${Z_{{p^{k+1}}}}$$ -Linear Code
inferred← citeshttps://doi.org/10.1007/s10623-006-9003-zopenalex-snapshot
Isometric embeddings of $$\mathbb{Z}_{p^k}$$ in the Hamming space $$\mathbb{F}_{p}^{N}$$ and $$\mathbb{Z}_{p^k}$$ -linear codes
inferred← citeshttps://doi.org/10.1007/s10623-006-9035-4openalex-snapshot
The linear programming bound for codes over finite Frobenius rings
inferred← citeshttps://doi.org/10.1016/j.disc.2004.10.002openalex-snapshot
On bounds for codes over Frobenius rings under homogeneous weights
inferred← citeshttps://doi.org/10.1016/j.disc.2008.06.022openalex-snapshot
On coloured constant composition designs
inferred← citeshttps://doi.org/10.22108/toc.2013.2762openalex-snapshot
Gray isometries for finite $p$-groups
inferred← citeshttps://doi.org/10.3934/amc.2014.8.191openalex-snapshot
Partitions of Frobenius rings induced by the homogeneous weight
inferred← citeshttps://doi.org/10.48550/arxiv.math/0302132openalex-snapshot
Computing Symmetrized Weight Enumerators for Lifted Quadratic Residue Codes
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.