On the public citation graph

Linearly representable codes over chain rings

0 signed · 43 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.1007/bf01110216openalex-snapshot
Hjelmslev-Ebenen mit verfeinerten Nachbarschaftsrelationen
inferredcites →https://doi.org/10.1007/bf02992827openalex-snapshot
Finite chain rings
inferredcites →https://doi.org/10.1007/bf03322385openalex-snapshot
Hjelmslev-Räume
inferredcites →https://doi.org/10.1016/0012-365x(84)90116-xopenalex-snapshot
On linear codes which attain the Solomon-Stiffler bound
inferredcites →https://doi.org/10.1016/s0021-9800(70)80066-7openalex-snapshot
On n-uniform Hjelmslev planes
inferredcites →https://doi.org/10.1070/sm1973v020n03abeh001880openalex-snapshot
FINITE PRINCIPAL IDEAL RINGS
inferredcites →https://doi.org/10.1090/conm/225/03225openalex-snapshot
Weight functions and the extension theorem for linear codes over finite 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.661524openalex-snapshot
The Reed-Muller code R(r,m) is not Z/sub 4/-linear for 3≤r≤m-2
inferredcites →https://doi.org/10.1109/18.681328openalex-snapshot
Z/sub 2/k-linear codes
inferredcites →https://doi.org/10.1109/18.746770openalex-snapshot
Type II codes over F/sub 2/+uF/sub 2/
inferredcites →https://doi.org/10.1109/18.749015openalex-snapshot
All Reed-Muller codes are linearly representable over the ring of dual numbers over Z/sub 2/
inferredcites →https://doi.org/10.1515/dma.1991.1.4.365openalex-snapshot
Kerdock code in a cyclic form
inferredcites →https://doi.org/10.37236/1375openalex-snapshot
Codes and Projective Multisets
inferredcites →https://doi.org/10.37236/1489openalex-snapshot
Linear Codes over Finite Chain Rings

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-46796-3_36openalex-snapshot
Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey)
inferred← citeshttps://doi.org/10.1007/978-3-642-56755-1_21openalex-snapshot
MacWilliams Identities for Linear Codes over Finite Frobenius Rings
inferred← citeshttps://doi.org/10.1007/s00200-021-00501-yopenalex-snapshot
On homogeneous arcs and linear codes over finite chain rings
inferred← citeshttps://doi.org/10.1007/s00200-025-00683-9openalex-snapshot
Two families of $${\mathbb {Z}}_{p^{m}}$$-linear codes and their applications
inferred← citeshttps://doi.org/10.1007/s10623-004-1717-1openalex-snapshot
On Linear Codes over $${\mathbb{Z}}_{2^{s}}$$
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.1007/s10623-007-9136-8openalex-snapshot
Ring geometries, two-weight codes, and strongly regular graphs
inferred← citeshttps://doi.org/10.1007/s10623-012-9649-7openalex-snapshot
Non-free extensions of the simplex codes over a chain ring with four elements
inferred← citeshttps://doi.org/10.1007/s10623-012-9653-yopenalex-snapshot
The existence of maximal (q 2, 2)-arcs in projective Hjelmslev planes over chain rings of length 2 and odd prime characteristic
inferred← citeshttps://doi.org/10.1007/s10801-024-01347-6openalex-snapshot
The maximum number of homogeneous weights of linear codes over chain rings
inferred← citeshttps://doi.org/10.1007/s11425-011-4296-4openalex-snapshot
The maximal size of 6- and 7-arcs in projective Hjelmslev planes over chain rings of order 9
inferred← citeshttps://doi.org/10.1016/b978-0-12-813388-0.00004-5openalex-snapshot
Few Weight Codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2004.12.004openalex-snapshot
On maximal arcs in projective Hjelmslev planes over chain rings of even characteristic
inferred← citeshttps://doi.org/10.1016/j.ffa.2012.01.002openalex-snapshot
Properties of codes with two homogeneous weights
inferred← citeshttps://doi.org/10.1016/s1570-7954(07)05005-xopenalex-snapshot
Finite Rings with Applications
inferred← citeshttps://doi.org/10.1090/conm/642/12887openalex-snapshot
On Repeated-Root Constacyclic Codes of Prime Power Length Over Polynomial Residue Rings
inferred← citeshttps://doi.org/10.1109/18.796395openalex-snapshot
Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code
inferred← citeshttps://doi.org/10.1109/18.923742openalex-snapshot
A Z/sub 8/-linear lift of the binary Golay code and a nonlinear binary (96,2/sup 37/,24)-code
inferred← citeshttps://doi.org/10.1109/acct51235.2020.9383345openalex-snapshot
New upper bounds on the maximal size of an arc in a projective Hjelmslev plane
inferred← citeshttps://doi.org/10.1109/tit.2017.2738627openalex-snapshot
Some Repeated-Root Constacyclic Codes Over Galois Rings
inferred← citeshttps://doi.org/10.1109/tit.2021.3114636openalex-snapshot
The Geometry of Two-Weight Codes Over ℤpm
inferred← citeshttps://doi.org/10.1142/s0219498804000873openalex-snapshot
FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
inferred← citeshttps://doi.org/10.1142/s0219498825500963openalex-snapshot
A class of t-weight codes and its applications
inferred← citeshttps://doi.org/10.37236/1489openalex-snapshot
Linear Codes over Finite Chain Rings
inferred← citeshttps://doi.org/10.3934/amc.2007.1.65openalex-snapshot
On blocking sets in projective Hjelmslev planes
inferred← citeshttps://doi.org/10.3934/amc.2011.5.11openalex-snapshot
The dual construction for arcs in projective Hjelmslev spaces
inferred← citeshttps://doi.org/10.4213/dm272openalex-snapshot
Дуги в проективных ельмслевовых плоскостях
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.