LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices
LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices
复制标题
DOI：
10.1109/tit.2012.2196253
复制
发表时间：
2010-11
影响因子：
2.5
通讯作者：
T. Wadayama;M. Hagiwara
中科院分区：
文献类型：
--
作者：
T. Wadayama;M. Hagiwara
提出了一组线性约束的置换矩阵，用于构造一类置换码。这种被称为线性规划(LP)可译码的排列码的主要特征是这种LP可译码。证明了所提出的排列码的LP译码性能是由码的码多面体的顶点来表征的。讨论了两类线性约束：一类是结构化约束，另一类是随机约束。结构化约束允许高效的编码算法。另一方面，随机约束使我们能够使用概率方法来分析一些码的性质，例如平均基数和平均重量分布。
A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. The main feature of this class of permutation codes, called linear programming (LP)-decodable permutation codes, is this LP decodability. It is demonstrated that the LP decoding performance of the proposed class of permutation codes is characterized by the vertices of the code polytope of the code. Two types of linear constraints are discussed: one is structured constraints and the other is random constraints. The structured constraints allow an efficient encoding algorithm. On the other hand, the random constraints enable us to use probabilistic methods for analyzing several code properties such as the average cardinality and the average weight distribution.