On the public citation graph

New single asymmetric error-correcting codes

0 signed · 25 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.1016/s0019-9958(79)90329-2openalex-snapshot
On the theory of binary asymmetric error correcting codes
inferredcites →https://doi.org/10.1109/18.149514openalex-snapshot
New lower bounds for binary codes of asymmetric distance two
inferredcites →https://doi.org/10.1109/18.21262openalex-snapshot
Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6
inferredcites →https://doi.org/10.1109/18.45293openalex-snapshot
New lower bounds for constant weight codes
inferredcites →https://doi.org/10.1109/18.59932openalex-snapshot
A new table of constant weight codes
inferredcites →https://doi.org/10.1109/tit.1959.1057489openalex-snapshot
Single error-correcting codes for asymmetric binary channels
inferredcites →https://doi.org/10.1109/tit.1973.1054954openalex-snapshot
A class of codes for asymmetric channels and a problem from the additive theory of numbers
inferredcites →https://doi.org/10.1109/tit.1978.1055827openalex-snapshot
Bounds for binary codes of length less than 25
inferredcites →https://doi.org/10.1109/tit.1981.1056290openalex-snapshot
Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_30openalex-snapshot
Constructions for Binary Codes Correcting Asymmetric Errors from Function Fields
inferred← citeshttps://doi.org/10.1007/s12243-020-00816-wopenalex-snapshot
Integer codes correcting single asymmetric errors
inferred← citeshttps://doi.org/10.1016/j.ffa.2018.10.004openalex-snapshot
A construction of V-sequences and its application to binary asymmetric error-correcting codes
inferred← citeshttps://doi.org/10.1109/18.817525openalex-snapshot
A single asymmetric error-correcting code with 2/sup 13/ codewords of dimension 17
inferred← citeshttps://doi.org/10.1109/18.825839openalex-snapshot
On systematic single asymmetric error-correcting codes
inferred← citeshttps://doi.org/10.1109/allerton.2013.6736585openalex-snapshot
Improved bounds and constructions for granular media coding
inferred← citeshttps://doi.org/10.1109/ccece.1997.614793openalex-snapshot
A new single asymmetric error correcting code of length 19
inferred← citeshttps://doi.org/10.1109/isit.1998.708796openalex-snapshot
On systematic single asymmetric error correcting codes
inferred← citeshttps://doi.org/10.1109/isit.2011.6033689openalex-snapshot
Nonuniform codes for correcting asymmetric errors
inferred← citeshttps://doi.org/10.1109/isit.2011.6033692openalex-snapshot
On codes that correct asymmetric errors with graded magnitude distribution
inferred← citeshttps://doi.org/10.1109/isit.2012.6284659openalex-snapshot
New constructions of codes for asymmetric channels via concatenation
inferred← citeshttps://doi.org/10.1109/tit.2003.820028openalex-snapshot
New lower bounds and constructions for binary codes correcting asymmetric errors
inferred← citeshttps://doi.org/10.1109/tit.2013.2241175openalex-snapshot
Nonuniform Codes for Correcting Asymmetric Errors in Data Storage
inferred← citeshttps://doi.org/10.1109/tit.2015.2401567openalex-snapshot
New Constructions of Codes for Asymmetric Channels via Concatenation
inferred← citeshttps://doi.org/10.1109/tit.2015.2445758openalex-snapshot
New Bounds and Constructions for Granular Media Coding
inferred← citeshttps://doi.org/10.7907/82kv-2h11openalex-snapshot
Randomness and Noise in Information Systems
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.