On the public citation graph
New lower bounds for asymmetric and unidirectional codes
0 signed · 36 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/s0019-9958(66)90128-8openalex-snapshot
A search technique for quasi-perfect 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.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.45293openalex-snapshot
New lower bounds for constant weight codes
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/tc.1982.1676034openalex-snapshot
Theory of Unidirectional Error Correcting/Detecting Codes
inferredcites →https://doi.org/10.1109/tit.1982.1056555openalex-snapshot
Construction for binary asymmetric error-correcting codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1986.1057187openalex-snapshot
Lexicographic codes: Error-correcting codes from game theory
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-0-387-98096-6_12openalex-snapshot
Estimating the size of correcting codes using extremal graph problems
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/bf01294837openalex-snapshot
Bounds and constructions of asymmetric or unidirectional error-correcting codes
inferred← citeshttps://doi.org/10.1007/s10623-015-0156-5openalex-snapshot
Galois geometries and coding theory
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.1023/a:1015579729144openalex-snapshot
New Lower Bounds of the Size of Error-Correcting Codes for the Z-Channel
inferred← citeshttps://doi.org/10.1109/18.179360openalex-snapshot
Constructions for perfect mixed codes and other covering codes
inferred← citeshttps://doi.org/10.1109/18.370148openalex-snapshot
The threshold probability of a code
inferred← citeshttps://doi.org/10.1109/18.651069openalex-snapshot
Greedy and heuristic algorithms for codes and colorings
inferred← citeshttps://doi.org/10.1109/18.749031openalex-snapshot
Efficient code constructions for certain two-dimensional constraints
inferred← citeshttps://doi.org/10.1109/18.995538openalex-snapshot
Parallel constrained coding with application to two-dimensional constraints
inferred← citeshttps://doi.org/10.1109/isit.1991.695199openalex-snapshot
Some New Results On Binary 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.2005.860449openalex-snapshot
Unidirectional covering codes
inferred← citeshttps://doi.org/10.1109/tit.2008.929912openalex-snapshot
Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov–Tenengol'ts 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.2015.2401567openalex-snapshot
New Constructions of Codes for Asymmetric Channels via Concatenation
inferred← citeshttps://doi.org/10.1515/9783110198119.273openalex-snapshot
On single-deletion-correcting codes
inferred← citeshttps://doi.org/10.48550/arxiv.1305.6126openalex-snapshot
Problems on q-Analogs in Coding Theory
inferred← citeshttps://doi.org/10.5269/bspm.84976openalex-snapshot
A Path Decomposition Perspective on the Snake-in-the-Box Problem
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.