On the public citation graph

Optimal Error Correction for Computationally Bounded Noise

https://doi.org/10.1109/tit.2010.2070370
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.
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.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1950.tb00463.xopenalex-snapshot
Error Detecting and Error Correcting Codes
inferredcites →https://doi.org/10.1006/jcom.1997.0439openalex-snapshot
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
inferredcites →https://doi.org/10.1007/3-540-57785-8_183openalex-snapshot
A new approach to information theory
inferredcites →https://doi.org/10.1007/978-3-540-30576-7_1openalex-snapshot
Optimal Error Correction Against Computationally Bounded Noise
inferredcites →https://doi.org/10.1109/18.782097openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometry codes
inferredcites →https://doi.org/10.1109/18.995539openalex-snapshot
Combinatorial bounds for list decoding
inferredcites →https://doi.org/10.1109/ccc.2003.1214429openalex-snapshot
List decoding with side information
inferredcites →https://doi.org/10.1109/focs.2004.51openalex-snapshot
Private Codes or Succinct Random Codes That Are (Almost) Perfect
inferredcites →https://doi.org/10.1109/sfcs.2005.29openalex-snapshot
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
inferredcites →https://doi.org/10.1109/tit.1960.1057584openalex-snapshot
Binary codes with specified minimum distance
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.2007.911222openalex-snapshot
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
inferredcites →https://doi.org/10.1137/0108018openalex-snapshot
Polynomial Codes Over Certain Finite Fields
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1145/100216.100269openalex-snapshot
One-way functions are necessary and sufficient for secure signatures
inferredcites →https://doi.org/10.1145/147508.147537openalex-snapshot
How to sign given any trapdoor permutation
inferredcites →https://doi.org/10.1145/335305.335327openalex-snapshot
List decoding algorithms for certain concatenated codes
inferredcites →https://doi.org/10.1145/73007.73011openalex-snapshot
Universal one-way hash functions and their cryptographic applications

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.2317524openalex-extracted
Resilient Mechanism Design Foundations for Governance of Cyberspace: Exploration in Theory, Strategy, and Policy
inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_19openalex-snapshot
Transparent Error Correcting in a Computationally Bounded World
inferred← citeshttps://doi.org/10.1007/978-3-031-15982-4_9openalex-snapshot
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-91107-1_7openalex-snapshot
Binary Codes for Error Detection and Correction in a Computationally Bounded World
inferred← citeshttps://doi.org/10.1007/978-3-032-35367-2_9openalex-snapshot
Achieving Shannon Capacity for Computationally Bounded Errors
inferred← citeshttps://doi.org/10.1007/978-3-319-49175-2_9openalex-snapshot
Error-Correcting Codes Against Chosen-Codeword Attacks
inferred← citeshttps://doi.org/10.1007/s00037-020-00203-wopenalex-snapshot
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels
inferred← citeshttps://doi.org/10.1093/comjnl/bxy100openalex-snapshot
Error Correction by Structural Simplicity: Correcting Samplable Additive Errors
inferred← citeshttps://doi.org/10.1109/focs.2013.55openalex-snapshot
Knowledge-Preserving Interactive Coding
inferred← citeshttps://doi.org/10.1109/focs.2019.00028openalex-snapshot
Quasilinear Time List-Decodable Codes for Space Bounded Channels
inferred← citeshttps://doi.org/10.1109/isit.2014.6874996openalex-snapshot
Correction of samplable additive errors
inferred← citeshttps://doi.org/10.1109/tdsc.2026.3663433openalex-snapshot
Customizable Information Dispersal-Based Byzantine Broadcast With Communication Optimization Using Bloom Filters
inferred← citeshttps://doi.org/10.1109/tsp.2022.3158759openalex-snapshot
Radix-Partition-Based Over-the-Air Aggregation and Low-Complexity State Estimation for IoT Systems Over Wireless Fading Channels
inferred← citeshttps://doi.org/10.1145/2810103.2813728openalex-snapshot
Falcon Codes
inferred← citeshttps://doi.org/10.1145/3406325.3451048openalex-snapshot
Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity
inferred← citeshttps://doi.org/10.1145/3618260.3649735openalex-snapshot
Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions
inferred← citeshttps://doi.org/10.30630/joiv.2.2.113openalex-snapshot
Lookup Table Algorithm for Error Correction in Color Images
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.