A Multilevel Construction of Permutation Codes(Special Section on Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2001-10-01

著者

• Vinck A.j.

  The Institute For Experimental Mathematics University Of Essen

• Wadayama Tadashi

  The Faculty Of Computer Science And System Engineering Okayama Perfectural University

関連論文

• An Upper Bound on Bit Error Rate for Concatenated Convolutional Code
• Matched Design Method for Concatenated Trellis-Coded Modulation
• A Multilevel Construction of Permutation Codes(Special Section on Information Theory and Its Applications)
• A Coded Modulation Scheme Based on Low Density Parity Check Codes(Special Section on Information Theory and Its Applications)
• An Iterative Decoding Algorithm for Channels with Additive Linear Dynamical Noise(Coding Theory)(Information Theory and Its Applications)

スポンサーリンク