Image de couverture de livre

Error-Correcting Graph Codes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kopparty, Swastik, Potukuchi, Aditya, Sha, Harry
Format:	Preprint
Publié:	2024
Sujets:	Information Theory Discrete Mathematics Combinatorics G.2.1; E.4
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Small Shadow Partitions
par: Kopparty, Swastik, et autres
Publié: (2024)

Dyck Paths Enumerated by the Q-bonacci Numbers
par: Barcucci, Elena, et autres
Publié: (2024)

A Bijection between Stacked Directed Polyominoes and Motzkin Paths with Alternative Catastrophes
par: Schager, Florian, et autres
Publié: (2024)

The Converse of the Real Orthogonal Holant Theorem
par: Young, Ben
Publié: (2024)

On The Roots of Independence Polynomial: Quantifying The Gap
par: Prakash, Om, et autres
Publié: (2025)

Binary Words Containing Few Abelian Squares
par: Fazekas, Szilard Zsolt, et autres
Publié: (2026)

Bounds on Unique-Neighbor Codes
par: Linial, Nati, et autres
Publié: (2022)

Breaking the Symmetries of Amenable Graphs
par: Cheng, Christine T.
Publié: (2025)

Practical implementation of geometric quasi-cyclic LDPC codes
par: Ball, Simeon, et autres
Publié: (2024)

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
par: Kopparty, Swastik, et autres
Publié: (2023)

Pattern Avoidance for Fibonacci Sequences using $k$-Regular Words
par: Downing, Emily, et autres
Publié: (2023)

New Results on Edge-coloring and Total-coloring of Split Graphs
par: Couto, Fernanda, et autres
Publié: (2023)

Extending Wormald's Differential Equation Method to One-sided Bounds
par: Bennett, Patrick, et autres
Publié: (2023)

An Improved Lower Bound on the Number of Pseudoline Arrangements
par: Kühnast, Fernando Cortés, et autres
Publié: (2024)

Erdős Matching (Conjecture) Theorem
par: Mishra, Tapas Kumar
Publié: (2026)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
par: Shota, Kan, et autres
Publié: (2024)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
par: Adamson, Duncan, et autres
Publié: (2023)

A simple algorithm for checking equivalence of counting functions on free monoids
par: Kiyashko, Petr, et autres
Publié: (2024)

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
par: Baruchel, Thomas
Publié: (2025)

Multivariate Analytic Combinatorics for Cost Constrained Channels
par: Lenz, Andreas, et autres
Publié: (2021)

Constructions, bounds, and algorithms for peaceable queens
par: Clinch, Katie, et autres
Publié: (2024)

Fibonacci and Lucas Sequences in Aperiodic Monotile Supertiles
par: Dong, Shiying
Publié: (2024)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
par: Streit, Robert P., et autres
Publié: (2024)

Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete
par: Koepke, Finn Orson
Publié: (2025)

The Hierarchy of Saturating Matching Numbers
par: Simon, Hans U., et autres
Publié: (2025)

Almost optimum $\ell$-covering of $\mathbb{Z}_n$
par: Shi, Ke, et autres
Publié: (2022)

Locked Polyomino Tilings
par: Tucker-Foltz, Jamie
Publié: (2023)

WELLDOC property for words generated by morphisms
par: Puzynina, Svetlana, et autres
Publié: (2026)

Finding codes on infinite grids automatically
par: Salo, Ville, et autres
Publié: (2023)

On the Metric Dimension of $K_a \times K_b \times K_c$
par: Gledel, Valentin, et autres
Publié: (2024)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
par: Bom, David, et autres
Publié: (2025)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
par: Cavallaro, Dario, et autres
Publié: (2026)

Optimal Erasure Codes and Codes on Graphs
par: Chen, Yeyuan, et autres
Publié: (2025)

Optimal covering of rectangular grid graphs with tours of constrained length
par: Bereg, Sergey, et autres
Publié: (2025)

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

Enumerating moves in the optimal solution of the Tower of Hanoi
par: Belbachir, Hacène, et autres
Publié: (2022)

Some Results on Digital Segments and Balanced Words
par: De Luca, Alessandro, et autres
Publié: (2022)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
par: Wang, Shuche, et autres
Publié: (2024)

Morphic Sequences: Complexity and Decidability
par: Henry, Raphael
Publié: (2024)

Robot Positioning Using Torus Packing for Multisets
par: Chen, Chung Shue, et autres
Publié: (2024)