### A Graph Representation for Two-Dimensional Finite Type Constrained Systems

**2016-02-01**

1602.00446 | cs.IT

The demand of two-dimensional source coding and constrained coding has been
getting higher these days, but compared to the one-dimensional case, many
problems have remained open as the analysis is cumbersome. A main reason for
that would be because there are no graph representations discovered so far. In
this paper, we focus on a two-dimensional finite type constrained system, a set
of two-dimensional blocks characterized by a finite number of two-dimensional
constraints, and propose its graph representation. We then show how to generate
an element of the two-dimensional finite type constrained system from the graph
representation.

**Login to like/save this paper, take notes and configure your recommendations**

# Related Articles

**2019-04-04**

1904.02581 | cs.DM

Supergrid graphs contain grid graphs and triangular grid graphs as their
subgraphs. The Hamiltonian … show more

**2018-06-30**

1807.00109 | math.CO

The parity of the length of paths and cycles is a classical and well-studied
topic in graph theory a… show more

**2019-05-11**

1905.04490 | cs.DM

An edge switch is an operation which makes a local change in a graph while
maintaining the degree of… show more

**2019-03-31**

1904.00402 | cs.DM

A graph puzzle ${\rm Puz}(G)$ of a graph $G$ is defined as follows. A
configuration of ${\rm Puz}(G)… show more

**2019-05-07**

1905.02633 | cs.DM

The Wiener index (the distance) of a connected graph is the sum of distances
between all pairs of ve… show more

**2018-11-16**

1811.06898 | cs.CG

We show how to construct $(1+\varepsilon)$-spanner over a set $P$ of $n$
points in $\mathbb{R}^d$ th… show more

**2018-08-27**

1808.09063 | cs.CG

A drawing of a graph is greedy if for each ordered pair of vertices u and v,
there is a path from u … show more

**2018-12-07**

1812.03195 | cs.DM

We show that a simple Markov chain, the Glauber dynamics, can efficiently
sample independent sets al… show more

**2018-12-05**

1812.01911 | math.CO

A $(a,b)$-coloring of a graph $G$ associates to each vertex a set of $b$
colors from a set of $a$ co… show more

**2018-12-19**

1812.08022 | cs.DM

A coloration w of Z^2 is said to be coverable if there exists a rectangular
block q such that w is c… show more

**2017-04-22**

1704.06757 | cs.DS

It has long been known that Feedback Vertex Set can be solved in time
$2^{\mathcal{O}(w\log w)}n^{\m… show more

**2017-02-20**

1702.06163 | cs.CG

Edge bundling is an important concept heavily used for graph visualization
purposes. To enable the c… show more

**2019-03-05**

1903.01805 | cs.CG

In this paper we continue the systematic study of Contact graphs of Paths on
a Grid (CPG graphs) ini… show more

**2018-12-04**

1812.01637 | cs.NI

We study a few problems in Boolean Network Tomography, related to maximal
vertex identifiability, i.… show more

**2017-10-12**

1710.04640 | cs.CC

In this work we study tilings of regions in the square lattice with L-shaped
trominoes. Deciding the… show more

**2018-07-11**

1807.04208 | cs.DM

Let $G$ be a digraph and $r(G)$ be its rank. Many interesting results on the
rank of an undirected g… show more