On the public citation graph
On unordered codes
0 signed · 112 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/0898-1221(88)90006-5openalex-snapshot
A t-unidirectional error-detecting systematic code
inferredcites →https://doi.org/10.1016/s0019-9958(61)80037-5openalex-snapshot
A note on error detection codes for asymmetric channels
inferredcites →https://doi.org/10.1016/s0019-9958(62)90223-1openalex-snapshot
Optimal error detection codes for completely asymmetric binary channels
inferredcites →https://doi.org/10.1016/s0019-9958(82)91125-1openalex-snapshot
Optimal asymmetric error detecting codes
inferredcites →https://doi.org/10.1109/mc.1980.1653527openalex-snapshot
Error-Correcting Codes and Self-Checking Circuits
inferredcites →https://doi.org/10.1109/t-c.1971.223127openalex-snapshot
Realization of Fail-Safe Sequential Machines by Using a k-out-of-n Code
inferredcites →https://doi.org/10.1109/tc.1982.1676043openalex-snapshot
Optimal Unidirectional Error Detecting/Correcting Codes
inferredcites →https://doi.org/10.1109/tc.1984.1676498openalex-snapshot
Data Integrty in Digital Optical Disks
inferredcites →https://doi.org/10.1109/tc.1985.1676535openalex-snapshot
Systematic Unidirectional Error-Detecting Codes
inferredcites →https://doi.org/10.1109/tcom.1976.1093314openalex-snapshot
Optical Pulse Formats for Fiber Optic Digital Communications
inferredcites →https://doi.org/10.1147/rd.275.0440openalex-snapshot
A DC-Balanced, Partitioned-Block, 8B/10B Transmission Code
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ecjc.4430730902openalex-snapshot
A method to construct constant weight t‐error correcting codes
inferred← citeshttps://doi.org/10.1007/3-540-54195-0_39openalex-snapshot
Constructions of codes correcting burst asymmetric errors
inferred← citeshttps://doi.org/10.1007/3-540-54303-1_122openalex-snapshot
Unidirectional error detecting codes
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_40openalex-snapshot
On the Maximality of the Group Theoretic Single Error Correcting and All Unidirectional Error Detecting (SEC-AUED) Codes
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.1007/bf00135442openalex-snapshot
A methodology for the design of SFS/SCD circuits for a class of unordered codes
inferred← citeshttps://doi.org/10.1007/s10836-005-0973-yopenalex-snapshot
Single- and Double-Output Embedded Checker Architectures for Systematic Unordered Codes∗
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90106-7openalex-snapshot
Efficient q-ary immutable codes
inferred← citeshttps://doi.org/10.1016/j.aeue.2012.05.010openalex-snapshot
Generation of spectral nulls with permutation sequences
inferred← citeshttps://doi.org/10.1016/j.micpro.2014.04.002openalex-snapshot
Protecting QDI interconnects from transient faults using delay-insensitive redundant check codes
inferred← citeshttps://doi.org/10.1016/j.vlsi.2015.08.001openalex-snapshot
Comments on “Dual-rail asynchronous logic multi-level implementation”
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00129-2openalex-snapshot
Efficient m-ary balanced codes
inferred← citeshttps://doi.org/10.1023/a:1008369203223openalex-snapshot
Intermediacy Prediction for High Speed Berger Code Checkers
inferred← citeshttps://doi.org/10.1080/00207729308949596openalex-snapshot
All unidirectional error-detecting code for universal applications
inferred← citeshttps://doi.org/10.1080/09720529.2005.10698052openalex-snapshot
Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms
inferred← citeshttps://doi.org/10.1080/09720529.2005.10698053openalex-snapshot
On efficient high-order spectral-null codes over them-ary alphabet
inferred← citeshttps://doi.org/10.1109/12.223673openalex-snapshot
Some codes for correcting and detecting unidirectional byte errors
inferred← citeshttps://doi.org/10.1109/12.257712openalex-snapshot
Design of efficient error-correcting balanced codes
inferred← citeshttps://doi.org/10.1109/12.278488openalex-snapshot
A totally self-checking checker for a parallel unordered coding scheme
inferred← citeshttps://doi.org/10.1109/12.53596openalex-snapshot
On symmetric error correcting and all unidirectional error detecting codes
inferred← citeshttps://doi.org/10.1109/12.677239openalex-snapshot
Design of balanced and constant weight codes for VLSI systems
inferred← citeshttps://doi.org/10.1109/12.709380openalex-snapshot
Asynchronous comparison-based decoders for delay-insensitive codes
inferred← citeshttps://doi.org/10.1109/12.795122openalex-snapshot
Balanced codes with parallel encoding and decoding
inferred← citeshttps://doi.org/10.1109/18.335907openalex-snapshot
Coding for delay-insensitive communication with partial synchronization
inferred← citeshttps://doi.org/10.1109/18.45290openalex-snapshot
An efficient algorithm for testing immutability of variable-length codes
inferred← citeshttps://doi.org/10.1109/18.490545openalex-snapshot
Design of some new efficient balanced codes
inferred← citeshttps://doi.org/10.1109/18.641551openalex-snapshot
Systematic proximity-detecting codes
inferred← citeshttps://doi.org/10.1109/18.796412openalex-snapshot
On efficient high-order spectral-null codes
inferred← citeshttps://doi.org/10.1109/26.58748openalex-snapshot
A coding scheme for m-out-of-n codes
inferred← citeshttps://doi.org/10.1109/43.644039openalex-snapshot
On-line detection of bridging and delay faults in functional blocks of CMOS self-checking circuits
inferred← citeshttps://doi.org/10.1109/access.2019.2934847openalex-snapshot
On Redundancy Reduction of Non-Recursive Second-Order Spectral-Null Codes
inferred← citeshttps://doi.org/10.1109/ats.1993.398820openalex-snapshot
State encoding and functional decomposition for self-checking sequential circuit design
inferred← citeshttps://doi.org/10.1109/date.2010.5456948openalex-snapshot
An error-correcting unordered code and hardware support for robust asynchronous global communication
inferred← citeshttps://doi.org/10.1109/date.2011.5763221openalex-snapshot
A delay-insensitive bus-invert code and hardware support for robust asynchronous global communication
inferred← citeshttps://doi.org/10.1109/ddecs.2009.5012099openalex-snapshot
Self-timed full adder designs based on hybrid input encoding
inferred← citeshttps://doi.org/10.1109/dft66274.2025.11257573openalex-snapshot
Improved Encoding and Decoding of Optimal $m$-Out-of-$n$ Codes
inferred← citeshttps://doi.org/10.1109/dftvs.1993.595822openalex-snapshot
Design rules for CMOS self checking circuits with parametric faults in the functional block
inferred← citeshttps://doi.org/10.1109/dftvs.1994.630023openalex-snapshot
CMOS self checking circuits with faulty sequential functional blocks
inferred← citeshttps://doi.org/10.1109/dftvs.2002.1173517openalex-snapshot
On-line testing of transient faults affecting functional blocks of FCMOS, domino and FPGA-implemented self-checking circuits
inferred← citeshttps://doi.org/10.1109/eecs.2018.00107openalex-snapshot
Indicating Asynchronous Multipliers
inferred← citeshttps://doi.org/10.1109/ftcs.1989.105571openalex-snapshot
Design of efficient balanced codes
inferred← citeshttps://doi.org/10.1109/ftcs.1994.315639openalex-snapshot
Balanced codes for noise reduction in VLSI systems
inferred← citeshttps://doi.org/10.1109/ftcs.1996.534608openalex-snapshot
Limitations of VLSI implementation of delay-insensitive codes
inferred← citeshttps://doi.org/10.1109/ftcs.1997.614095openalex-snapshot
On the design of constant weight codes for VLSI systems
inferred← citeshttps://doi.org/10.1109/ftcs.1999.781050openalex-snapshot
Some transmission time analysis for the parallel asynchronous communication scheme
inferred← citeshttps://doi.org/10.1109/iccd.1991.139976openalex-snapshot
New classes of unidirectional error-detecting codes
inferred← citeshttps://doi.org/10.1109/icvd.1997.568154openalex-snapshot
Design of t-UED/AUED codes from Berger's AUED code
inferred← citeshttps://doi.org/10.1109/iolts.2004.43openalex-snapshot
Single-output embedded checkers for systematic unordered codes
inferred← citeshttps://doi.org/10.1109/iolts.2006.22openalex-snapshot
Designing Robust Checkers in the Presence of Massive Timing Errors
inferred← citeshttps://doi.org/10.1109/iolts.2013.6604068openalex-snapshot
Parity check for m-of-n delay insensitive codes
inferred← citeshttps://doi.org/10.1109/isca52012.2021.00057openalex-snapshot
Superconducting Computing with Alternating Logic Elements
inferred← citeshttps://doi.org/10.1109/isit.1991.695197openalex-snapshot
Single Unidirectional Byte Error Correcting And Double Unidirectional Byte Error Detecting Codes
inferred← citeshttps://doi.org/10.1109/isit.1993.748322openalex-snapshot
Design of some new Balanced Codes
inferred← citeshttps://doi.org/10.1109/isit.1994.394884openalex-snapshot
Balanced codes with parallel encoding/decoding
inferred← citeshttps://doi.org/10.1109/isit.1995.531348openalex-snapshot
On efficient high-order spectral-null codes
inferred← citeshttps://doi.org/10.1109/isit.1997.613132openalex-snapshot
On efficient m-ary balanced codes
inferred← citeshttps://doi.org/10.1109/isit.2003.1228147openalex-snapshot
On balanced codes over the m-th roots of unity, m=4
inferred← citeshttps://doi.org/10.1109/ismvl.1994.302179openalex-snapshot
On multiple-valued separable unordered codes
inferred← citeshttps://doi.org/10.1109/itcc.2001.918851openalex-snapshot
t-error correcting/d-error detecting (d
inferred← citeshttps://doi.org/10.1109/itcc.2002.1000420openalex-snapshot
t-error correcting/d-error detecting (d
inferred← citeshttps://doi.org/10.1109/itcom.1999.781438openalex-snapshot
On parallel asynchronous communication codes
inferred← citeshttps://doi.org/10.1109/itw.2011.6089368openalex-snapshot
Spectral shaping codes with even length permutation sequences
inferred← citeshttps://doi.org/10.1109/olt.2004.1319658openalex-snapshot
Single-output embedded checkers for systematic unordered codes
inferred← citeshttps://doi.org/10.1109/prdc.2000.897291openalex-snapshot
Some improved encoding and decoding schemes for balanced codes
inferred← citeshttps://doi.org/10.1109/sbcci.2013.6644865openalex-snapshot
H2A: A hardened asynchronous network on chip
inferred← citeshttps://doi.org/10.1109/tc.2003.1197123openalex-snapshot
Transmission time analysis for the parallel asynchronous communication scheme
inferred← citeshttps://doi.org/10.1109/tc.2003.1228518openalex-snapshot
Efficient encoding and decoding schemes for balanced codes
inferred← citeshttps://doi.org/10.1109/tcad.2011.2165070openalex-snapshot
Error-Correcting Unordered Codes and Hardware Support for Robust Asynchronous Global Communication
inferred← citeshttps://doi.org/10.1109/tit.2006.872981openalex-snapshot
On efficient balanced codes over the mth roots of unity
inferred← citeshttps://doi.org/10.1109/tit.2011.2173633openalex-snapshot
Variable Length Unordered Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2555322openalex-snapshot
Efficient Non-Recursive Design of Second-Order Spectral-Null Codes
inferred← citeshttps://doi.org/10.1109/tit.2017.2766668openalex-snapshot
A Construction for Balancing Non-Binary Sequences Based on Gray Code Prefixes
inferred← citeshttps://doi.org/10.1109/vtest.1992.232743openalex-snapshot
A totally self-checking checker for a parallel unordered coding scheme
inferred← citeshttps://doi.org/10.1142/s021812661350028xopenalex-snapshot
SELF-TIMED SECTION-CARRY BASED CARRY LOOKAHEAD ADDERS AND THE CONCEPT OF ALIAS LOGIC
inferred← citeshttps://doi.org/10.1155/2000/42016openalex-snapshot
Signal Coding and CMOS Gates for Combinational Functional Blocks of Very Deep Submicron Self‐checking Circuits
inferred← citeshttps://doi.org/10.1155/2012/575389openalex-snapshot
Redundant Logic Insertion and Latency Reduction in Self‐Timed Adders
inferred← citeshttps://doi.org/10.1186/s40064-016-2074-zopenalex-snapshot
Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders
inferred← citeshttps://doi.org/10.1371/journal.pone.0218347openalex-snapshot
Speed and energy optimized quasi-delay-insensitive block carry lookahead adder
inferred← citeshttps://doi.org/10.1371/journal.pone.0228343openalex-snapshot
Speed, energy and area optimized early output quasi-delay-insensitive array multipliers
inferred← citeshttps://doi.org/10.2298/fuee1504657bopenalex-snapshot
A latency optimized biased implementation style weak-indication self-timed full adder
inferred← citeshttps://doi.org/10.2298/fuee2502239bopenalex-snapshot
Asynchronous monotonic multiplexer
inferred← citeshttps://doi.org/10.3390/app9245400openalex-snapshot
Quasi Delay Insensitive Majority Voters for Triple Modular Redundancy Applications
inferred← citeshttps://doi.org/10.3390/electronics13091717openalex-snapshot
Monotonic Asynchronous Two-Bit Full Adder
inferred← citeshttps://doi.org/10.3390/electronics7100243openalex-snapshot
Low Power Robust Early Output Asynchronous Block Carry Lookahead Adder with Redundant Carry Logic
inferred← citeshttps://doi.org/10.3390/electronics8040444openalex-snapshot
Early Output Quasi-Delay-Insensitive Array Multipliers
inferred← citeshttps://doi.org/10.3390/jlpea14010001openalex-snapshot
Speed, Power and Area Optimized Monotonic Asynchronous Array Multipliers
inferred← citeshttps://doi.org/10.3390/technologies11050126openalex-snapshot
A Monotonic Early Output Asynchronous Full Adder
inferred← citeshttps://doi.org/10.48550/arxiv.1711.02333openalex-snapshot
Critique of "Asynchronous Logic Implementation Based on Factorized DIMS"
inferred← citeshttps://doi.org/10.48550/arxiv.1807.09762openalex-snapshot
Asynchronous Ripple Carry Adder based on Area Optimized Early Output Dual-Bit Full Adder
inferred← citeshttps://doi.org/10.48550/arxiv.1903.09433openalex-snapshot
Speed and Energy Optimised Quasi-Delay-Insensitive Block Carry Lookahead Adder
inferred← citeshttps://doi.org/10.48550/arxiv.1905.05904openalex-snapshot
Indicating Asynchronous Array Multipliers
inferred← citeshttps://doi.org/10.48550/arxiv.1907.10826openalex-snapshot
Performance Comparison of Quasi-Delay-Insensitive Asynchronous Adders
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3647openalex-snapshot
Robust checkers for self-calibrating designs
inferred← citeshttps://doi.org/10.5555/1870926.1871110openalex-snapshot
An error-correcting unordered code and hardware support for robust asynchronous global communication
inferred← citeshttps://doi.org/10.9790/2834-0757885openalex-snapshot
Implementation of error correcting methods to the asynchronous Delay Insensitive codes with reduced delay and area
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.