Presentation 2014-03-10
ランク変調と順列集合の支配集合による分割の分類
Yusuke TAKAHASHI, Hiroshi KAMABE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A coing scheme using a rank modulation was proposed for storing data in flash memories. There are two fundamental operation for changing the state of cells, called a push to the top and a minimal push up. A construction of a code with the minimal push up operation strongly depends on a partition of the set of all permulations in dominat sets of a trasision graph induced by the minimal push up operation. In this paper, a necessary and sufficient condition is proposed for a dominant set to meet a lower bound on the number of elements in the dominant set with equality when the length of the erase block is 4. All possible partitions by dominant sets are identified using the condition. Then the partitions are classified into some equivalent classes.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Rank Modulation / Compressed Encoding / Flash Memory
Paper # IT2013-56,ISEC2013-85,WBS2013-45
Date of Issue

Conference Information
Committee ISEC
Conference Date 2014/3/3(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English)
Sub Title (in English)
Keyword(1) Rank Modulation
Keyword(2) Compressed Encoding
Keyword(3) Flash Memory
1st Author's Name Yusuke TAKAHASHI
1st Author's Affiliation Information Science Division, Graduate School of Engineering, Gifu University()
2nd Author's Name Hiroshi KAMABE
2nd Author's Affiliation Information Science Division, Graduate School of Engineering, Gifu University
Date 2014-03-10
Paper # IT2013-56,ISEC2013-85,WBS2013-45
Volume (vol) vol.113
Number (no) 484
Page pp.pp.-
#Pages 6
Date of Issue