Cover Image

Practical implementation of geometric quasi-cyclic LDPC codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ball, Simeon, Ortega, Tomàs
Format:	Preprint
Published:	2024
Subjects:	Information Theory Discrete Mathematics Combinatorics 68P30, 51E12 H.1.1; E.4; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On regular sets of affine type in finite Desarguesian planes and related codes
by: Aguglia, Angela, et al.
Published: (2023)

Linear codes arising from the point-hyperplane geometry-Part I: the Segre embedding
by: Cardinali, Ilaria, et al.
Published: (2025)

Phase-Only Zero-Forcing for Secure Wireless Communication in Multi-User Systems
by: Hong, Jordan, et al.
Published: (2025)

Multispreads
by: Krotov, Denis S., et al.
Published: (2023)

A novel public key cryptography based on generalized Lucas matrices
by: Prasad, Kalika, et al.
Published: (2022)

Boolean combinations of graphs
by: Adenwalla, Sarosh, et al.
Published: (2024)

The automorphism groups and identification of some Generalized Paley Graphs
by: Ponomarenko, Ilia
Published: (2025)

Scattered trinomials of $\mathbb{F}_{q^6}[X]$ in even characteristic
by: Bartoli, Daniele, et al.
Published: (2023)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)

Community-Aware Vertex Ordering for Reference-Based Graph Compression: A Cross-Encoder Empirical Study
by: Dubuisson, Jimmy
Published: (2026)

Towards a format for describing networks / 1. Networks and knowledge graphs
by: Batagelj, Vladimir, et al.
Published: (2025)

The arc chromatic number for Galois projective planes, affine planes and Euclidean grids
by: Araujo-Pardo, Gabriela, et al.
Published: (2026)

Golden Ratio Growth and Phase Transitions in Chromatic Counts of Circular Chord Graphs
by: Lopez-Bonilla, Rogelio N., et al.
Published: (2025)

Generalized compression and compressive search of large datasets
by: Prior, Morgan E., et al.
Published: (2024)

On additive MDS codes with linear projections
by: Adriaensen, Sam, et al.
Published: (2022)

Isogeny Graphs in Superposition and Quantum Onion Routing
by: Agathocleous, Eleni, et al.
Published: (2025)

Kolmogorov complexity as a combinatorial tool
by: Shen, Alexander
Published: (2024)

Error-Correcting Graph Codes
by: Kopparty, Swastik, et al.
Published: (2024)

The Combinatorial Rank of Subsets: Metric Density in Finite Hamming Spaces
by: Abdurakhmanov, Jamolidin K.
Published: (2025)

About almost covering subsets of the hypercube
by: Ghosh, Arijit, et al.
Published: (2024)

Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms
by: Hintze, Lukas, et al.
Published: (2024)

Noisy group testing via spatial coupling
by: Coja-Oghlan, Amin, et al.
Published: (2024)

Algorithmic Barriers to Detecting and Repairing Structural Overspecification in Adaptive Data-Structure Selection
by: Alpay, Faruk, et al.
Published: (2026)

Quantum error-correcting codes and their geometries
by: Ball, Simeon, et al.
Published: (2020)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
by: Sølvsten, Steffan Christ, et al.
Published: (2023)

Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
by: Abdukhalikov, Kanat, et al.
Published: (2008)

Intersection problems for linear codes and polynomials over finite fields
by: Adriaensen, Sam
Published: (2025)

Classification via Two-Way Comparisons
by: Chrobak, Marek, et al.
Published: (2023)

Towards a format for describing networks / 2. Format elements
by: Batagelj, Vladimir, et al.
Published: (2025)

An Algebraic Rigidity Framework for Order-Oblivious Deterministic Black-Box PIT of ROABPs
by: Singh, Shalender, et al.
Published: (2026)

Barbara Rokowska's combinatorial research with her extensive biography (1926--2012)
by: Szajowski, Krzysztof J.
Published: (2025)

The Interplay of Attention and Memory in Visual Enumeration
by: Sankar, B., et al.
Published: (2025)

Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)

Average Case Analysis of Leaf-Centric Binary Tree Sources
by: Benkner, Louisa Seelbach, et al.
Published: (2018)

Ramsey numbers and extremal structures in polar spaces
by: Bamberg, John, et al.
Published: (2024)

Metric Dimension and Resolvability of Jaccard Spaces
by: Lladser, Manuel E., et al.
Published: (2024)

Generalizing the Bierbrauer-Friedman bound for orthogonal arrays
by: Krotov, Denis S., et al.
Published: (2024)