On a two-dimensional antidictionary construction using suffix tries

Ota, Tetsuji; Morita, Hiroyuki

doi:10.1109/isit.2015.7283002

Search citation statements

Order By: Relevance

Paper Sections

Select...

How To Generate Blocks From G(s) a Preliminaries For G(s)1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

Publication Types

Select...

Other1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, the proposed graph representation can be easily extended to three or higher dimensional forbidden set by adding a labelled directed graph such as G r (S) for an adding axis. As a future work, we hope to apply the the proposed graph for further analysis in two-dimensional case, such as a 2D antidictionary coding which utilizes a subset of 2D antidictionary [6], [7] and the computation of the capacities of 2D-FTCSs.…”

Section: How To Generate Blocks From G(s) a Preliminaries For G(s)mentioning

confidence: 99%

A Graph Representation for Two-Dimensional Finite Type Constrained Systems

Ota,

Manada,

Morita

2016

Preprint

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: How To Generate Blocks From G(s) a Preliminaries For G(s)mentioning

confidence: 99%