Explicit constructions of graphs without short cycles and low density codes
From MaRDI portal
Publication:1167742
DOI10.1007/BF02579283zbMath0492.05044OpenAlexW2054649237MaRDI QIDQ1167742
Publication date: 1982
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579283
Extremal problems in graph theory (05C35) Linear codes (general theory) (94B05) Unimodular groups, congruence subgroups (group-theoretic aspects) (20H05) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (66)
On encoding symbol degrees of array BP-XOR codes ⋮ Colouring graphs with forbidden bipartite subgraphs ⋮ Flexibility and movability in Cayley graphs ⋮ Hash functions and Cayley graphs ⋮ On a pursuit game on Cayley graphs ⋮ Cops and robbers in graphs with large girth and Cayley graphs ⋮ Explicit construction of graphs with an arbitrary large girth and of large size ⋮ On a pursuit game on Cayley digraphs ⋮ Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles ⋮ On small world semiplanes with generalised Schubert cells ⋮ Non-commutative methods in additive combinatorics and number theory ⋮ Ramanujan graphs ⋮ Spectral bounds of directed Cayley graphs of finite groups ⋮ Mean-field conditions for percolation on finite graphs ⋮ On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction ⋮ High girth and extendability ⋮ The structure of matroids with a spanning clique or projective geometry ⋮ Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines ⋮ Weak degeneracy of graphs ⋮ A new series of dense graphs of high girth ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ Low-distortion embeddings of graphs with large girth ⋮ Monotonic optimization based decoding for linear codes ⋮ On New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications ⋮ Almost quasi-isometries and more non-C*-exact groups ⋮ Expander graphs and their applications ⋮ Popular products and continued fractions ⋮ The asymptotics of \(r(4,t)\) ⋮ Extremal numbers of hypergraph suspensions of even cycles ⋮ Strong approximation in the Apollonian group ⋮ Small-diameter Cayley graphs for finite simple groups ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ Modular hyperbolas and bilinear forms of Kloosterman sums ⋮ On the key expansion of \(D(n, K)\)-based cryptographical algorithm ⋮ Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography ⋮ Note on the girth of Ramanujan graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Regular graphs of large girth and arbitrary degree ⋮ A connection between a question of Bermond and Bollobás and Ramanujan graphs ⋮ Composition of semi-LTCs by two-wise tensor products ⋮ Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas ⋮ On the girth of infinite graphs ⋮ Triples and hexagons ⋮ Keyed hash function from large girth expander graphs ⋮ Unnamed Item ⋮ Counting problems in Apollonian packings ⋮ Some low-density parity-check codes derived from finite geometries ⋮ The girth alternative for mapping class groups. ⋮ Graph-based convolutional and block LDPC codes ⋮ On the girth of random Cayley graphs ⋮ Heegaard genus and property τ for hyperbolic 3-manifolds ⋮ Small weight codewords in the LDPC codes arising from linear representations of geometries ⋮ On the relation of separability, bandwidth and embedding ⋮ Divergence and quasi-isometry classes of random Gromov’s monsters ⋮ Girth, words and diameter ⋮ Expander graphs in pure and applied mathematics ⋮ Logarithmic girth expander graphs of \(SL_n({\mathbb{F}}_p)\) ⋮ On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree ⋮ Explicit construction of regular graphs without small cycles ⋮ Kissing numbers of regular graphs ⋮ A hierarchy of randomness for graphs ⋮ Moderate-density parity-check codes from projective bundles ⋮ On the spectral gap for infinite index ``congruence subgroups of \(SL_2(\mathbb{Z})\) ⋮ Rényi and Tsallis entropies related to eigenfunctions of quantum graphs ⋮ Turán problems for integer-weighted graphs ⋮ On the spectral gap for infinite index ``congruence subgroups of SL\(_2(\mathbb{Z})\)
Cites Work
This page was built for publication: Explicit constructions of graphs without short cycles and low density codes
