On the public citation graph
Codes from planar near rings
0 signed · 24 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/bf03322379openalex-snapshot
Applications of Planar Nearrings to Geometry And Combinatorics
inferredcites →https://doi.org/10.1016/0021-8693(72)90150-0openalex-snapshot
Generating balanced incomplete block designs from planar near rings
inferredcites →https://doi.org/10.1016/c2013-0-10384-4openalex-snapshot
The Mathematical Theory of Coding
inferredcites →https://doi.org/10.1016/s0021-9800(67)80025-5openalex-snapshot
On tactical configurations and error-correcting codes
inferredcites →https://doi.org/10.1016/s0167-5060(08)70229-2openalex-snapshot
Circular Block Designs from Planar Near-Rings
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1080/00029890.1981.11995202openalex-snapshot
Planes, Biplanes, and their 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/jabr.1996.0347openalex-snapshot
On Finite Circular Planar Nearrings
inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_7openalex-snapshot
Codes and Combinatorial Structures from Circular Planar Nearrings
inferred← citeshttps://doi.org/10.1007/978-94-011-0359-6_11openalex-snapshot
On Codes From Residue Class Ring Generated Finite Ferrero Pairs
inferred← citeshttps://doi.org/10.1007/978-94-011-0359-6_29openalex-snapshot
A Decoding Strategy for Equal Weight Codes From Ferrero Pairs
inferred← citeshttps://doi.org/10.1007/bf01531328openalex-snapshot
A category of geometric spaces: Some computational aspects
inferred← citeshttps://doi.org/10.1007/s00025-012-0303-5openalex-snapshot
BIB-Designs from Circular Nearrings
inferred← citeshttps://doi.org/10.1007/s00605-004-0268-xopenalex-snapshot
Circularity of Finite Groups without Fixed Points
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.047openalex-snapshot
New designs from circular nearrings
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70931-2openalex-snapshot
Codes, block designs, Frobenius groups, and near-rings
inferred← citeshttps://doi.org/10.1016/s1570-7954(96)80017-9openalex-snapshot
Near-rings and Near-fields
inferred← citeshttps://doi.org/10.12732/ijam.v31i2.9openalex-snapshot
IMAGE ENCRYPTION USING THE INCIDENCE MATRIX
inferred← citeshttps://doi.org/10.48550/arxiv.1012.1059openalex-snapshot
Circular planar nearrings: geometrical and combinatorial aspects
inferred← citeshttps://doi.org/10.9790/5728-0467780openalex-snapshot
Planar Near-Rings And Coding Theory
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.