On the public citation graph

The effective length of subcodes

0 signed · 60 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.1963.tb04003.xopenalex-snapshot
A Theorem on the Distribution of Weights in a Systematic Code†
inferredcites →https://doi.org/10.1007/3-540-54195-0_36openalex-snapshot
A description of the [16,7,6] codes
inferredcites →https://doi.org/10.1016/0012-365x(92)90559-xopenalex-snapshot
Support weight distribution of linear codes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/cbo9780511987045openalex-snapshot
A Course in Combinatorics
inferredcites →https://doi.org/10.1109/18.133259openalex-snapshot
Generalized Hamming weights for linear codes
inferredcites →https://doi.org/10.1109/18.256515openalex-snapshot
On complexity of trellis structure of linear block codes
inferredcites →https://doi.org/10.1109/18.340452openalex-snapshot
Dimension/length profiles and trellis complexity of linear block codes
inferredcites →https://doi.org/10.1109/proc.1980.11608openalex-snapshot
The theory of error-correcting codes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/1-4020-5334-4openalex-snapshot
Topics in Geometry, Coding Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/1-4020-5334-4_3openalex-snapshot
ARTIN-SCHREIER EXTENSIONS AND THEIR APPLICATIONS
inferred← citeshttps://doi.org/10.1007/3-540-58265-7_6openalex-snapshot
Generalizations of the Griesmer bound
inferred← citeshttps://doi.org/10.1007/978-3-540-24633-6_9openalex-snapshot
Combinatorics of the Two-Variable Zeta Function
inferred← citeshttps://doi.org/10.1007/978-3-642-10868-6_4openalex-snapshot
On Higher Weights and Code Existence
inferred← citeshttps://doi.org/10.1007/s002000050060openalex-snapshot
The Matroid of Supports of A Linear Code
inferred← citeshttps://doi.org/10.1007/s10623-003-6152-1openalex-snapshot
Support Weight Enumerators and Coset Weight Distributions of Isodual Codes
inferred← citeshttps://doi.org/10.1007/s10623-011-9557-2openalex-snapshot
Weight enumeration of codes from finite spaces
inferred← citeshttps://doi.org/10.1007/s10623-012-9750-yopenalex-snapshot
On the relative profiles of a linear code and a subcode
inferred← citeshttps://doi.org/10.1007/s10623-018-0576-0openalex-snapshot
Codes with the rank metric and matroids
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90099-3openalex-snapshot
Fibre products of Artin—Schreier curves and generalized hamming weights of codes
inferred← citeshttps://doi.org/10.1016/j.disc.2006.12.001openalex-snapshot
Higher support matroids
inferred← citeshttps://doi.org/10.1016/j.ins.2012.09.007openalex-snapshot
Further results on the semilinear equivalence of linear codes
inferred← citeshttps://doi.org/10.1016/j.jcta.2025.106090openalex-snapshot
Harmonic higher and extended weight enumerators
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00168-6openalex-snapshot
Support weight distribution of Z4-linear codes
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00341-3openalex-snapshot
Radon transforms and packings
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00182-9openalex-snapshot
Polynomial invariants for binary linear codes
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00197-0openalex-snapshot
On the Minimum Weights of Type IV Codes over 4 with Certain Lengths
inferred← citeshttps://doi.org/10.1017/9780511982170openalex-snapshot
Codes, Cryptology and Curves with Computer Algebra
inferred← citeshttps://doi.org/10.1017/s0004972715000052openalex-snapshot
NOTE ON SUPPORT WEIGHT DISTRIBUTION OF LINEAR CODES OVER
inferred← citeshttps://doi.org/10.1017/s0004972716000526openalex-snapshot
ON THE SUPPORT WEIGHT DISTRIBUTION OF LINEAR CODES OVER THE RING
inferred← citeshttps://doi.org/10.1023/a:1008227811117openalex-snapshot
On Generalized Hamming Weights for Galois Ring Linear Codes
inferred← citeshttps://doi.org/10.1023/a:1008382528138openalex-snapshot
Binomial Moments of the Distance Distribution and the Probability of Undetected Error
inferred← citeshttps://doi.org/10.1023/a:1011265011802openalex-snapshot
Trellis Structure and Higher Weights of Extremal Self-Dual Codes
inferred← citeshttps://doi.org/10.1023/a:1026162531539openalex-snapshot
Extended Binomial Moments of a Linear Code and the Undetected Error Probability
inferred← citeshttps://doi.org/10.1093/ietfec/e90-a.9.1763openalex-snapshot
Average Bit Erasure Probability of Regular LDPC Code Ensembles under MAP Decoding over BEC
inferred← citeshttps://doi.org/10.1109/18.272476openalex-snapshot
Codes satisfying the chain condition
inferred← citeshttps://doi.org/10.1109/18.340452openalex-snapshot
Dimension/length profiles and trellis complexity of linear block codes
inferred← citeshttps://doi.org/10.1109/18.370144openalex-snapshot
Bounds on the minimum support weights
inferred← citeshttps://doi.org/10.1109/18.476213openalex-snapshot
Geometric approach to higher weights
inferred← citeshttps://doi.org/10.1109/18.481787openalex-snapshot
The worst case probability of undetected error for linear codes on the local binomial channel
inferred← citeshttps://doi.org/10.1109/18.556112openalex-snapshot
On the information function of an error-correcting code
inferred← citeshttps://doi.org/10.1109/18.567719openalex-snapshot
On the generalized Hamming weights of cyclic codes
inferred← citeshttps://doi.org/10.1109/18.651015openalex-snapshot
Generalized Hamming weights of q-ary Reed-Muller codes
inferred← citeshttps://doi.org/10.1109/18.748994openalex-snapshot
Binomial moments of the distance distribution: bounds and applications
inferred← citeshttps://doi.org/10.1109/18.761280openalex-snapshot
New upper bounds on generalized weights
inferred← citeshttps://doi.org/10.1109/isit.1997.613301openalex-snapshot
Remarks on the MacWilliams identities for higher weights
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174340openalex-snapshot
Fidelity of Finite Length Quantum Codes in Qubit Erasure Channel
inferred← citeshttps://doi.org/10.1109/tit.2002.808115openalex-snapshot
The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes
inferred← citeshttps://doi.org/10.1109/tit.2004.826673openalex-snapshot
Duality and Support Weight Distributions
inferred← citeshttps://doi.org/10.1109/tit.2004.836693openalex-snapshot
Extrinsic information transfer functions: model and erasure channel properties
inferred← citeshttps://doi.org/10.1109/tit.2004.838110openalex-snapshot
Generalized MacWilliams Identities for $BBZ _4$ -Linear Codes
inferred← citeshttps://doi.org/10.1109/tit.2005.851770openalex-snapshot
The Second Support Weight Distribution of the Kasami Codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2789347openalex-snapshot
Linear Codes Over $\mathbb F_q$ Are Equivalent to LCD Codes for $q>3$
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.2025.3550982openalex-snapshot
On the MacWilliams Theorem Over Codes and Lattices
inferred← citeshttps://doi.org/10.1137/120876356openalex-snapshot
MacWilliams Identities for $m$-tuple Weight Enumerators
inferred← citeshttps://doi.org/10.1137/s0895480199364148openalex-snapshot
On Some Polynomials Related to Weight Enumerators of Linear Codes
inferred← citeshttps://doi.org/10.2172/515638openalex-snapshot
On generalized hamming weighs for Galois ring linear codes
inferred← citeshttps://doi.org/10.37236/1636openalex-snapshot
MacWilliams Identities and Matroid Polynomials
inferred← citeshttps://doi.org/10.4134/jkms.2010.47.6.1167openalex-snapshot
HIGHER WEIGHTS AND GENERALIZED MDS 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.