On the public citation graph
List Decoding of Error-Correcting Codes
0 signed · 315 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.1002/0471739219.ch11openalex-snapshot
Soft‐Decision Decoding Algorithms
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/mana.19821090103openalex-snapshot
Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound
inferredcites →https://doi.org/10.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
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.1006/jcss.2000.1730openalex-snapshot
Pseudorandom Generators without the XOR Lemma
inferredcites →https://doi.org/10.1006/jcta.1999.3053openalex-snapshot
Lower Bound for the Linear Multiple Packing of the Binary Hamming Space
inferredcites →https://doi.org/10.1006/jnth.1996.0147openalex-snapshot
On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields
inferredcites →https://doi.org/10.1007/3-540-44436-x_13openalex-snapshot
On the Hardness of Approximating NP Witnesses
inferredcites →https://doi.org/10.1007/3-540-45294-x_17openalex-snapshot
List Decoding from Erasures: Bounds and Code Constructions
inferredcites →https://doi.org/10.1007/3-540-46796-3_26openalex-snapshot
Decoding Hermitian Codes with Sudan’s Algorithm
inferredcites →https://doi.org/10.1007/3-540-48405-1_22openalex-snapshot
An Efficient Public Key Traitor Tracing Scheme
inferredcites →https://doi.org/10.1007/978-1-4613-8994-1_12openalex-snapshot
Algebraic Geometric Codes
inferredcites →https://doi.org/10.1007/978-1-4615-6193-4openalex-snapshot
Asymptotic Combinatorial Coding Theory
inferredcites →https://doi.org/10.1007/978-1-4757-1779-2openalex-snapshot
A Classical Introduction to Modern Number Theory
inferredcites →https://doi.org/10.1007/978-1-4757-1885-0_2openalex-snapshot
Informal Description of the Algorithm
inferredcites →https://doi.org/10.1007/978-1-4757-6048-4_20openalex-snapshot
A New Upper Bound on Codes Decodable into Size-2 Lists
inferredcites →https://doi.org/10.1007/978-3-540-30180-6_4openalex-snapshot
4 Limits to List Decodability
inferredcites →https://doi.org/10.1007/978-3-540-30180-6_7openalex-snapshot
7 A Unified Framework for List Decoding of Algebraic Codes
inferredcites →https://doi.org/10.1007/978-3-540-30180-6_9openalex-snapshot
9 New, Expander-Based List Decodable Codes
inferredcites →https://doi.org/10.1007/978-3-540-76878-4openalex-snapshot
Algebraic Function Fields and Codes
inferredcites →https://doi.org/10.1007/978-3-642-57189-3_16openalex-snapshot
Codes on Drinfeld Modular Curves
inferredcites →https://doi.org/10.1007/978-3-642-57189-3_20openalex-snapshot
Decoding Reed-Solomon Codes Beyond Half the Minimum Distance
inferredcites →https://doi.org/10.1007/978-3-662-02945-9openalex-snapshot
A Course in Computational Algebraic Number Theory
inferredcites →https://doi.org/10.1007/978-3-662-12521-2openalex-snapshot
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
inferredcites →https://doi.org/10.1007/bf01083182openalex-snapshot
Number of points of an algebraic curve
inferredcites →https://doi.org/10.1007/bf01262928openalex-snapshot
On the hardness of computing the permanent of random matrices
inferredcites →https://doi.org/10.1007/bf01275486openalex-snapshot
BPP has subexponential time simulations unlessEXPTIME has publishable proofs
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf01884295openalex-snapshot
A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
inferredcites →https://doi.org/10.1007/bf02090391openalex-snapshot
On polynomial-time truth-table reducibility of intractable sets to P-selective sets
inferredcites →https://doi.org/10.1007/bfb0023837openalex-snapshot
Polynomial factorization 1987–1991
inferredcites →https://doi.org/10.1007/bfb0055730openalex-snapshot
Cryptanalysis of block ciphers with probabilistic non-linear relations of low degree
inferredcites →https://doi.org/10.1007/s00493-003-0025-0openalex-snapshot
Improved Low-Degree Testing and its Applications
inferredcites →https://doi.org/10.1016/0020-0190(92)90195-2openalex-snapshot
Highly resilient correctors for polynomials
inferredcites →https://doi.org/10.1016/0022-0000(85)90016-9openalex-snapshot
Factoring multivariate polynomials over finite fields
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50017-5openalex-snapshot
Algorithms in Number Theory
inferredcites →https://doi.org/10.1016/s0019-9958(60)90287-4openalex-snapshot
On a class of error correcting binary group codes
inferredcites →https://doi.org/10.1016/s0019-9958(67)91200-4openalex-snapshot
Lower bounds to error probability for coding on discrete memoryless channels. II
inferredcites →https://doi.org/10.1016/s0019-9958(75)90090-xopenalex-snapshot
A method for solving key equation for decoding goppa codes
inferredcites →https://doi.org/10.1016/s0022-0000(02)00022-3openalex-snapshot
On the complexity of approximating the VC dimension
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/s0021900200096017openalex-snapshot
Channel capacities for list codes
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1109/18.108255openalex-snapshot
Fast decoding of codes from algebraic plane curves
inferredcites →https://doi.org/10.1109/18.119713openalex-snapshot
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
inferredcites →https://doi.org/10.1109/18.179340openalex-snapshot
Decoding algebraic-geometric codes up to the designed minimum distance
inferredcites →https://doi.org/10.1109/18.179365openalex-snapshot
A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
inferredcites →https://doi.org/10.1109/18.21233openalex-snapshot
Zero error capacity under list decoding
inferredcites →https://doi.org/10.1109/18.312186openalex-snapshot
Improved lower bounds on the sizes of error-correcting codes for list decoding
inferredcites →https://doi.org/10.1109/18.32157openalex-snapshot
Construction and decoding of a class of algebraic geometry codes
inferredcites →https://doi.org/10.1109/18.370114openalex-snapshot
Spherical codes generated by binary partitions of symmetric pointsets
inferredcites →https://doi.org/10.1109/18.45279openalex-snapshot
On a decoding algorithm for codes on maximal curves
inferredcites →https://doi.org/10.1109/18.476212openalex-snapshot
Algebraic function fields over finite fields with many rational places
inferredcites →https://doi.org/10.1109/18.490539openalex-snapshot
Bounded distance+1 soft-decision Reed-Solomon decoding
inferredcites →https://doi.org/10.1109/18.556668openalex-snapshot
Linear-time encodable and decodable error-correcting codes
inferredcites →https://doi.org/10.1109/18.57204openalex-snapshot
On the decoding of algebraic-geometric codes
inferredcites →https://doi.org/10.1109/18.61123openalex-snapshot
Error-correcting codes for list decoding
inferredcites →https://doi.org/10.1109/18.748993openalex-snapshot
List decoding of algebraic-geometric codes
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.817522openalex-snapshot
Efficient decoding of Reed-Solomon codes beyond half the minimum distance
inferredcites →https://doi.org/10.1109/18.887851openalex-snapshot
Upper bounds for constant-weight codes
inferredcites →https://doi.org/10.1109/18.887868openalex-snapshot
A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
inferredcites →https://doi.org/10.1109/18.923744openalex-snapshot
Bounds on list decoding of MDS codes
inferredcites →https://doi.org/10.1109/18.923745openalex-snapshot
On representations of algebraic-geometry codes
inferredcites →https://doi.org/10.1109/18.945244openalex-snapshot
A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
inferredcites →https://doi.org/10.1109/18.995539openalex-snapshot
Combinatorial bounds for list decoding
inferredcites →https://doi.org/10.1109/9780470546345openalex-snapshot
Reed-Solomon Codes and Their Applications
inferredcites →https://doi.org/10.1109/ccc.1999.766260openalex-snapshot
Computing from partial solutions
inferredcites →https://doi.org/10.1109/ccc.1999.766261openalex-snapshot
Proofs, codes, and polynomial-time reducibilities
inferredcites →https://doi.org/10.1109/isit.2001.935948openalex-snapshot
Upper bounds on the list-decoding radius of Reed-Solomon codes
inferredcites →https://doi.org/10.1109/sfcs.1995.492485openalex-snapshot
Learning Polynomials with Queries: The Highly Noisy Case
inferredcites →https://doi.org/10.1109/sfcs.1995.492573openalex-snapshot
Free bits, PCPs and non-approximability-towards tight results
inferredcites →https://doi.org/10.1109/sfcs.1995.492584openalex-snapshot
Hard-core distributions for somewhat hard problems
inferredcites →https://doi.org/10.1109/sfcs.2000.892076openalex-snapshot
"Soft-decision" decoding of Chinese remainder codes
inferredcites →https://doi.org/10.1109/sfcs.2001.959941openalex-snapshot
Simple extractors for all min-entropies and a new pseudo-random generator
inferredcites →https://doi.org/10.1109/sfcs.2001.959942openalex-snapshot
Expander-based constructions of efficiently decodable codes
inferredcites →https://doi.org/10.1109/sffcs.1999.814612openalex-snapshot
A probabilistic algorithm for k-SAT and constraint satisfaction problems
inferredcites →https://doi.org/10.1109/tit.1956.1056798openalex-snapshot
The zero error capacity of a noisy channel
inferredcites →https://doi.org/10.1109/tit.1962.1057714openalex-snapshot
A new upper bound for error-correcting codes
inferredcites →https://doi.org/10.1109/tit.1963.1057841openalex-snapshot
Improved asymptotic bounds for error-correcting codes
inferredcites →https://doi.org/10.1109/tit.1966.1053873openalex-snapshot
Generalized minimum distance decoding
inferredcites →https://doi.org/10.1109/tit.1968.1054129openalex-snapshot
Exponential error bounds for erasure, list, and decision feedback schemes
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
inferredcites →https://doi.org/10.1109/tit.1972.1054893openalex-snapshot
Class of constructive asymptotically good algebraic codes
inferredcites →https://doi.org/10.1109/tit.1973.1055068openalex-snapshot
Justesen's construction--The low-rate case (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1976.1055504openalex-snapshot
On a class of arithmetic codes and a decoding algorithm (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1976.1055516openalex-snapshot
On the complexity of decoding Reed-Solomon codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1977.1055688openalex-snapshot
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
inferredcites →https://doi.org/10.1109/tit.1983.1056651openalex-snapshot
A modular approach to key safeguarding
inferredcites →https://doi.org/10.1109/tit.1984.1056879openalex-snapshot
Modular curves and codes with a polynomial construction
inferredcites →https://doi.org/10.1109/tit.2002.1003853openalex-snapshot
Error exponents of expander codes
inferredcites →https://doi.org/10.1137/0108018openalex-snapshot
Polynomial Codes Over Certain Finite Fields
inferredcites →https://doi.org/10.1137/0214035openalex-snapshot
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
inferredcites →https://doi.org/10.1137/s0097539796297577openalex-snapshot
Reconstructing Algebraic Functions from Mixed Data
inferredcites →https://doi.org/10.1145/258533.258590openalex-snapshot
P = BPP if E requires exponential circuits
inferredcites →https://doi.org/10.1145/301250.301311openalex-snapshot
A displacement approach to efficient decoding of algebraic-geometric codes
inferredcites →https://doi.org/10.1145/335305.335327openalex-snapshot
List decoding algorithms for certain concatenated codes
inferredcites →https://doi.org/10.1145/335305.335337openalex-snapshot
Finding smooth integers in short intervals using CRT decoding
inferredcites →https://doi.org/10.1145/380752.380802openalex-snapshot
Excellent codes from modular curves
inferredcites →https://doi.org/10.1145/502090.502099openalex-snapshot
Extractors and pseudorandom generators
inferredcites →https://doi.org/10.1145/509907.510022openalex-snapshot
Limits to list decodability of linear codes
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/954092.954099openalex-snapshot
Review of Modern cryptography, probabilistic proofs and pseudorandomness algorithms and combinatorics, vol 17 by Oded Goldreich. Springer Verlag, 1999.
inferredcites →https://doi.org/10.1145/972639.972642openalex-snapshot
The security of all RSA and discrete log bits
inferredcites →https://doi.org/10.1147/rd.312.0249openalex-snapshot
Efficient randomized pattern-matching algorithms
inferredcites →https://doi.org/10.1214/aoms/1177729387openalex-snapshot
Orthogonal Arrays of Index Unity
inferredcites →https://doi.org/10.1214/aop/1176996762openalex-snapshot
On a Set of Almost Deterministic $k$-Independent Random Variables
inferredcites →https://doi.org/10.5555/644108.644232openalex-snapshot
Unconditional proof of tightness of Johnson bound
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11496137_15openalex-snapshot
Indexing Information for Data Forensics
inferred← citeshttps://doi.org/10.1007/11604938_9openalex-snapshot
Efficient Multicast Stream Authentication for the Fully Adversarial Network Model
inferred← citeshttps://doi.org/10.1007/11847250_20openalex-snapshot
On the Effective Enumerability of NP Problems
inferred← citeshttps://doi.org/10.1007/11935070_7openalex-snapshot
Achieving Multicast Stream Authentication Using MDS Codes
inferred← citeshttps://doi.org/10.1007/11937807_9openalex-snapshot
Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_17openalex-snapshot
List Decoding from Erasures: Bounds and Code Constructions
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_101openalex-snapshot
Decoding Reed–Solomon Codes
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_613openalex-snapshot
Efficient Decodable Group Testing
inferred← citeshttps://doi.org/10.1007/978-3-031-48621-0_4openalex-snapshot
Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance
inferred← citeshttps://doi.org/10.1007/978-3-540-30556-9_32openalex-snapshot
Identification Algorithms for Sequential Traitor Tracing
inferred← citeshttps://doi.org/10.1007/978-3-540-44993-5_6openalex-snapshot
Traitor Tracing for Shortened and Corrupted Fingerprints
inferred← citeshttps://doi.org/10.1007/978-3-540-73458-1_22openalex-snapshot
Combining Prediction Hashing and MDS Codes for Efficient Multicast Stream Authentication
inferred← citeshttps://doi.org/10.1007/978-3-540-75670-5_2openalex-snapshot
An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels
inferred← citeshttps://doi.org/10.1007/978-3-540-77224-8_6openalex-snapshot
Efficient List Decoding of Explicit Codes with Optimal Redundancy
inferred← citeshttps://doi.org/10.1007/978-3-540-85093-9_12openalex-snapshot
List Error-Correction with Optimal Information Rate (Invited Talk)
inferred← citeshttps://doi.org/10.1007/978-3-642-01877-0_10openalex-snapshot
List Decoding of Binary Codes–A Brief Survey of Some Recent Results
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_4openalex-snapshot
Limits to List Decoding Random Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_52openalex-snapshot
Two Theorems on List Decoding
inferred← citeshttps://doi.org/10.1007/978-3-642-20901-7_4openalex-snapshot
List Decoding for Binary Goppa Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-25405-5_13openalex-snapshot
Simplified High-Speed High-Distance List Decoding for Alternant Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_613-1openalex-snapshot
Efficient Decodable Group Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-36818-9_35openalex-snapshot
A Variant of Non-Adaptive Group Testing and Its Application in Pay-Television via Internet
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_57openalex-snapshot
Linear-Time List Recovery of High-Rate Expander Codes
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_9openalex-snapshot
Parallel Hashing via List Recoverability
inferred← citeshttps://doi.org/10.1007/s00037-015-0117-4openalex-snapshot
Query Complexity in Errorless Hardness Amplification
inferred← citeshttps://doi.org/10.1007/s00145-010-9061-2openalex-snapshot
Parallel and Concurrent Security of the HB and HB+ Protocols
inferred← citeshttps://doi.org/10.1007/s00224-016-9695-zopenalex-snapshot
Some Properties of Antistochastic Strings
inferred← citeshttps://doi.org/10.1007/s10207-007-0048-4openalex-snapshot
A coding approach to the multicast stream authentication problem
inferred← citeshttps://doi.org/10.1007/s10623-005-6402-5openalex-snapshot
New Constructions for IPP Codes
inferred← citeshttps://doi.org/10.1007/s10623-010-9445-1openalex-snapshot
List decodability at small radii
inferred← citeshttps://doi.org/10.1007/s10623-013-9803-xopenalex-snapshot
List decoding of number field codes
inferred← citeshttps://doi.org/10.1016/j.artint.2015.10.003openalex-snapshot
Voting rules as error-correcting codes
inferred← citeshttps://doi.org/10.1016/j.dam.2007.07.012openalex-snapshot
Multiple packing in sum-type metric spaces
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.014openalex-snapshot
Improvements on the Johnson bound for Reed–Solomon codes
inferred← citeshttps://doi.org/10.1016/j.dam.2012.07.022openalex-snapshot
Noise-resilient group testing: Limitations and constructions
inferred← citeshttps://doi.org/10.1016/j.ins.2019.05.064openalex-snapshot
Symmetric keyring encryption scheme for biometric cryptosystem
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.01.002openalex-snapshot
List decoding of Reed–Solomon codes from a Gröbner basis perspective
inferred← citeshttps://doi.org/10.1017/9780511982170openalex-snapshot
Codes, Cryptology and Curves with Computer Algebra
inferred← citeshttps://doi.org/10.1017/s0004972709000665openalex-snapshot
SECURE AND PRIVATE FINGERPRINT-BASED AUTHENTICATION
inferred← citeshttps://doi.org/10.1049/iet-com:20060057openalex-snapshot
Performance of Reed–Solomon codes using the Guruswami–Sudan algorithm with improved interpolation efficiency
inferred← citeshttps://doi.org/10.1093/ietfec/e89-a.1.227openalex-snapshot
Obtaining Traceability Codes from Chinese Reminder Theorem Codes
inferred← citeshttps://doi.org/10.1109/18.995539openalex-snapshot
Combinatorial bounds for list decoding
inferred← citeshttps://doi.org/10.1109/aiccsa.2017.132openalex-snapshot
Maximizing the Parallelism Degree for Optimal Computing of Matrix Chain Products
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483380openalex-snapshot
Lists that are smaller than their parts: A coding approach to tunable secrecy
inferred← citeshttps://doi.org/10.1109/allerton58177.2023.10313482openalex-snapshot
Derandomizing Codes for the Binary Adversarial Wiretap Channel of Type II
inferred← citeshttps://doi.org/10.1109/ccc.2002.1004350openalex-snapshot
Decoding concatenated codes using soft information
inferred← citeshttps://doi.org/10.1109/ccc.2006.15openalex-snapshot
Constructions of Low-Degree and Error-Correcting \in-Biased Generators
inferred← citeshttps://doi.org/10.1109/ccc.2008.13openalex-snapshot
Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes
inferred← citeshttps://doi.org/10.1109/ccc.2012.33openalex-snapshot
List Decoding Barnes-Wall Lattices
inferred← citeshttps://doi.org/10.1109/focs.2004.46openalex-snapshot
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/focs.2006.56openalex-snapshot
On the Optimality of the Dimensionality Reduction Method
inferred← citeshttps://doi.org/10.1109/focs.2007.31openalex-snapshot
Simulating Quantum Correlations with Finite Communication
inferred← citeshttps://doi.org/10.1109/focs.2007.37openalex-snapshot
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1109/focs.2014.33openalex-snapshot
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
inferred← citeshttps://doi.org/10.1109/focs.2014.49openalex-snapshot
Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding
inferred← citeshttps://doi.org/10.1109/focs.2017.27openalex-snapshot
Local List Recovery of High-Rate Tensor Codes & Applications
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00019openalex-snapshot
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00040openalex-snapshot
On Pseudolinear Codes for Correcting Adversarial Errors
inferred← citeshttps://doi.org/10.1109/hpcs.2017.61openalex-snapshot
On Determining Multiple Optimal Parenthesizations for Matrix Chain Products and Scheduling the Corresponding Task Graphs
inferred← citeshttps://doi.org/10.1109/icics.2015.7459839openalex-snapshot
Further results on LDPC decoding scheduling for faster convergence
inferred← citeshttps://doi.org/10.1109/icosp.2006.345957openalex-snapshot
Reed-Solomon Codes as Traceability Codes with an Efficient Tracing Algorithm
inferred← citeshttps://doi.org/10.1109/icsea.2006.261319openalex-snapshot
A Class of Traceability Codes with an Efficient Tracing Algorithm
inferred← citeshttps://doi.org/10.1109/isit.2009.5205965openalex-snapshot
On error correction with feedback under list decoding
inferred← citeshttps://doi.org/10.1109/isit.2010.5513280openalex-snapshot
Source coding with side information using list decoding
inferred← citeshttps://doi.org/10.1109/isit.2010.5513761openalex-snapshot
Two-level fingerprinting: Stronger definitions and code constructions
inferred← citeshttps://doi.org/10.1109/isit.2011.6034133openalex-snapshot
Necessary conditions for consistent set-based graphical model selection
inferred← citeshttps://doi.org/10.1109/isit.2011.6034254openalex-snapshot
Minimal list decoding of Reed-Solomon codes using a parameterization of Gröbner bases
inferred← citeshttps://doi.org/10.1109/isit.2012.6284707openalex-snapshot
A lifting decoding scheme and its application to interleaved linear codes
inferred← citeshttps://doi.org/10.1109/isit.2014.6875140openalex-snapshot
Re-encoding reformulation and application to Welch-Berlekamp algorithm
inferred← citeshttps://doi.org/10.1109/isit.2014.6875276openalex-snapshot
List decoding - Random coding exponents and expurgated exponents
inferred← citeshttps://doi.org/10.1109/isit.2015.7282408openalex-snapshot
Improved burst error correction via list decoding quasi-cyclic codes
inferred← citeshttps://doi.org/10.1109/isit.2015.7282510openalex-snapshot
On mismatched list decoding
inferred← citeshttps://doi.org/10.1109/isit.2016.7541565openalex-snapshot
Improved erasure list decoding locally repairable codes using alphabet-dependent list recovery
inferred← citeshttps://doi.org/10.1109/isit.2017.8006549openalex-snapshot
Decoding of interleaved Reed-Solomon codes using improved power decoding
inferred← citeshttps://doi.org/10.1109/isit.2017.8006869openalex-snapshot
Limits to list decoding of insertions and deletions
inferred← citeshttps://doi.org/10.1109/isit.2019.8849353openalex-snapshot
A Construction of Traceability Set Systems with Polynomial Tracing Algorithm
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834612openalex-snapshot
On the List Size in the Levenshtein’s Sequence Reconstruction Problem
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834689openalex-snapshot
List Decoding of 2-Interleaved Binary Alternant Codes
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653994openalex-snapshot
List Decoding of Hyperderivative Reed-Solomon Codes under NRT-metric
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195439openalex-snapshot
Near Optimal Code Construction for the Adversarial Torn Paper Channel with Edit Errors
inferred← citeshttps://doi.org/10.1109/iswcs49558.2021.9562175openalex-snapshot
Reed-Solomon Coded Compressed Sensing for the Unsourced Random Access
inferred← citeshttps://doi.org/10.1109/itw.2003.1216696openalex-snapshot
A generalization of traceability codes using ideal-based codes
inferred← citeshttps://doi.org/10.1109/itw.2006.1633776openalex-snapshot
List Decoding in Average-Case Complexity and Pseudorandomness
inferred← citeshttps://doi.org/10.1109/itw.2006.1633794openalex-snapshot
Families of traceability codes based on the Chinese Remainder Theorem
inferred← citeshttps://doi.org/10.1109/itw62417.2025.11240468openalex-snapshot
On the Intersections of q-ary Hamming Balls
inferred← citeshttps://doi.org/10.1109/lcomm.2009.090047openalex-snapshot
Approaching blokh-zyablov error exponent with linear-time encodable/decodable codes
inferred← citeshttps://doi.org/10.1109/mwent47943.2020.9067411openalex-snapshot
Algebraic Geometry Codes for Special Broadcast Encryption Schemes in Telecommunication Nets
inferred← citeshttps://doi.org/10.1109/redundancy52534.2021.9606444openalex-snapshot
On Unsourced Random Access for the MIMO Channel
inferred← citeshttps://doi.org/10.1109/secpri.2004.1301327openalex-snapshot
Multicast authentication in fully adversarial networks
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959879openalex-snapshot
Coding theory: Tutorial & survey
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181968openalex-snapshot
Linear Diophantine equations over polynomials and soft decoding of Reed-Solomon codes
inferred← citeshttps://doi.org/10.1109/sfcs.2005.29openalex-snapshot
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
inferred← citeshttps://doi.org/10.1109/sp.2009.24openalex-snapshot
Privacy Weaknesses in Biometric Sketches
inferred← citeshttps://doi.org/10.1109/t-wc.2008.070615openalex-snapshot
Reduced Complexity Interpolation for List Decoding Hermitian Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2009.08.070302openalex-snapshot
Soft-decision list decoding of hermitian codes
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2349943openalex-snapshot
LDPC Decoding Scheduling for Faster Convergence and Lower Error Floor
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3216901openalex-snapshot
Coded Compressed Sensing With List Recoverable Codes for the Unsourced Random Access
inferred← citeshttps://doi.org/10.1109/tit.2003.809570openalex-snapshot
Digital fingerprinting codes: problem statements, constructions, identification of traitors
inferred← citeshttps://doi.org/10.1109/tit.2003.815776openalex-snapshot
List decoding from erasures: bounds and code constructions
inferred← citeshttps://doi.org/10.1109/tit.2005.850097openalex-snapshot
Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
inferred← citeshttps://doi.org/10.1109/tit.2005.855587openalex-snapshot
Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
inferred← citeshttps://doi.org/10.1109/tit.2006.878166openalex-snapshot
Improving the Alphabet-Size in Expander-Based Code Constructions
inferred← citeshttps://doi.org/10.1109/tit.2007.911222openalex-snapshot
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
inferred← citeshttps://doi.org/10.1109/tit.2008.2008124openalex-snapshot
Better Binary List Decodable Codes Via Multilevel Concatenation
inferred← citeshttps://doi.org/10.1109/tit.2010.2054750openalex-snapshot
Limits to List Decoding of Random Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2059572openalex-snapshot
The Existence of Concatenated Codes List-Decodable up to the Hamming Bound
inferred← citeshttps://doi.org/10.1109/tit.2010.2095170openalex-snapshot
On the List-Decodability of Random Linear Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2095193openalex-snapshot
Soft Decoding, Dual BCH Codes, and Better List-Decodable $\varepsilon$-Biased Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2095194openalex-snapshot
Identifying Traitors Using the Koetter–Vardy Algorithm
inferred← citeshttps://doi.org/10.1109/tit.2011.2161960openalex-snapshot
Authentication of Digital Streams
inferred← citeshttps://doi.org/10.1109/tit.2011.2162176openalex-snapshot
Tight Performance Bounds for Permutation Invariant Binary Linear Block Codes Over Symmetric Channels
inferred← citeshttps://doi.org/10.1109/tit.2011.2165803openalex-snapshot
A Parametric Approach to List Decoding of Reed-Solomon Codes Using Interpolation
inferred← citeshttps://doi.org/10.1109/tit.2012.2184841openalex-snapshot
Weight Distribution and List-Decoding Size of Reed–Muller Codes
inferred← citeshttps://doi.org/10.1109/tit.2013.2264797openalex-snapshot
On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
inferred← citeshttps://doi.org/10.1109/tit.2013.2274653openalex-snapshot
Bounds on List Decoding of Rank-Metric Codes
inferred← citeshttps://doi.org/10.1109/tit.2014.2314468openalex-snapshot
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
inferred← citeshttps://doi.org/10.1109/tit.2014.2351393openalex-snapshot
List Decoding—Random Coding Exponents and Expurgated Exponents
inferred← citeshttps://doi.org/10.1109/tit.2014.2361333openalex-snapshot
On the List-Decodability of Random Self-Orthogonal Codes
inferred← citeshttps://doi.org/10.1109/tit.2015.2503766openalex-snapshot
A Model for Adversarial Wiretap Channels
inferred← citeshttps://doi.org/10.1109/tit.2015.2513046openalex-snapshot
On the List Decodability of Burst Errors
inferred← citeshttps://doi.org/10.1109/tit.2017.2692212openalex-snapshot
Efficiently List-Decodable Punctured Reed-Muller Codes
inferred← citeshttps://doi.org/10.1109/tit.2017.2777471openalex-snapshot
List Decoding of Insertions and Deletions
inferred← citeshttps://doi.org/10.1109/tit.2018.2854589openalex-snapshot
On the Combinatorial Version of the Slepian–Wolf Problem
inferred← citeshttps://doi.org/10.1109/tit.2019.2898863openalex-snapshot
The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels
inferred← citeshttps://doi.org/10.1109/tit.2019.2904998openalex-snapshot
List Decodability of Symbol-Pair Codes
inferred← citeshttps://doi.org/10.1109/tit.2019.2926075openalex-snapshot
The Decoding Error Probability of Linear Codes Over the Erasure Channel
inferred← citeshttps://doi.org/10.1109/tit.2020.3023962openalex-snapshot
On List Recovery of High-Rate Tensor Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.3046260openalex-snapshot
On Multifold Packings of Radius-1 Balls in Hamming Graphs
inferred← citeshttps://doi.org/10.1109/tit.2021.3123497openalex-snapshot
Threshold Rates for Properties of Random Codes
inferred← citeshttps://doi.org/10.1109/tit.2022.3187004openalex-snapshot
On q-Ary Shortened-1-Perfect-Like Codes
inferred← citeshttps://doi.org/10.1109/tit.2022.3189542openalex-snapshot
List Decoding Random Euclidean Codes and Infinite Constellations
inferred← citeshttps://doi.org/10.1109/tit.2023.3318354openalex-snapshot
The Levenshtein’s Sequence Reconstruction Problem and the Length of the List
inferred← citeshttps://doi.org/10.1109/tit.2024.3377601openalex-snapshot
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help
inferred← citeshttps://doi.org/10.1109/tkde.2006.149openalex-snapshot
The Optimality of Allocation Methods for Bounded Disagreement Search Queries: The Possible and the Impossible
inferred← citeshttps://doi.org/10.1109/tsp.2004.833858openalex-snapshot
Identification of Traitors in Algebraic-Geometric Traceability Codes
inferred← citeshttps://doi.org/10.1134/s0001434609010076openalex-snapshot
Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
inferred← citeshttps://doi.org/10.1134/s0032946019030074openalex-snapshot
Traceability Codes and Their Generalizations
inferred← citeshttps://doi.org/10.1137/060651380openalex-snapshot
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
inferred← citeshttps://doi.org/10.1137/1.9781611975031.43openalex-snapshot
Approximate Local Decoding of Cubic Reed-Muller Codes Beyond the List Decoding Radius
inferred← citeshttps://doi.org/10.1137/s0097539705447335openalex-snapshot
On the List and Bounded Distance Decodability of Reed–Solomon Codes
inferred← citeshttps://doi.org/10.1142/9789814324359_0162openalex-snapshot
Bridging Shannon and Hamming: List Error-correction with Optimal Rate
inferred← citeshttps://doi.org/10.1145/1007352.1007422openalex-snapshot
Better extractors for better codes?
inferred← citeshttps://doi.org/10.1145/1374376.1374417openalex-snapshot
List-decoding reed-muller codes over small fields
inferred← citeshttps://doi.org/10.1145/1536414.1536419openalex-snapshot
List decoding tensor products and interleaved codes
inferred← citeshttps://doi.org/10.1145/1698750.1698757openalex-snapshot
Authenticated error-correcting codes with applications to multicast authentication
inferred← citeshttps://doi.org/10.1145/1806689.1806747openalex-snapshot
On the list-decodability of random linear codes
inferred← citeshttps://doi.org/10.1145/2554797.2554815openalex-snapshot
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
inferred← citeshttps://doi.org/10.1145/509907.510022openalex-snapshot
Limits to list decodability of linear codes
inferred← citeshttps://doi.org/10.1145/509907.510023openalex-snapshot
Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
inferred← citeshttps://doi.org/10.1145/568425.568432openalex-snapshot
SIGACT news complexity theory column 34
inferred← citeshttps://doi.org/10.1145/601819.601829openalex-snapshot
SIGACT news complexity theory column 38
inferred← citeshttps://doi.org/10.1145/780542.780562openalex-snapshot
Linear time encodable and list decodable codes
inferred← citeshttps://doi.org/10.1186/s13638-018-1076-7openalex-snapshot
The combination of sparse learning and list decoding of subspace codes for error correction in random network coding
inferred← citeshttps://doi.org/10.14264/uql.2014.506openalex-snapshot
On the number field sieve: polynomial selection and smooth elements in number fields
inferred← citeshttps://doi.org/10.1561/9781601980052openalex-snapshot
Algorithmic Results in List Decoding
inferred← citeshttps://doi.org/10.1587/transfun.2021eal2015openalex-snapshot
On the List Decodability of Matrix Codes with Different Metrics
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9292openalex-snapshot
Voting Rules As Error-Correcting Codes
inferred← citeshttps://doi.org/10.18725/oparu-2512openalex-snapshot
Algebraic soft- and hard-decision decoding of generalized Reed--Solomon and cyclic codes
inferred← citeshttps://doi.org/10.18725/oparu-2515openalex-snapshot
Decoding of block and convolutional codes in rank metric
inferred← citeshttps://doi.org/10.2140/ant.2010.4.433openalex-snapshot
Cyclotomic function fields, Artin–Frobenius automorphisms, and list error correction with optimal rate
inferred← citeshttps://doi.org/10.29252/asta.6.1.35openalex-snapshot
A general construction of Reed-Solomon codes based on generalized discrete Fourier transform
inferred← citeshttps://doi.org/10.32657/10356/74108openalex-snapshot
List decoding of rank-metric and cover-metric codes
inferred← citeshttps://doi.org/10.4171/022-3/54openalex-snapshot
Pseudorandomness and combinatorial constructions
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2016.23openalex-snapshot
On Higher-Order Fourier Analysis over Non-Prime Fields
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2018.58openalex-snapshot
Erasures vs. Errors in Local Decoding and Property Testing
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.1openalex-snapshot
Near-optimal erasure list-decodable codes
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.51openalex-snapshot
Generalized List Decoding
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.230openalex-snapshot
Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion
inferred← citeshttps://doi.org/10.48550/arxiv.0811.2356openalex-snapshot
The List-Decoding Size of Reed-Muller Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1102.4712openalex-snapshot
Effective protocols for low-distance file synchronization
inferred← citeshttps://doi.org/10.48550/arxiv.1104.3025openalex-snapshot
Storage Enforcement with Kolmogorov Complexity and List Decoding
inferred← citeshttps://doi.org/10.48550/arxiv.1205.1462openalex-snapshot
Almost Universal Hash Families are also Storage Enforcing
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5190openalex-snapshot
Sparse Approximation, List Decoding, and Uncertainty Principles
inferred← citeshttps://doi.org/10.48550/arxiv.1407.3433openalex-snapshot
List decoding Reed-Muller codes over small fields
inferred← citeshttps://doi.org/10.48550/arxiv.1503.08513openalex-snapshot
Hiding Symbols and Functions: New Metrics and Constructions for Information-Theoretic Security
inferred← citeshttps://doi.org/10.48550/arxiv.1707.04982openalex-snapshot
Practical Locally Private Heavy Hitters
inferred← citeshttps://doi.org/10.48550/arxiv.1709.03424openalex-snapshot
Constant-Weight Array Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1711.04740openalex-snapshot
Heavy Hitters and the Structure of Local Privacy
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0610142openalex-snapshot
Coding into a source: a direct inverse Rate-Distortion theorem
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4767openalex-snapshot
Applications of Derandomization Theory in Coding
inferred← citeshttps://doi.org/10.5772/35316openalex-snapshot
Polynomial-Time Codes Against Averaging Attack for Multimedia Fingerprinting
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95234openalex-snapshot
On codes for traceability schemes: constructions and bounds
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95779openalex-snapshot
A contribution to the theory of convolutional codes from systems theory piont of view
inferred← citeshttps://doi.org/10.70675/c4a406f5zf343z4b99za078z059ecd965c6bopenalex-snapshot
Some applications of the geometry of toric surfaces over a finite field for arithmetic and information theory
inferred← citeshttps://doi.org/10.7907/38zt-qt95.openalex-snapshot
Coding techniques for data-storage 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.