Related papers: Linear Codes from Incidence Matrices of Unit Graph…
Recall that a binary linear code of length $n$ is a linear subspace $\mathcal{C} = \{x\in\mathbb{F}_2^n\mid Ax=0\}$. Here the parity check matrix $A$ is a binary $m\times n$ matrix of rank $m$. We say that $\mathcal{C}$ has rate $R=1-\frac…
Let $m>1$ be an integer, and let $I(\mathbb{Z}_m)^*$ be the set of all non-zero proper ideals of $\mathbb{Z}_m$. The intersection graph of ideals of $\mathbb{Z}_m$, denoted by $G(\mathbb{Z}_m)$, is a graph with vertices $I(\mathbb{Z}_m)^*$…
Partitions of the binary linear Hamming code into Preparata-like codes are known to induce line-parallelisms of PG$(n, 2)$. In this paper, we show that if $P$ is any Preparata-like code contained in the binary linear Hamming code $H$ of the…
Let $m, n > 1$ be two integers, and $\mathbb{Z}_n$ be a $\mathbb{Z}_m$-module. Let $I(\mathbb{Z}_m)^*$ be the set of all non- zero proper ideals of $\mathbb{Z}_m$. The $\mathbb{Z}_n$-intersection graph of $\mathbb{Z}_m$, denoted by…
Dual multiplicity graphs are those simple, undirected graphs that have a weighted Hermitian adjacency matrix with only two distinct eigenvalues. From the point of view of frame theory, their characterization can be restated as which graphs…
Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…
Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated $q$-system. Using this result, we…
We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of…
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed…
Graph code is a linear code obtained from linear codes $C$ and a certain bipartite graph G. In this paper, I propose an expansion of the definition of graph code to general $l$-partite, and give its lower bound of minimum distance. I also…
A set of edges $\Gamma$ of a graph $G$ is an edge dominating set if every edge of $G$ intersects at least one edge of $\Gamma$, and the edge domination number $\gamma_e(G)$ is the smallest size of an edge dominating set. Expanding on work…
A vertex subset $W\subseteq V$ of the graph $G = (V,E)$ is an independent dominating set if every vertex in $V\setminus W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. We enumerate independent…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
Low-density parity-check (LDPC) codes have been the subject of much interest due to the fact that they can perform near the Shannon limit. In this paper we present a construction of LDPC codes from cubic symmetric graphs. The constructed…
It is now well known that the performance of a linear code $C$ under iterative decoding on a binary erasure channel (and other channels) is determined by the size of the smallest stopping set in the Tanner graph for $C$. Several recent…
We study graphs that are formed by independently-positioned needles (i.e., line segments) in the unit square. To mathematically characterize the graph structure, we derive the probability that two line segments intersect and determine…
In this paper we define critical graphs as minimal graphs that support a given set of rates for the index coding problem, and study them for both the one-shot and asymptotic setups. For the case of equal rates, we find the critical graph…
Over the past twenty years, rectangle visibility graphs have generated considerable interest, in part due to their applicability to VLSI chip design. Here we study unit rectangle visibility graphs, with fixed dimension restrictions more…
We present a powerful new loss function and training scheme for learning binary hash codes with any differentiable model and similarity function. Our loss function improves over prior methods by using log likelihood loss on top of an…
Let A be the incidence matrix of passant lines and internal points with respect to a conic in PG(2, q), where q is an odd prime power. In this article, we study both geometric and algebraic properties of the column null space L of A over…