A Multilevel Construction of Permutation Codes

  • WADAYAMA Tadashi
    the Faculty of Computer Science and System Engineering, Okayama Prefectural University
  • VINCK A. J. Han
    the Institute for Experimental Mathematics, University of Essen

この論文をさがす

説明

A novel multilevel construction for permutation codes is presented. A permutation code of length n is a subset of all the vectors obtained from coordinate permutations on the vector (0, 1, ..., n-1). We would like to construct a permutation code with cardinality as large as possible for a given code length n and a minimum distance. The proposed construction is available when n=2^m (m is a positive integer). We exploit m-constant weight binary codes as component codes and combine them in a multilevel way. Permutation codes with various parameters can be constructed by selecting appropriate combination of component codes. Furthermore, multi-stage decoding is available for decoding the permutation codes constructed by the proposed construction.

収録刊行物

被引用文献 (1)*注記

もっと見る

参考文献 (8)*注記

もっと見る

詳細情報 詳細情報について

  • CRID
    1573105977193324544
  • NII論文ID
    110003208766
  • NII書誌ID
    AA10826239
  • ISSN
    09168508
  • 本文言語コード
    en
  • データソース種別
    • CiNii Articles

問題の指摘

ページトップへ