Subgraph domatic problem and writing capacity of memory devices with restricted state transitions

Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

A code design problem for memory devices with restricted state transitions is formulated as a combinatorial optimization problem that is called a subgraph domatic partition (subDP) problem. If any neighbor set of a given state transition graph contains all the colors, then the coloring is said to be valid. The goal of a subDP problem is to find the valid coloring that has the largest number of colors for a subgraph of a given directed graph. The number of colors in an optimal valid coloring indicates the writing capacity of that state transition graph. The subDP problems are computationally hard; it is proved to be NP-complete in this paper. One of our main contributions in this paper is to show the asymptotic behavior of the writing capacity C(G) for sequences of dense bidirectional graphs; this is given by C(G) = Ω(n/ ln n), where n is the number of nodes. A probabilistic method, Lovász local lemma (LLL), plays an essential role in deriving the asymptotic expression.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1307-1311
Number of pages5
ISBN (Electronic)9781467377041
DOIs
Publication statusPublished - Sep 28 2015
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: Jun 14 2015Jun 19 2015

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2015-June
ISSN (Print)2157-8095

Other

OtherIEEE International Symposium on Information Theory, ISIT 2015
CountryHong Kong
CityHong Kong
Period6/14/156/19/15

Fingerprint

State Transition
Coloring
Subgraph
Color
Colouring
Data storage equipment
Partition
Valid
Graph in graph theory
Directed graphs
Combinatorial optimization
Probabilistic Methods
Combinatorial Optimization Problem
Directed Graph
Lemma
NP-complete problem
Asymptotic Behavior
Vertex of a graph

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Wadayama, T., Izumi, T., & Ono, H. (2015). Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (pp. 1307-1311). [7282667] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7282667

Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. / Wadayama, Tadashi; Izumi, Taisuke; Ono, Hirotaka.

Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 1307-1311 7282667 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wadayama, T, Izumi, T & Ono, H 2015, Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015., 7282667, IEEE International Symposium on Information Theory - Proceedings, vol. 2015-June, Institute of Electrical and Electronics Engineers Inc., pp. 1307-1311, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 6/14/15. https://doi.org/10.1109/ISIT.2015.7282667
Wadayama T, Izumi T, Ono H. Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 1307-1311. 7282667. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2015.7282667
Wadayama, Tadashi ; Izumi, Taisuke ; Ono, Hirotaka. / Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 1307-1311 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{b9d706709c5c48758dd79d461a0c810a,
title = "Subgraph domatic problem and writing capacity of memory devices with restricted state transitions",
abstract = "A code design problem for memory devices with restricted state transitions is formulated as a combinatorial optimization problem that is called a subgraph domatic partition (subDP) problem. If any neighbor set of a given state transition graph contains all the colors, then the coloring is said to be valid. The goal of a subDP problem is to find the valid coloring that has the largest number of colors for a subgraph of a given directed graph. The number of colors in an optimal valid coloring indicates the writing capacity of that state transition graph. The subDP problems are computationally hard; it is proved to be NP-complete in this paper. One of our main contributions in this paper is to show the asymptotic behavior of the writing capacity C(G) for sequences of dense bidirectional graphs; this is given by C(G) = Ω(n/ ln n), where n is the number of nodes. A probabilistic method, Lov{\'a}sz local lemma (LLL), plays an essential role in deriving the asymptotic expression.",
author = "Tadashi Wadayama and Taisuke Izumi and Hirotaka Ono",
year = "2015",
month = "9",
day = "28",
doi = "10.1109/ISIT.2015.7282667",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1307--1311",
booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",
address = "United States",

}

TY - GEN

T1 - Subgraph domatic problem and writing capacity of memory devices with restricted state transitions

AU - Wadayama, Tadashi

AU - Izumi, Taisuke

AU - Ono, Hirotaka

PY - 2015/9/28

Y1 - 2015/9/28

N2 - A code design problem for memory devices with restricted state transitions is formulated as a combinatorial optimization problem that is called a subgraph domatic partition (subDP) problem. If any neighbor set of a given state transition graph contains all the colors, then the coloring is said to be valid. The goal of a subDP problem is to find the valid coloring that has the largest number of colors for a subgraph of a given directed graph. The number of colors in an optimal valid coloring indicates the writing capacity of that state transition graph. The subDP problems are computationally hard; it is proved to be NP-complete in this paper. One of our main contributions in this paper is to show the asymptotic behavior of the writing capacity C(G) for sequences of dense bidirectional graphs; this is given by C(G) = Ω(n/ ln n), where n is the number of nodes. A probabilistic method, Lovász local lemma (LLL), plays an essential role in deriving the asymptotic expression.

AB - A code design problem for memory devices with restricted state transitions is formulated as a combinatorial optimization problem that is called a subgraph domatic partition (subDP) problem. If any neighbor set of a given state transition graph contains all the colors, then the coloring is said to be valid. The goal of a subDP problem is to find the valid coloring that has the largest number of colors for a subgraph of a given directed graph. The number of colors in an optimal valid coloring indicates the writing capacity of that state transition graph. The subDP problems are computationally hard; it is proved to be NP-complete in this paper. One of our main contributions in this paper is to show the asymptotic behavior of the writing capacity C(G) for sequences of dense bidirectional graphs; this is given by C(G) = Ω(n/ ln n), where n is the number of nodes. A probabilistic method, Lovász local lemma (LLL), plays an essential role in deriving the asymptotic expression.

UR - http://www.scopus.com/inward/record.url?scp=84969760084&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84969760084&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2015.7282667

DO - 10.1109/ISIT.2015.7282667

M3 - Conference contribution

AN - SCOPUS:84969760084

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1307

EP - 1311

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -