On the public citation graph
Binary linear quasi-perfect codes are normal
0 signed · 23 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.1016/0012-365x(85)90025-1openalex-snapshot
On the cosets of the simplex code
inferredcites →https://doi.org/10.1016/0012-365x(92)90118-yopenalex-snapshot
Orphan structure of the first-order Reed-Muller codes
inferredcites →https://doi.org/10.1109/18.52488openalex-snapshot
Orphans of the first order Reed-Muller codes
inferredcites →https://doi.org/10.1109/18.59947openalex-snapshot
More binary covering codes are normal
inferredcites →https://doi.org/10.1109/tcom.1982.1095473openalex-snapshot
On the Probability of Undetected Error for Linear Block Codes
inferredcites →https://doi.org/10.1109/tcom.1984.1096175openalex-snapshot
On the Probability of Undetected Error for the Maximum Distance Separable Codes
inferredcites →https://doi.org/10.1109/tit.1984.1056838openalex-snapshot
Poor error correction codes are poor error detection codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1985.1057039openalex-snapshot
On the covering radius of codes
inferredcites →https://doi.org/10.1109/tit.1986.1057227openalex-snapshot
Further results on the covering radius of codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01388486openalex-snapshot
Bounds for binary multiple covering codes
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90113-9openalex-snapshot
Classification of cosets of the Reed-Muller code R(m−3,m)
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90164-3openalex-snapshot
On the normality of multiple covering codes
inferred← citeshttps://doi.org/10.1023/a:1008297926857openalex-snapshot
The Reed-Muller Code R(1,7) Is Normal
inferred← citeshttps://doi.org/10.1023/a:1008397405457openalex-snapshot
Some Upper Bounds on the Covering Radii of Linear Codes Over Fq and Their Applications
inferred← citeshttps://doi.org/10.1109/18.212268openalex-snapshot
Some results on the covering radii of Reed-Muller codes
inferred← citeshttps://doi.org/10.1109/18.243470openalex-snapshot
Distributed estimation and quantization
inferred← citeshttps://doi.org/10.3934/amc.2011.5.681openalex-snapshot
All binary linear codes of lengths up to 18 or redundancy up to 10 are normal
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.