Presentation 2000/7/21
Lower Bound of Capacity of Two-Dimensional (d, k) RunLength-Limited Sequence
Motohiro Mizuno, Hiroshi Kamabe,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Two-Dimensional recording codes are now investigated in order to attain the high recording density. In this draft we give several lower bounds on 2-Dimensional (d, k) RunLength-Limited sequence by a simple enumeration technique.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) two-dimensional recording code / (d, k) runlength-limited sequence / capacity
Paper # IT2000-26
Date of Issue

Conference Information
Committee IT
Conference Date 2000/7/21(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 Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Lower Bound of Capacity of Two-Dimensional (d, k) RunLength-Limited Sequence
Sub Title (in English)
Keyword(1) two-dimensional recording code
Keyword(2) (d, k) runlength-limited sequence
Keyword(3) capacity
1st Author's Name Motohiro Mizuno
1st Author's Affiliation Department of Information Science Faculty of Engineering, Gifu University()
2nd Author's Name Hiroshi Kamabe
2nd Author's Affiliation Department of Information Science Faculty of Engineering, Gifu University
Date 2000/7/21
Paper # IT2000-26
Volume (vol) vol.100
Number (no) 241
Page pp.pp.-
#Pages 6
Date of Issue