On the public citation graph
Shadow Codes over Z4
0 signed · 40 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_10openalex-snapshot
Certain self-dual codes over ℤ4 and the odd Leech lattice
inferredcites →https://doi.org/10.1007/bf01194097openalex-snapshot
�ber die Identit�t von MacWilliams f�r die Gewichtsfunktion von Codes
inferredcites →https://doi.org/10.1016/0022-314x(82)90084-1openalex-snapshot
On the enumeration of lattices of determinant one
inferredcites →https://doi.org/10.1016/0097-3165(93)90070-oopenalex-snapshot
Self-dual codes over the integers modulo 4
inferredcites →https://doi.org/10.1016/s0012-365x(98)00358-6openalex-snapshot
Optimal self-dual codes over Z4
inferredcites →https://doi.org/10.1016/s0019-9958(73)90273-8openalex-snapshot
An upper bound for self-dual codes
inferredcites →https://doi.org/10.1090/s0273-0979-1993-00426-9openalex-snapshot
A linear construction for certain Kerdock and Preparata codes
inferredcites →https://doi.org/10.1109/18.165461openalex-snapshot
Existence of some extremal self-dual codes
inferredcites →https://doi.org/10.1109/18.370138openalex-snapshot
Quaternary quadratic residue codes and unimodular lattices
inferredcites →https://doi.org/10.1109/18.382022openalex-snapshot
Shadow codes and weight enumerators
inferredcites →https://doi.org/10.1109/18.59931openalex-snapshot
A new upper bound on the minimal distance of self-dual codes
inferredcites →https://doi.org/10.1109/18.651058openalex-snapshot
All self-dual Z/sub 4/ codes of length 15 or less are known
inferredcites →https://doi.org/10.1109/18.761269openalex-snapshot
Type II codes, even unimodular lattices, and invariant rings
inferredcites →https://doi.org/10.1109/18.86979openalex-snapshot
Weight enumerators of self-dual codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/ffta.1999.0258openalex-snapshot
Bounds for Self-Dual Codes Over Z4
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/jhep05(2025)105openalex-snapshot
Fermionic CFTs from topological boundaries in abelian Chern-Simons theories
inferred← citeshttps://doi.org/10.1007/s10623-003-4195-yopenalex-snapshot
Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4
inferred← citeshttps://doi.org/10.1007/s10623-026-01948-1openalex-snapshot
Embedding linear codes over $${\mathbb {Z}}_4$$ into self-orthogonal codes
inferred← citeshttps://doi.org/10.1007/s12095-015-0139-4openalex-snapshot
Construction of self-dual codes over ℤ 2 m $\mathbb {Z}_{2^{m}}$
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115018openalex-snapshot
The neighbor graph of self-dual codes over the ring of integers modulo 4
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115310openalex-snapshot
The neighbor graph of linear codes over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.05.012openalex-snapshot
On the classification and enumeration of self-dual codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.11.004openalex-snapshot
Optimal self-dual Z4 -codes and a unimodular lattice in dimension 41
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00310-7openalex-snapshot
Self-dual Z4-codes and Hadamard matrices
inferred← citeshttps://doi.org/10.1109/itcc.2003.1197528openalex-snapshot
On quaternary MacDonald codes
inferred← citeshttps://doi.org/10.1109/tit.2017.2761388openalex-snapshot
Constructions of Formally Self-Dual Codes Over $ {\mathbb Z}_{4}$ and Their Weight Enumerators
inferred← citeshttps://doi.org/10.1142/s1793042111004794openalex-snapshot
CONSTRUCTION OF SOME UNIMODULAR LATTICES WITH LONG SHADOWS
inferred← citeshttps://doi.org/10.1142/s179355711950027xopenalex-snapshot
On codes over ℤp2 and its covering radius
inferred← citeshttps://doi.org/10.1142/s1793557120500333openalex-snapshot
On covering radius of codes over ℤ2p
inferred← citeshttps://doi.org/10.1142/s1793830917500173openalex-snapshot
On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance
inferred← citeshttps://doi.org/10.3934/amc.2011.5.571openalex-snapshot
Codes over $\mathbb{Z}_{2^k}$, Gray map and self-dual codes
inferred← citeshttps://doi.org/10.3934/amc.2014.8.129openalex-snapshot
On the covering radius of some modular codes
inferred← citeshttps://doi.org/10.3934/amc.2026033openalex-snapshot
Neighbors of self-dual codes over the non-commutative ring E
inferred← citeshttps://doi.org/10.47000/tjmcs.1681863openalex-snapshot
The Neighbor Graph of Self-Dual Codes Over Finite Fields
inferred← citeshttps://doi.org/10.48550/arxiv.1206.3038openalex-snapshot
On the Covering Radius of Some Modular Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1711.01803openalex-snapshot
On Codes over $\mathbb{Z}_{p^2}$ and its Covering Radius
inferred← citeshttps://doi.org/10.48550/arxiv.2010.12429openalex-snapshot
Relative projective group codes over chain 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.