On the public citation graph
Upper bounds on generalized distances
0 signed · 48 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/j.1538-7305.1984.tb00072.xopenalex-snapshot
Wire-Tap Channel II
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/18.133259openalex-snapshot
Generalized Hamming weights for linear codes
inferredcites →https://doi.org/10.1109/18.135653openalex-snapshot
On the generalized Hamming weights of several classes of cyclic cods
inferredcites →https://doi.org/10.1109/18.135655openalex-snapshot
Generalized Hamming weights of linear codes
inferredcites →https://doi.org/10.1109/18.179366openalex-snapshot
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
inferredcites →https://doi.org/10.1109/18.21242openalex-snapshot
Code construction for the noiseless binary switching multiple-access channel
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11586821_5openalex-snapshot
A Trellis-Based Bound on (2,1)-Separating Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-12160-4_3openalex-snapshot
Towards Secure Two-Party Computation from the Wire-Tap Channel
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_58openalex-snapshot
Query Complexity in Errorless Hardness Amplification
inferred← citeshttps://doi.org/10.1007/s00037-015-0117-4openalex-snapshot
Query Complexity in Errorless Hardness Amplification
inferred← citeshttps://doi.org/10.1007/s10623-012-9657-7openalex-snapshot
Code constructions and existence bounds for relative generalized Hamming weight
inferred← citeshttps://doi.org/10.1007/s10623-024-01553-0openalex-snapshot
The weight hierarchies of three classes of linear codes
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114240openalex-snapshot
The weight hierarchies of linear codes from simplicial complexes
inferred← citeshttps://doi.org/10.1023/a:1008227811117openalex-snapshot
On Generalized Hamming Weights for Galois Ring Linear Codes
inferred← citeshttps://doi.org/10.1103/physreva.63.032311openalex-snapshot
Asymptotically good quantum codes
inferred← citeshttps://doi.org/10.1109/18.476213openalex-snapshot
Geometric approach to higher weights
inferred← citeshttps://doi.org/10.1109/18.476318openalex-snapshot
Lower bounds on trellis complexity of block codes
inferred← citeshttps://doi.org/10.1109/18.567718openalex-snapshot
On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two
inferred← citeshttps://doi.org/10.1109/18.567719openalex-snapshot
On the generalized Hamming weights of cyclic codes
inferred← citeshttps://doi.org/10.1109/18.641547openalex-snapshot
Parameters of Goppa codes revisited
inferred← citeshttps://doi.org/10.1109/18.749020openalex-snapshot
Generalized Hamming weights of nonlinear codes and the relation to the Z/sub 4/-linear representation
inferred← citeshttps://doi.org/10.1109/18.761280openalex-snapshot
New upper bounds on generalized weights
inferred← citeshttps://doi.org/10.1109/18.796389openalex-snapshot
On binary constructions of quantum codes
inferred← citeshttps://doi.org/10.1109/cig.2010.5592938openalex-snapshot
Applications of semidefinite programming to coding theory
inferred← citeshttps://doi.org/10.1109/isit.1997.613118openalex-snapshot
Generalized Lee weights for codes over Z/sub 4/
inferred← citeshttps://doi.org/10.1109/isit.1997.613387openalex-snapshot
On perfect codes and tilings: problems and solutions
inferred← citeshttps://doi.org/10.1109/isit.2019.8849486openalex-snapshot
Unrestricted Generalized Column Distances: A Wider Definition
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518233openalex-snapshot
The Generalized Covering Radii of Linear Codes
inferred← citeshttps://doi.org/10.1109/ita50056.2020.9244978openalex-snapshot
Generalized List Decoding
inferred← citeshttps://doi.org/10.1109/itw44776.2019.8989391openalex-snapshot
Error Decoding of Locally Repairable and Partial MDS Codes
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.2014.2314468openalex-snapshot
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
inferred← citeshttps://doi.org/10.1109/tit.2015.2442231openalex-snapshot
Optimal Fractional Repetition Codes Based on Graphs and Designs
inferred← citeshttps://doi.org/10.1109/tit.2016.2570236openalex-snapshot
The Weight Hierarchy of Some Reducible Cyclic Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.2999987openalex-snapshot
Generalized Column Distances
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.3277454openalex-snapshot
Generalized Hamming Weights of Linear Codes From Quadratic Forms Over Finite Fields of Even Characteristic
inferred← citeshttps://doi.org/10.1137/s0895480196309171openalex-snapshot
On Perfect Codes and Tilings: Problems and Solutions
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
inferred← citeshttps://doi.org/10.2172/515638openalex-snapshot
On generalized hamming weighs for Galois ring linear codes
inferred← citeshttps://doi.org/10.3934/amc.2010.4.547openalex-snapshot
Bounds for binary codes relative to pseudo-distances of $k$ points
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.51openalex-snapshot
Generalized List Decoding
inferred← citeshttps://doi.org/10.48550/arxiv.1306.6265openalex-snapshot
Towards Secure Two-Party Computation from the Wire-Tap Channel
inferred← citeshttps://doi.org/10.48550/arxiv.1505.07278openalex-snapshot
Higher weight distribution of linearized Reed-Solomon 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.