MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

HADIAN DEH KORDI M.; CHERAGHI ABAS

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2008 | Volume:19 | Issue:1-2 Page(s): 13-16

Download Full-Text

View:

295

Download:

159

Cites:

Information Journal Paper

Title

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Author(s)

HADIAN DEH KORDI M. | CHERAGHI ABAS | Issue Writer Certificate

Keywords

SHARING SCHEMES

VISUAL CRYPTOGRAPHY

GRAPH ACCESS STRUCTURE

Abstract

A VISUAL CRYPTOGRAPHY scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was applied to propose a lower bound on the pixel expansion of VISUAL CRYPTOGRAPHY schemes with GRAPH ACCESS STRUCTURE G (G). In addition a lower bound on the pixel expansion of basis matrices C5 and Peterson GRAPH ACCESS STRUCTURE were presented.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

HADIAN DEH KORDI, M., & CHERAGHI, ABAS. (2008). MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE. INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE (ENGLISH), 19(1-2), 13-16. SID. https://sid.ir/paper/554385/en

Vancouver: Copy

HADIAN DEH KORDI M., CHERAGHI ABAS. MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE. INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE (ENGLISH)[Internet]. 2008;19(1-2):13-16. Available from: https://sid.ir/paper/554385/en

IEEE: Copy

M. HADIAN DEH KORDI, and ABAS CHERAGHI, “MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE,” INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE (ENGLISH), vol. 19, no. 1-2, pp. 13–16, 2008, [Online]. Available: https://sid.ir/paper/554385/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops