A Lower Bound on the Number of Parity-Check Bits of Multiple-Cluster-Error Correcting Two-Dimensional Linear Codes

IR Web Site

Bibliographic Information

Other Title
  • 多重クラスタ誤り訂正2次元線形符号が有する検査点数の下界
  • タジュウ クラスタ アヤマリ テイセイ 2ジゲン センケイ フゴウ ガ ユウスル ケンサ テンスウ ノ ゲカイ

Search this article

Description

P(論文)

Recently, two-dimensional or three-dimensional error correction coding schemes have been widely studied in the context of optical recording applications such as page-oriented optical memories and volume holographic storage. Our main interest is to propose an efficient family of two-dimensional linear codes which can correct multiple cluster-errors. Before giving a code construction method, it is very important to know the number of parity-check bits required for such codes. In this article, a new lower bound is derived on the number of parity-check bits of two-dimensional linear codes capable of correcting multiple cluster-errors.

Journal

Keywords

Details 詳細情報について

Report a problem

Back to top