Maximum distance separable poset codes期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

Maximum distance separable poset codes

Authors:	Jong Yoon Hyun Hyun Kwang Kim

Institution:	(1) Department of Mathematics, Pohang University of Science and Technology, Pohang, 790–784, The Republic of Korea

Abstract:	We derive the Singleton bound for poset codes and define the MDS poset codes as linear codes which attain the Singleton bound. In this paper, we study the basic properties of MDS poset codes. First, we introduce the concept of I-perfect codes and describe the MDS poset codes in terms of I-perfect codes. Next, we study the weight distribution of an MDS poset code and show that the weight distribution of an MDS poset code is completely determined. Finally, we prove the duality theorem which states that a linear code C is an MDS ${\mathbb{P}}$ -code if and only if ${C^\perp}$ is an MDS ${\widetilde{\mathbb{P}}}$ -code, where ${C^\perp}$ is the dual code of C and ${\widetilde{\mathbb{P}}}$ is the dual poset of ${\mathbb{P}.}$

Keywords:	Maximum distance separable code Poset code Discrete Poisson summation formula Moebius inversion formula
本文献已被 SpringerLink 等数据库收录！