相关论文: Zig-zag and Replacement Product Graphs and LDPC Co…
We construct constant-sized ensembles of linear error-correcting codes over any fixed alphabet that can correct a given fraction of adversarial erasures at rates approaching the Singleton bound arbitrarily closely. We provide several…
A new class of codes, Extended Product (EPC) Codes, consisting of a product code with a number of extra parities added, is presented and applications for erasure decoding are discussed. An upper bound on the minimum distance of EPC codes is…
We introduce a technique for establishing and amplifying gaps between parameters of network coding and index coding. The technique uses linear programs to establish separations between combinatorial and coding-theoretic parameters and…
This work develops \emph{mixup for graph data}. Mixup has shown superiority in improving the generalization and robustness of neural networks by interpolating features and labels between two random samples. Traditionally, Mixup can work on…
A set-pair Lov\'asz extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems.
Functional dependence graph (FDG) is an important class of directed graph that captures the dominance relationship among a set of variables. FDG is frequently used in calculating network coding capacity bounds. However, the order of FDG is…
Cyclically ordered graphs, or cogs, sit between abstract graphs and cellularly embedded graphs. They arise naturally in topological graph theory, knot theory, and mathematical biology. We develop a formal theory of cogs and establish a…
Biregular bipartite graphs have been proven to have similar edge distributions to random bipartite graphs and thus have nice pseudorandomness and expansion properties. Thus it is quite desirable to find a biregular bipartite spanning…
We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges…
Due to their capacity approaching performance low-density parity-check (LDPC) codes gained a lot of attention in the last years. The parity-check matrix of the codes can be associated with a bipartite graph, called Tanner graph. To decrease…
In this paper, we investigate arithmetical structures on Cartesian product graphs, particularly, ladder graph of the form P2\square Pm and grid graph of the form Pn \square Pm. An arithmetical structure on a finite and connected graph G is…
This note is a continuation of an earlier paper by the authors. We describe improved constructions addressing a question of Erd\H{o}s and Szemer\'edi on sums and products of real numbers along the edges of a graph. We also add a few…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
We present a new explicit construction of onesided bipartite lossless expanders of constant degree, with arbitrary constant ratio between the sizes of the two vertex sets. Our construction is simpler to state and analyze than the only prior…
We investigate when the independence complex of $G[H]$, the lexicographical product of two graphs $G$ and $H$, is either vertex decomposable or shellable. As an application, we construct an infinite family of graphs with the property that…
In recent years, linear complementary pairs (LCP) of codes and linear complementary dual (LCD) codes have gained significant attention due to their applications in coding theory and cryptography. In this work, we construct explicit LCPs of…
We study finite-field extensions that preserve the same support as the parity-check matrices defining a given binary CSS code. Here, an LDPC-CSS code refers to a CSS code whose parity-check matrices are orthogonal in the sense that each…
One of the simplest way of combining codes to form new codes is to take their direct product. Direct product of cyclic codes and various generalizations have been studied for many years. In this note, we survey cyclic product codes, direct…
Product codes (PCs) protect a two-dimensional array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the…
We construct a new class of directed and bipartite random graphs whose topology is governed by the analytic properties of L-functions. The bipartite L-graphs and the multiplicative zeta graphs are relevant examples of the proposed…