The search functionality is under construction.

The search functionality is under construction.

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.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.10 pp.2518-2522

- Publication Date
- 2001/10/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- Special Section LETTER (Special Section on Information Theory and Its Applications)

- Category
- Coding Theory

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Tadashi WADAYAMA, A. J. Han VINCK, "A Multilevel Construction of Permutation Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 10, pp. 2518-2522, October 2001, doi: .

Abstract: 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.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_10_2518/_p

Copy

@ARTICLE{e84-a_10_2518,

author={Tadashi WADAYAMA, A. J. Han VINCK, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={A Multilevel Construction of Permutation Codes},

year={2001},

volume={E84-A},

number={10},

pages={2518-2522},

abstract={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.},

keywords={},

doi={},

ISSN={},

month={October},}

Copy

TY - JOUR

TI - A Multilevel Construction of Permutation Codes

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 2518

EP - 2522

AU - Tadashi WADAYAMA

AU - A. J. Han VINCK

PY - 2001

DO -

JO - IEICE TRANSACTIONS on Fundamentals

SN -

VL - E84-A

IS - 10

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - October 2001

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

ER -