k<d特性を有する二次元符号の構成  [in Japanese] Construction of a Two-Dimensional Code with k<d Property  [in Japanese]

Search this Article

Author(s)

Abstract

2値の一次元符号では決して実現し得ない二次元符号の一つの特徴は, k<dを持つ符号が構成できることである.本稿では, Marcellin-Weberの手法に基づき,トラック数 L=2, k(=k_y)=1, d=2 と与えた場合の具体的な二次元符号を構成し,これを状態推移図で表現した.また,同一の d, k_y 制約条件のもとで L を変え,2値符号でもデータ語長 m に対する符号長 n が n<m となる二次元符号が存在し得ることを示した.

One of the major merits that binary two-dimensional codes have over the binary one dimensional codes is the achievement of the property k < d. In this paper, we constructed a practical two-dimensional code based on the Marcellin-Weber's method and derived its state transition diagram. The constraints used in the construction are such that, the track numbers L = 2, k(= k_y) = 1, and d = 2. Additionally, under the same constraints d and k_y, we clearly showed that when L is increased, the property n<m could be realized. Here, m and n are the dataword length and codeword length, respectively.

Journal

  • IEICE technical report. Magnetic recording

    IEICE technical report. Magnetic recording 96(418), 9-14, 1996-12-13

    The Institute of Electronics, Information and Communication Engineers

References:  4

Cited by:  3

Codes

  • NII Article ID (NAID)
    110003186036
  • NII NACSIS-CAT ID (NCID)
    AN10013050
  • Text Lang
    JPN
  • Article Type
    Journal Article
  • Data Source
    CJP  CJPref  NII-ELS 
Page Top