On the public citation graph

On minimum distance bounds for abelian codes

0 signed · 22 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/bf01195337openalex-snapshot
Metacyclic error-correcting codes
inferredcites →https://doi.org/10.1016/0041-5553(64)90132-6openalex-snapshot
Representation theory of finite groups and associative algebras
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6178-8openalex-snapshot
An Introduction to Group Representation Theory
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/tit.1985.1057109openalex-snapshot
The concatenated structure of cyclic and Abelian codes
inferredcites →https://doi.org/10.1109/tit.1986.1057134openalex-snapshot
On the minimum distance of cyclic codes
inferredcites →https://doi.org/10.2307/2311038openalex-snapshot
Representation Theory of Finite Groups and Associative Algebras.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00233-006-0647-9openalex-snapshot
An Algorithm for Computing the Minimum Distances of Extensions of BCH Codes Embedded in Semigroup Rings
inferred← citeshttps://doi.org/10.1007/s13226-021-00187-5openalex-snapshot
Essential idempotents in group algebras and coding theory
inferred← citeshttps://doi.org/10.1016/j.ffa.2003.10.002openalex-snapshot
Artin–Schreier curves and weights of two-dimensional cyclic codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2006.12.003openalex-snapshot
Multidimensional cyclic codes and Artin–Schreier type hypersurfaces over finite fields
inferred← citeshttps://doi.org/10.1057/9780230618459_2openalex-snapshot
The Archaeology and Early History of the Persian Gulf
inferred← citeshttps://doi.org/10.1088/1742-6596/1160/1/012012openalex-snapshot
Implementation of an algorithm to compute the strong apparent distance of bivariate codes
inferred← citeshttps://doi.org/10.1090/conm/376/06948openalex-snapshot
Recent results on ring constructions for error-correcting codes
inferred← citeshttps://doi.org/10.1109/itw.2013.6691285openalex-snapshot
Computing the Camion's multivariate BCH bound
inferred← citeshttps://doi.org/10.1109/tit.2015.2512594openalex-snapshot
Apparent Distance and a Notion of BCH Multivariate Codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2868446openalex-snapshot
From ds-Bounds for Cyclic Codes to True Minimum Distance for Abelian Codes
inferred← citeshttps://doi.org/10.1145/2768577.2768597openalex-snapshot
A notion of multivariate BCH bounds and codes
inferred← citeshttps://doi.org/10.13069/jacodesmath.284931openalex-snapshot
Essential idempotents and simplex codes
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2493openalex-snapshot
Artin-Schreier families and 2-D cycle codes
inferred← citeshttps://doi.org/10.48550/arxiv.1604.02949openalex-snapshot
Ds-bounds for cyclic codes: new bounds for abelian codes
inferred← citeshttps://doi.org/10.48550/arxiv.1704.03761openalex-snapshot
From ds-bounds for cyclic codes to true distance for abelian 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.