On the public citation graph
Small weight codewords in the LDPC codes arising from linear representations of geometries
0 signed · 44 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/ett.4460140503openalex-snapshot
Regular low-density parity-check codes from oval designs
inferredcites →https://doi.org/10.1006/eujc.2002.0593openalex-snapshot
Full Embeddings of (α, β) -Geometries in Projective Spaces
inferredcites →https://doi.org/10.1006/jcta.1996.0064openalex-snapshot
Small Complete Caps in Spaces of Even Characteristic
inferredcites →https://doi.org/10.1007/978-1-4613-0165-3_6openalex-snapshot
Evaluation of Gallager Codes for Short Block Length and High Rate Applications
inferredcites →https://doi.org/10.1007/bf02579283openalex-snapshot
Explicit constructions of graphs without short cycles and low density codes
inferredcites →https://doi.org/10.1007/s10623-006-9017-6openalex-snapshot
Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
inferredcites →https://doi.org/10.1016/0021-8693(72)90107-xopenalex-snapshot
Quadrangles of order (s − 1, s + 1)
inferredcites →https://doi.org/10.1016/s0898-1221(96)90479-4openalex-snapshot
Handbook of incidence geometry: Buildings and foundations
inferredcites →https://doi.org/10.1017/s0305004100069346openalex-snapshot
On (q + t)-arcs of type (0, 2, t) in a desarguesian plane of order q
inferredcites →https://doi.org/10.1023/a:1024152424893openalex-snapshot
On (q + t, t)-Arcs of Type (0, 2, t)
inferredcites →https://doi.org/10.1049/el:19961141openalex-snapshot
Near Shannon limit performance of low density paritycheck codes
inferredcites →https://doi.org/10.1049/el:19970362openalex-snapshot
Near Shannon limit performance of low density paritycheck codes
inferredcites →https://doi.org/10.1093/oso/9780198502951.001.0001openalex-snapshot
Projective Geometries over Finite Fields
inferredcites →https://doi.org/10.1109/18.748992openalex-snapshot
Good error-correcting codes based on very sparse matrices
inferredcites →https://doi.org/10.1109/18.910591openalex-snapshot
Minimum-distance bounds by graph analysis
inferredcites →https://doi.org/10.1109/18.959255openalex-snapshot
Low-density parity-check codes based on finite geometries: a rediscovery and new results
inferredcites →https://doi.org/10.1109/glocom.2001.965562openalex-snapshot
Construction of low-density parity-check codes from Kirkman triple systems
inferredcites →https://doi.org/10.1109/icc.2004.1312605openalex-snapshot
On the computation of the minimum distance of low-density parity-check codes
inferredcites →https://doi.org/10.1109/isit.2001.936086openalex-snapshot
Construction of codes based on finite generalized quadrangles for iterative decoding
inferredcites →https://doi.org/10.1109/isit.2002.1023582openalex-snapshot
Codes for iterative decoding from partial geometries
inferredcites →https://doi.org/10.1109/itw.2001.955146openalex-snapshot
Regular low-density parity-check codes from combinatorial designs
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.2004.831841openalex-snapshot
Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
inferredcites →https://doi.org/10.1109/tit.2004.834760openalex-snapshot
Explicit Construction of Families of LDPC Codes With No $4$ -Cycles
inferredcites →https://doi.org/10.1109/tit.2004.838370openalex-snapshot
LDPC Block and Convolutional Codes Based on Circulant Matrices
inferredcites →https://doi.org/10.1109/tit.2005.856936openalex-snapshot
LDPC Codes From Generalized Polygons
inferredcites →https://doi.org/10.4064/aa-5-3-315-332openalex-snapshot
On complete caps and ovaloids in three-dimensional Galois spaces of characteristic two
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-319-12340-0_30openalex-snapshot
Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_3openalex-snapshot
Split Clique Graph Complexity
inferred← citeshttps://doi.org/10.1007/s00373-011-1103-5openalex-snapshot
Some Combinatorial Aspects of Constructing Bipartite-Graph Codes
inferred← citeshttps://doi.org/10.1007/s10623-009-9324-9openalex-snapshot
Some low-density parity-check codes derived from finite geometries
inferred← citeshttps://doi.org/10.1007/s10623-022-01054-yopenalex-snapshot
Moderate-density parity-check codes from projective bundles
inferred← citeshttps://doi.org/10.1016/j.disc.2009.06.010openalex-snapshot
On codewords in the dual code of classical generalised quadrangles and classical polar spaces
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.03.003openalex-snapshot
Codes of Desarguesian projective planes of even order, projective triads and (q+t,t) -arcs of type (0,2,t)
inferred← citeshttps://doi.org/10.1016/j.jcta.2020.105238openalex-snapshot
Linear representations of finite geometries and associated LDPC codes
inferred← citeshttps://doi.org/10.1016/j.jpaa.2009.12.017openalex-snapshot
A study of intersections of quadrics having applications on the small weight codewords of the functional codes C2(Q) , Q a non-singular quadric
inferred← citeshttps://doi.org/10.1016/j.laa.2012.03.024openalex-snapshot
Large weight code words in projective space codes
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.020openalex-snapshot
Split clique graph complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.060openalex-snapshot
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
inferred← citeshttps://doi.org/10.3934/amc.2010.4.405openalex-snapshot
LDPC codes associated with linear representations of geometries
inferred← citeshttps://doi.org/10.3934/amc.2020099openalex-snapshot
Locally repairable codes with high availability based on generalised quadrangles
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.