On the public citation graph

Bounds and constructions for codes correcting unidirectional errors

0 signed · 37 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/0012-365x(81)90166-7openalex-snapshot
The smallest length of binary 7–dimensional linear codes with prescribed minimum distance
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/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.1972.1054833openalex-snapshot
New binary codes
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.1980.1056141openalex-snapshot
Lower bounds for constant weight codes
inferredcites →https://doi.org/10.1109/tit.1980.1056270openalex-snapshot
On the (23,14,5) Wagner code (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.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.)

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-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/978-3-319-53139-7_5openalex-snapshot
Packing: Combinatorial Models for Various Types of Errors
inferred← citeshttps://doi.org/10.1007/bf01294837openalex-snapshot
Bounds and constructions of asymmetric or unidirectional error-correcting codes
inferred← citeshttps://doi.org/10.1016/0898-1221(91)90025-yopenalex-snapshot
New techniques for constructing t − ECd − EDAUED and t − ECd − EDs − UED codes
inferred← citeshttps://doi.org/10.1049/el:19930977openalex-snapshot
Forward error-correction codes in incoherent optical fibre CDMA networks
inferred← citeshttps://doi.org/10.1049/el:19940355openalex-snapshot
Improvement in bandwidth efficiency ofasynchronous prime-code CDMA networks by errorcorrection coding
inferred← citeshttps://doi.org/10.1049/ip-com:19971454openalex-snapshot
Performance improvement of fibre-optic code-division multiple-access systems by using error-correction codes
inferred← citeshttps://doi.org/10.1080/09720529.2007.10698106openalex-snapshot
Fundamentals of coding type problems
inferred← citeshttps://doi.org/10.1109/12.381959openalex-snapshot
Unidirectional bit/byte error control
inferred← citeshttps://doi.org/10.1109/12.475139openalex-snapshot
Construction of systematic codes for unidirectional error control
inferred← citeshttps://doi.org/10.1109/18.104336openalex-snapshot
New lower bounds for asymmetric and unidirectional codes
inferred← citeshttps://doi.org/10.1109/18.370148openalex-snapshot
The threshold probability of a code
inferred← citeshttps://doi.org/10.1109/18.54883openalex-snapshot
Some new binary codes correcting asymmetric/unidirectional errors
inferred← citeshttps://doi.org/10.1109/18.567719openalex-snapshot
On the generalized Hamming weights of cyclic codes
inferred← citeshttps://doi.org/10.1109/2.56853openalex-snapshot
Error-control coding in computers
inferred← citeshttps://doi.org/10.1109/30.713219openalex-snapshot
New fiber-optic ATM switching networks using optical code-division multiple access for broadband communication applications
inferred← citeshttps://doi.org/10.1109/isit.1994.395118openalex-snapshot
A construction method for unidirectional error control codes
inferred← citeshttps://doi.org/10.1109/issse.1998.738098openalex-snapshot
Use of error-correction codes to improve the performance of optical fiber code division multiple-access systems
inferred← citeshttps://doi.org/10.1109/tit.2005.860449openalex-snapshot
Unidirectional covering codes
inferred← citeshttps://doi.org/10.1515/9783110198119.273openalex-snapshot
On single-deletion-correcting codes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607132openalex-snapshot
On q-ary codes correcting all unidirectional errors of a limited magnitude
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.