On the public citation graph
Constructions and bounds for systematic tEC/AUED codes
0 signed · 51 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/bf01171114openalex-snapshot
Ein Satz �ber Untermengen einer endlichen Menge
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/12.166607openalex-snapshot
New techniques for constructing EC/AUED codes
inferredcites →https://doi.org/10.1109/12.42121openalex-snapshot
On t-error correcting/all unidirectional error detecting 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/tc.1980.1675606openalex-snapshot
A New Class of Error-Correcting/Detecting Codes for Fault-Tolerant Computer Applications
inferredcites →https://doi.org/10.1109/tc.1982.1676034openalex-snapshot
Theory of Unidirectional Error Correcting/Detecting Codes
inferredcites →https://doi.org/10.1109/tc.1982.1676043openalex-snapshot
Optimal Unidirectional Error Detecting/Correcting Codes
inferredcites →https://doi.org/10.1109/tc.1986.1676782openalex-snapshot
Systematic t-Error Correcting/All Unidirectional Error Detecting Codes
inferredcites →https://doi.org/10.1109/tit.1980.1056141openalex-snapshot
Lower bounds for constant weight codes
inferredcites →https://doi.org/10.1109/tit.1980.1056190openalex-snapshot
Some new constant weight codes (Corresp.)
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.1987.1057356openalex-snapshot
An updated table of minimum-distance bounds for binary linear 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/978-1-4613-9323-8_2openalex-snapshot
Detection of Skew in a Sequence of Subsets
inferred← citeshttps://doi.org/10.1007/978-3-0348-7865-4_8openalex-snapshot
Constructions of Nonbinary Codes Correcting t-Symmetric Errors and Detecting All Unidirectional Errors: Magnitude Error Criterion
inferred← citeshttps://doi.org/10.1016/s1005-8885(07)60042-9openalex-snapshot
An upper bound on the size of m-ary t-sEC/AUED codes
inferred← citeshttps://doi.org/10.1049/ip-cdt:19981904openalex-snapshot
Theory and design of SEC-DED-AUED codes
inferred← citeshttps://doi.org/10.1080/03772063.1999.11416123openalex-snapshot
A New Class oft-Error Correcting /d-Error Detecting (d > t) and All Unidirectional Error Detecting Codes
inferred← citeshttps://doi.org/10.1088/0957-4484/17/10/006openalex-snapshot
Defect tolerance in resistor-logic demultiplexers for nanoelectronics
inferred← citeshttps://doi.org/10.1088/0957-4484/20/13/135201openalex-snapshot
Defect-tolerant demultiplexer circuits based on threshold logic and coding
inferred← citeshttps://doi.org/10.1109/12.166607openalex-snapshot
New techniques for constructing EC/AUED codes
inferred← citeshttps://doi.org/10.1109/12.166608openalex-snapshot
Adaptation of the Mactaggart and Jack complex multiplication algorithm for floating-point operators
inferred← citeshttps://doi.org/10.1109/12.166609openalex-snapshot
On-line scheduling of real-time tasks
inferred← citeshttps://doi.org/10.1109/12.247835openalex-snapshot
Constant weight codes for correcting symmetric errors and detecting unidirectional errors
inferred← citeshttps://doi.org/10.1109/12.381951openalex-snapshot
Delay-insensitive pipelined communication on parallel buses
inferred← citeshttps://doi.org/10.1109/12.869327openalex-snapshot
Another method for constructing t-EC/AUED codes
inferred← citeshttps://doi.org/10.1109/18.179364openalex-snapshot
LYM-type inequalities for tEC/AUED codes
inferred← citeshttps://doi.org/10.1109/18.212269openalex-snapshot
Coding for skew-tolerant parallel asynchronous communications
inferred← citeshttps://doi.org/10.1109/18.259652openalex-snapshot
On the construction of systematic tEC/AUED codes
inferred← citeshttps://doi.org/10.1109/18.259671openalex-snapshot
Constructions of skew-tolerant and skew-detecting codes
inferred← citeshttps://doi.org/10.1109/18.79959openalex-snapshot
Multiple undirectional byte error-correcting codes
inferred← citeshttps://doi.org/10.1109/ccece.1997.614796openalex-snapshot
Another method for constructing t-EC/AUED codes
inferred← citeshttps://doi.org/10.1109/ftcs.1992.243582openalex-snapshot
Improved construction methods for error correcting constant weight codes
inferred← citeshttps://doi.org/10.1109/ftcs.1992.243585openalex-snapshot
Unordered error-correcting codes and their applications
inferred← citeshttps://doi.org/10.1109/iccs.1992.255143openalex-snapshot
A construction method for t-EC/AUED codes based on t-EC codes
inferred← citeshttps://doi.org/10.1109/isit.1993.748606openalex-snapshot
A New Construction Method for t-EC/AUED Codes Based on T-EC Codes
inferred← citeshttps://doi.org/10.1109/isit.1993.748607openalex-snapshot
Some New Lower and Upper Bounds on Systematic tEC/aued Codes
inferred← citeshttps://doi.org/10.1109/isit.2004.1365520openalex-snapshot
On two upper bound on the size of t-EC-AUED codes
inferred← citeshttps://doi.org/10.1109/isit.2013.6620237openalex-snapshot
Multiply constant weight codes
inferred← citeshttps://doi.org/10.1109/ispan.1997.645128openalex-snapshot
An efficient class of SEC-DED-AUED codes
inferred← citeshttps://doi.org/10.1109/prfts.1997.640123openalex-snapshot
A new class of t-error correcting/d-error detecting (d
inferred← citeshttps://doi.org/10.1109/tc.2008.130openalex-snapshot
Limit on the Addressability of Fault-Tolerant Nanowire Decoders
inferred← citeshttps://doi.org/10.1109/tit.2009.2030480openalex-snapshot
Some Optimal Binary and Ternary $t$-EC-AUED Codes
inferred← citeshttps://doi.org/10.1109/tit.2014.2359207openalex-snapshot
Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions
inferred← citeshttps://doi.org/10.1109/tit.2018.2800055openalex-snapshot
Optimal $q$ -Ary Error Correcting/All Unidirectional Error Detecting Codes
inferred← citeshttps://doi.org/10.1142/s0218126621502601openalex-snapshot
Integer Codes Correcting Single Errors within Two Bytes
inferred← citeshttps://doi.org/10.48550/arxiv.1906.06066openalex-snapshot
Optimal $q$-Ary Error Correcting/All Unidirectional Error Detecting Codes
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.