On the public citation graph

Bounds and constructions of asymmetric or unidirectional error-correcting codes

0 signed · 27 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/0166-218x(87)90046-1openalex-snapshot
Some lower bounds for constant weight codes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/18.104336openalex-snapshot
New lower bounds for asymmetric and unidirectional codes
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.32156openalex-snapshot
Bounds and constructions for codes correcting unidirectional errors
inferredcites →https://doi.org/10.1109/18.54883openalex-snapshot
Some new binary codes correcting asymmetric/unidirectional errors
inferredcites →https://doi.org/10.1109/18.59932openalex-snapshot
A new table of constant weight codes
inferredcites →https://doi.org/10.1109/proc.1980.11608openalex-snapshot
The theory of error-correcting codes
inferredcites →https://doi.org/10.1109/tc.1982.1676034openalex-snapshot
Theory of Unidirectional Error Correcting/Detecting 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.1981.1056290openalex-snapshot
Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1981.1056291openalex-snapshot
Upper bounds on codes correcting asymmetric errors (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1987.1057301openalex-snapshot
New upper bounds on the size of codes correcting asymmetric errors (Corresp.)
inferredcites →https://doi.org/10.1111/j.1749-6632.1970.tb45154.xopenalex-snapshot
A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-56686-4_37openalex-snapshot
Some features of binary block codes for correcting asymmetric errors
inferred← citeshttps://doi.org/10.1007/978-3-319-53139-7_5openalex-snapshot
Packing: Combinatorial Models for Various Types of Errors
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/s10623-024-01534-3openalex-snapshot
Optimal combinatorial neural codes via symmetric designs
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.1016/j.jcta.2009.03.005openalex-snapshot
Two-batch liar games on a general bounded channel
inferred← citeshttps://doi.org/10.1109/18.651069openalex-snapshot
Greedy and heuristic algorithms for codes and colorings
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.2005.860449openalex-snapshot
Unidirectional covering codes
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.2026.3669230openalex-snapshot
Constructions of Combinatorial Neural Codes With Asymmetric Discrepancy
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607132openalex-snapshot
On q-ary codes correcting all unidirectional errors of a limited magnitude
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.