書誌事項
- タイトル別名
-
- A Lower Bound on the Number of Parity-Check Bits of Multiple-Cluster-Error Correcting Two-Dimensional Linear Codes
- タジュウ クラスタ アヤマリ テイセイ 2ジゲン センケイ フゴウ ガ ユウスル ケンサ テンスウ ノ ゲカイ
この論文をさがす
説明
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.
収録刊行物
-
- 大阪産業大学論集. 自然科学編
-
大阪産業大学論集. 自然科学編 120 33-49, 2008-06
大東 : 大阪産業大学学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1050001337446012800
-
- NII論文ID
- 110007040656
-
- NII書誌ID
- AN0002870X
-
- ISSN
- 02871394
-
- NDL書誌ID
- 9650841
-
- 本文言語コード
- ja
-
- 資料種別
- departmental bulletin paper
-
- データソース種別
-
- IRDB
- NDL
- CiNii Articles