On the public citation graph
Explicit constructions of graphs without short cycles and low density codes
0 signed · 280 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.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1093/oso/9780199219858.001.0001openalex-snapshot
An Introduction To The Theory Of Numbers
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.1964.1053651openalex-snapshot
Review of 'Low-Density Parity-Check Codes' (Gallager, R. G.; 1963)
inferredcites →https://doi.org/10.1515/9781400881666openalex-snapshot
Lectures on Modular Forms. (AM-48)
inferredcites →https://doi.org/10.7551/mitpress/4347.001.0001openalex-snapshot
Low-Density Parity-Check Codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.1047openalex-snapshot
Performance of joint multilevel/AES‐LDPCC‐CPFSK schemes over wireless sensor networks
inferred← citeshttps://doi.org/10.1002/dac.824openalex-snapshot
Performance of low density parity check coded continuous phase frequency shift keying (LDPCC‐CPFSK) over fading channels
inferred← citeshttps://doi.org/10.1002/jcd.20179openalex-snapshot
Small weight codewords in the LDPC codes arising from linear representations of geometries
inferred← citeshttps://doi.org/10.1002/jgt.10012openalex-snapshot
Turán problems for integer‐weighted graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190160105openalex-snapshot
Ramsey problems and their connection to tuŕan‐type extremal problems
inferred← citeshttps://doi.org/10.1002/rsa.20266openalex-snapshot
On the girth of random Cayley graphs
inferred← citeshttps://doi.org/10.1007/3-540-45878-6_6openalex-snapshot
An Introduction to Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1007/3-540-46416-6_44openalex-snapshot
Hash Functions And Graphs With Large Girths
inferred← citeshttps://doi.org/10.1007/3-540-57843-9_12openalex-snapshot
Group-theoretic hash functions
inferred← citeshttps://doi.org/10.1007/978-0-387-78263-8_12openalex-snapshot
Convolutional, Turbo, and Turbo-Like Codes for Digital Multimedia Broadcasting: Theory and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_19openalex-snapshot
Paul Erdős’ Influence on Extremal Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-57990-6_13openalex-snapshot
Oblivious Tight Compaction In O(n) Time with Smaller Constant
inferred← citeshttps://doi.org/10.1007/978-3-031-54053-0_3openalex-snapshot
On Graphs Defined by Equations and Cubic Multivariate Public Keys
inferred← citeshttps://doi.org/10.1007/978-3-031-66431-1_37openalex-snapshot
Walks on Algebraic Small World Graphs of Large Girth and New Secure Stream Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_129openalex-snapshot
Extremal Hypergraphs and Combinatorial Geometry
inferred← citeshttps://doi.org/10.1007/978-3-319-68032-3_6openalex-snapshot
Cryptographic Hash Functions and Some Applications to Information Security
inferred← citeshttps://doi.org/10.1007/978-3-540-77105-0_28openalex-snapshot
A Network Creation Game with Nonuniform Interests
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_24openalex-snapshot
Tensor Products of Weakly Smooth Codes Are Robust
inferred← citeshttps://doi.org/10.1007/978-3-642-01877-0_21openalex-snapshot
On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_29openalex-snapshot
Composition of Semi-LTCs by Two-Wise Tensor Products
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_13openalex-snapshot
Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas
inferred← citeshttps://doi.org/10.1007/978-3-642-29694-9_11openalex-snapshot
On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_15openalex-snapshot
A Combinatorial Classic — Sparse Graphs with High Chromatic Number
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_7openalex-snapshot
The History of Degenerate (Bipartite) Extremal Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_15openalex-snapshot
Paul Erdős’ Influence on Extremal Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-44893-9_7openalex-snapshot
On LDPC Codes Based on Families of Expanding Graphs of Increasing Girth without Edge-Transitive Automorphism Groups
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_14openalex-snapshot
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
inferred← citeshttps://doi.org/10.1007/978-94-017-7512-0_10openalex-snapshot
BCH and LDPC Error Correction Codes for NAND Flash Memories
inferred← citeshttps://doi.org/10.1007/bf02579157openalex-snapshot
Explicit construction of regular graphs without small cycles
inferred← citeshttps://doi.org/10.1007/bf02579201openalex-snapshot
On a pursuit game on cayley graphs
inferred← citeshttps://doi.org/10.1007/bf02784530openalex-snapshot
On the spectral gap for infinite index “congruence” subgroups of SL2(Z)
inferred← citeshttps://doi.org/10.1007/bf03219809openalex-snapshot
Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes
inferred← citeshttps://doi.org/10.1007/s00026-022-00569-4openalex-snapshot
Flexibility and Movability in Cayley Graphs
inferred← citeshttps://doi.org/10.1007/s00037-013-0074-8openalex-snapshot
Composition of semi-LTCs by two-wise tensor products
inferred← citeshttps://doi.org/10.1007/s00039-009-0032-4openalex-snapshot
Mean-Field Conditions for Percolation on Finite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02086-3openalex-snapshot
On the Relation of Separability, Bandwidth and Embedding
inferred← citeshttps://doi.org/10.1007/s00493-013-2863-8openalex-snapshot
On a conjecture of Erdős and Simonovits: Even cycles
inferred← citeshttps://doi.org/10.1007/s00493-014-2897-6openalex-snapshot
Regular graphs of large girth and arbitrary degree
inferred← citeshttps://doi.org/10.1007/s00493-021-4671-xopenalex-snapshot
Kissing Numbers of Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00493-024-00091-6openalex-snapshot
Small Subgraphs with Large Average Degree
inferred← citeshttps://doi.org/10.1007/s10440-007-9144-8openalex-snapshot
On Small World Semiplanes with Generalised Schubert Cells
inferred← citeshttps://doi.org/10.1007/s10440-021-00429-yopenalex-snapshot
A Connection Between a Question of Bermond and Bollobás and Ramanujan Graphs
inferred← citeshttps://doi.org/10.1007/s10623-006-9017-6openalex-snapshot
Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
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.1007/s10711-024-00950-yopenalex-snapshot
On super-rigidity of Gromov’s random monster group
inferred← citeshttps://doi.org/10.1007/s10801-022-01128-zopenalex-snapshot
Logarithmic girth expander graphs of $$SL_n({\mathbb {F}}_p)$$
inferred← citeshttps://doi.org/10.1007/s10898-011-9816-9openalex-snapshot
Monotonic optimization based decoding for linear codes
inferred← citeshttps://doi.org/10.1007/s10958-007-0453-2openalex-snapshot
On linguistic dynamical systems, families of graphs of large girth, and cryptography
inferred← citeshttps://doi.org/10.1007/s11277-022-09668-0openalex-snapshot
Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
inferred← citeshttps://doi.org/10.1007/s11856-020-1983-2openalex-snapshot
Forbidden Subgraphs for Graphs of Bounded Spectral Radius, with Applications to Equiangular Lines
inferred← citeshttps://doi.org/10.1007/s11856-020-2039-3openalex-snapshot
Popular products and continued fractions
inferred← citeshttps://doi.org/10.1007/s11856-022-2326-2openalex-snapshot
Spectral bounds of directed Cayley graphs of finite groups
inferred← citeshttps://doi.org/10.1007/s12095-015-0134-9openalex-snapshot
On encoding symbol degrees of array BP-XOR codes
inferred← citeshttps://doi.org/10.1007/s40879-024-00798-2openalex-snapshot
On affine forestry over integral domains and families of deep Jordan–Gauss graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90072-2openalex-snapshot
On the girth of infinite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00039-yopenalex-snapshot
High girth and extendability
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90033-3openalex-snapshot
Cops and robbers in graphs with large girth and Cayley graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00058-lopenalex-snapshot
Explicit construction of graphs with an arbitrary large girth and of large size
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50025-7openalex-snapshot
10.1016/b978-044488002-4/50025-7
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50034-8openalex-snapshot
10.1016/b978-044488002-4/50034-8
inferred← citeshttps://doi.org/10.1016/j.aeue.2011.03.020openalex-snapshot
Multilevel/AES-LDPCC-CPFSK with channel equalization over WSSUS multipath environment
inferred← citeshttps://doi.org/10.1016/j.dcan.2022.11.013openalex-snapshot
Doped low-density parity-check codes
inferred← citeshttps://doi.org/10.1016/j.disc.2004.12.024openalex-snapshot
A hierarchy of randomness for graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.103935openalex-snapshot
Extremal numbers of hypergraph suspensions of even cycles
inferred← citeshttps://doi.org/10.1016/j.jcta.2013.04.009openalex-snapshot
Hypergraph Ramsey numbers: Triangles versus cliques
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.008openalex-snapshot
The structure of matroids with a spanning clique or projective geometry
inferred← citeshttps://doi.org/10.1016/j.jfa.2012.01.020openalex-snapshot
Low-distortion embeddings of graphs with large girth
inferred← citeshttps://doi.org/10.1016/j.jnt.2011.05.010openalex-snapshot
Strong approximation in the Apollonian group
inferred← citeshttps://doi.org/10.1016/j.jnt.2019.09.022openalex-snapshot
The cycle structure of a Markoff automorphism over finite fields
inferred← citeshttps://doi.org/10.1016/j.jnt.2020.06.014openalex-snapshot
Modular hyperbolas and bilinear forms of Kloosterman sums
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00438-1openalex-snapshot
On isomorphisms of finite Cayley graphs—a survey
inferred← citeshttps://doi.org/10.1016/s0195-6698(87)80034-3openalex-snapshot
On a Pursuit Game on Cayley Digraphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(89)80067-8openalex-snapshot
Small-diameter Cayley Graphs for Finite Simple Groups
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80768-0openalex-snapshot
Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1017/9781009067928.012openalex-snapshot
Introduction to Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1017/9781316755723.013openalex-snapshot
Bisimulation invariance and finite models
inferred← citeshttps://doi.org/10.1017/cbo9781107325975.003openalex-snapshot
Combinatorics of optimal designs
inferred← citeshttps://doi.org/10.1017/s0305004116000529openalex-snapshot
Almost quasi-isometries and more non-C*-exact groups
inferred← citeshttps://doi.org/10.1017/s0305004120000201openalex-snapshot
Divergence and quasi-isometry classes of random Gromov’s monsters
inferred← citeshttps://doi.org/10.1017/s0963548322000104openalex-snapshot
Colouring graphs with forbidden bipartite subgraphs
inferred← citeshttps://doi.org/10.1023/a:1005919327201openalex-snapshot
On the Varieties of Parabolic Subgroups, their Generalizations and Combinatorial Applications
inferred← citeshttps://doi.org/10.1023/a:1008233013327openalex-snapshot
On Sparse Parity Check Matrices
inferred← citeshttps://doi.org/10.1023/a:1013815115684openalex-snapshot
To the Theory of Low-Density Convolutional Codes. II
inferred← citeshttps://doi.org/10.1023/a:1013821922527openalex-snapshot
Some Results Concerning the Design and Decoding of Turbo-Codes
inferred← citeshttps://doi.org/10.1023/a:1020643711475openalex-snapshot
On Nesterov's Approach to Semi-infinite Programming
inferred← citeshttps://doi.org/10.1023/a:1020686216463openalex-snapshot
Graphs with Special Arcs and Cryptography
inferred← citeshttps://doi.org/10.1049/iet-com.2014.1169openalex-snapshot
Informed shuffled belief‐propagation decoding for low‐density parity‐check codes
inferred← citeshttps://doi.org/10.1070/rm10029openalex-snapshot
Non-commutative methods in additive combinatorics and number theory
inferred← citeshttps://doi.org/10.1088/1751-8121/aa6b74openalex-snapshot
Rényi and Tsallis entropies related to eigenfunctions of quantum graphs
inferred← citeshttps://doi.org/10.1090/s0273-0979-06-01126-8openalex-snapshot
Expander graphs and their applications
inferred← citeshttps://doi.org/10.1090/s0273-0979-1995-00569-0openalex-snapshot
A new series of dense graphs of high girth
inferred← citeshttps://doi.org/10.1090/s0273-0979-2011-01359-3openalex-snapshot
Expander graphs in pure and applied mathematics
inferred← citeshttps://doi.org/10.1090/s0273-0979-2013-01401-0openalex-snapshot
Counting problems in Apollonian packings
inferred← citeshttps://doi.org/10.1093/imrn/rnag048openalex-snapshot
On Korobov Bound Concerning Zaremba’s Conjecture
inferred← citeshttps://doi.org/10.1103/physreva.109.052431openalex-snapshot
Fermionic Hamiltonians without trivial low-energy states
inferred← citeshttps://doi.org/10.1109/18.748992openalex-snapshot
Good error-correcting codes based on very sparse matrices
inferred← citeshttps://doi.org/10.1109/18.910577openalex-snapshot
The capacity of low-density parity-check codes under message-passing decoding
inferred← citeshttps://doi.org/10.1109/18.910579openalex-snapshot
Efficient encoding of low-density parity-check codes
inferred← citeshttps://doi.org/10.1109/26.111428openalex-snapshot
Representations and routing for Cayley graphs (computer networks)
inferred← citeshttps://doi.org/10.1109/26.2752openalex-snapshot
Asymptotic results for partial concentrators
inferred← citeshttps://doi.org/10.1109/allerton63246.2024.10735283openalex-snapshot
Quantum Margulis Codes
inferred← citeshttps://doi.org/10.1109/cesa.2006.4281891openalex-snapshot
Channel Mismatch Effect on Performance of Low Density Parity Check Codes
inferred← citeshttps://doi.org/10.1109/cesa.2006.4281906openalex-snapshot
Robust Video Transmission Scheme Using Dynamic Rate Selection LDPC and RS codes
inferred← citeshttps://doi.org/10.1109/ciss.2006.286581openalex-snapshot
Analysis and Design of Moderate Length Regular LDPC Codes with Low Error Floors
inferred← citeshttps://doi.org/10.1109/dspa60853.2024.10510058openalex-snapshot
Mixed Integer Linear Programming Method for Energy-Based Model Trapping Sets Enumerating
inferred← citeshttps://doi.org/10.1109/focs.2019.00020openalex-snapshot
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
inferred← citeshttps://doi.org/10.1109/glocom.2005.1577831openalex-snapshot
Generalized quad, hex, and octagon LDPC codes
inferred← citeshttps://doi.org/10.1109/icc.2002.997082openalex-snapshot
On the construction of turbo code interleavers based on graphs with large girth
inferred← citeshttps://doi.org/10.1109/icc.2011.5962724openalex-snapshot
Comparison of the Detrimental Effects of Trapping Sets in LDPC Codes
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/icumt.2009.5345453openalex-snapshot
An efficient pseudo-codeword search algorithm for Belief Propagation decoding of LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.1991.695233openalex-snapshot
A Fast Signature Scheme Without Secret Key
inferred← citeshttps://doi.org/10.1109/isit.2001.935867openalex-snapshot
Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis
inferred← citeshttps://doi.org/10.1109/isit.2004.1365272openalex-snapshot
Construction of good LDPC codes using dilation matrices
inferred← citeshttps://doi.org/10.1109/isit.2006.261678openalex-snapshot
A Compact Construction for LDPC Codes using Permutation Polynomials
inferred← citeshttps://doi.org/10.1109/isit.2006.261777openalex-snapshot
Instanton analysis of Low-Density Parity-Check codes in the error-floor regime
inferred← citeshttps://doi.org/10.1109/isit.2007.4557392openalex-snapshot
On Codes Constructed by Generalized Kronecker Product
inferred← citeshttps://doi.org/10.1109/isit.2007.4557664openalex-snapshot
An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices
inferred← citeshttps://doi.org/10.1109/isit.2010.5513611openalex-snapshot
Exhaustive search for small fully absorbing sets and the corresponding low error-floor decoder
inferred← citeshttps://doi.org/10.1109/isit.2011.6034183openalex-snapshot
Linear growing minimum distance of ultra-sparse non-binary cluster-LDPC codes
inferred← citeshttps://doi.org/10.1109/isit.2014.6875275openalex-snapshot
Quasi-cyclic LDPC codes on two arbitrary sets of a finite field
inferred← citeshttps://doi.org/10.1109/isit.2016.7541598openalex-snapshot
Probabilistic bounds on the trapping redundancy of linear codes
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619108openalex-snapshot
More Results for Regenerating Codes on Graphs
inferred← citeshttps://doi.org/10.1109/istc.2010.5613845openalex-snapshot
Robust clipping demapper for LDPC decoding in impulsive channel
inferred← citeshttps://doi.org/10.1109/istc.2010.5613902openalex-snapshot
An efficient algorithm for finding dominant trapping sets of LDPC codes
inferred← citeshttps://doi.org/10.1109/istc65386.2025.11154487openalex-snapshot
Quantum LDPC Codes with Enhanced Error-Floor Performance under Min-Sum Decoding
inferred← citeshttps://doi.org/10.1109/ita.2008.4601062openalex-snapshot
LDPC decoder strategies for achieving low error floors
inferred← citeshttps://doi.org/10.1109/ita.2015.7308978openalex-snapshot
Fault-resilient decoders and memories made of unreliable components
inferred← citeshttps://doi.org/10.1109/itw.2006.1633804openalex-snapshot
Some graph products and their expansion properties
inferred← citeshttps://doi.org/10.1109/itw.2007.4313075openalex-snapshot
Improving LDPC Decoders via Informed Dynamic Scheduling
inferred← citeshttps://doi.org/10.1109/itw2.2006.323769openalex-snapshot
Error Floor and Decoding with Message Scaling for Accumulator-Based and LDPC Codes
inferred← citeshttps://doi.org/10.1109/milcom.2008.4753229openalex-snapshot
Error floor analysis for an ensemble of easily implementable irregular (2048, 1024) LDPC codes
inferred← citeshttps://doi.org/10.1109/msp.2004.1267048openalex-snapshot
Structured low-density parity-check codes
inferred← citeshttps://doi.org/10.1109/secpri.2002.1004376openalex-snapshot
Expander graphs for digital stream authentication and robust overlay networks
inferred← citeshttps://doi.org/10.1109/sfcs.1985.19openalex-snapshot
Deterministic simulation of probabilistic constant depth circuits
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238182openalex-snapshot
On the Implementation of Huge Random Objects
inferred← citeshttps://doi.org/10.1109/sips.2002.1049702openalex-snapshot
Memory-efficient turbo decoder architectures for LDPC codes
inferred← citeshttps://doi.org/10.1109/spawc.2010.5670974openalex-snapshot
Asymptotic performance of LDPC codes in impulsive non-Gaussian channel
inferred← citeshttps://doi.org/10.1109/surv.2011.040410.00042openalex-snapshot
Low-Density Parity-Check Codes and Their Rateless Relatives
inferred← citeshttps://doi.org/10.1109/tcomm.2004.833048openalex-snapshot
Selective Avoidance of Cycles in Irregular LDPC Code Construction
inferred← citeshttps://doi.org/10.1109/tcomm.2009.05.070047openalex-snapshot
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2009.06.070325openalex-snapshot
Low-floor decoders for LDPC codes
inferred← citeshttps://doi.org/10.1109/tcomm.2010.101910.070303openalex-snapshot
LDPC Decoders with Informed Dynamic Scheduling
inferred← citeshttps://doi.org/10.1109/tcomm.2012.042712.100672openalex-snapshot
Finding the Exhaustive List of Small Fully Absorbing Sets and Designing the Corresponding Low Error-Floor Decoder
inferred← citeshttps://doi.org/10.1109/tcomm.2013.012313.120172openalex-snapshot
Two Informed Dynamic Scheduling Strategies for Iterative LDPC Decoders
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2339329openalex-snapshot
Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme
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.2015.2500234openalex-snapshot
Construction of Near-Capacity Protograph LDPC Code Sequences With Block-Error Thresholds
inferred← citeshttps://doi.org/10.1109/tcomm.2016.2518680openalex-snapshot
Hamming Distance Spectrum of DAC Codes for Equiprobable Binary Sources
inferred← citeshttps://doi.org/10.1109/tcsi.2009.2016621openalex-snapshot
Hardware Implementation of ${\rm GF}(2^{m})$ LDPC Decoders
inferred← citeshttps://doi.org/10.1109/tifs.2011.2148715openalex-snapshot
Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2004.839541openalex-snapshot
Regular and irregular progressive edge-growth tanner graphs
inferred← citeshttps://doi.org/10.1109/tit.2005.856936openalex-snapshot
LDPC Codes From Generalized Polygons
inferred← citeshttps://doi.org/10.1109/tit.2006.878179openalex-snapshot
Shortened Array Codes of Large Girth
inferred← citeshttps://doi.org/10.1109/tit.2008.2008134openalex-snapshot
The Trapping Redundancy of Linear Block Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.917682openalex-snapshot
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2009.2015993openalex-snapshot
Finding All Small Error-Prone Substructures in LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2009.2025573openalex-snapshot
An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices
inferred← citeshttps://doi.org/10.1109/tit.2010.2046203openalex-snapshot
Error Correction Capability of Column-Weight-Three LDPC Codes Under the Gallager A Algorithm—Part II
inferred← citeshttps://doi.org/10.1109/tit.2011.2173733openalex-snapshot
On the Construction of Structured LDPC Codes Free of Small Trapping Sets
inferred← citeshttps://doi.org/10.1109/tit.2012.2205663openalex-snapshot
Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2015.2508455openalex-snapshot
New Classes of Partial Geometries and Their Associated LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2613113openalex-snapshot
New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2616900openalex-snapshot
Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations
inferred← citeshttps://doi.org/10.1109/tit.2019.2898224openalex-snapshot
Coupling Data Transmission for Multiple-Access Communications
inferred← citeshttps://doi.org/10.1109/tit.2025.3532625openalex-snapshot
Generalized Regenerating Codes and Node Repair on Graphs
inferred← citeshttps://doi.org/10.1109/tsp.2004.823508openalex-snapshot
Joint $(3, k)$ -Regular LDPC Code and Decoder/Encoder Design
inferred← citeshttps://doi.org/10.1109/tsp.2006.880240openalex-snapshot
A Turbo-Decoding Message-Passing Algorithm for Sparse Parity-Check Matrix Codes
inferred← citeshttps://doi.org/10.1109/turbocoding.2008.4658689openalex-snapshot
A reduced-complexity box-plus decoder for LDPC codes
inferred← citeshttps://doi.org/10.1109/tvt.2007.897215openalex-snapshot
Iterative Channel Estimation, Equalization, and Decoding for Pilot-Symbol Assisted Modulation Over Frequency Selective Fast Fading Channels
inferred← citeshttps://doi.org/10.1109/wnis.2009.95openalex-snapshot
Programmable Graph Architectures (PGAs) for Matrix Multiplications and Transposes
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22437.xopenalex-snapshot
Cubic Graphs with Large Girth
inferred← citeshttps://doi.org/10.1112/jtopol/jtm010openalex-snapshot
Heegaard genus and property τ for hyperbolic 3-manifolds
inferred← citeshttps://doi.org/10.1134/s0032946009040061openalex-snapshot
Graph-based convolutional and block LDPC codes
inferred← citeshttps://doi.org/10.1137/0402034openalex-snapshot
Random Sequential Adsorption on Graphs
inferred← citeshttps://doi.org/10.1137/0404012openalex-snapshot
The Expected Capacity of Concentrators
inferred← citeshttps://doi.org/10.1137/1.9781611976465.110openalex-snapshot
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch90openalex-snapshot
Small subgraphs with large average degree
inferred← citeshttps://doi.org/10.1137/22m1484134openalex-snapshot
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
inferred← citeshttps://doi.org/10.1137/s0895480101387893openalex-snapshot
A High Girth Graph Construction
inferred← citeshttps://doi.org/10.1137/s0895480102403799openalex-snapshot
Error Exponents of Expander Codes under Linear-Complexity Decoding
inferred← citeshttps://doi.org/10.1137/s0895480195292065openalex-snapshot
Optimal Cycle Codes Constructed From Ramanujan Graphs
showing the first 200 of 273 · page through all 273
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.