用于逐坐标权函数的 MWS 码与 FWS 码
MWS and FWS Codes for Coordinate-Wise Weight Functions
AI总结:
本文将 MWS/FWS 码理论从 Hamming 权推广到逐坐标权函数,给出一般存在长度界,并完全确定 Lee 与 Manhattan 情形下 FWS 参数及 Manhattan MWS 参数。
摘要:
最近,人们提出了一个组合问题,涉及 [n,k]_q 线性码的(Hamming)权集合的最大大小。达到已建立上界的码称为最大权谱(Maximum Weight Spectrum,MWS)码。那些与 F_q^n 具有相同权集合的 [n,k]_q 码称为全权谱(Full Weight Spectrum,FWS)码。FWS 码必然是“短”码,而 MWS 码必然是“长”码。对于固定的 k、q,存在 [n,k]_q-FWS 码的 n 值已被完全确定,但确定 [n,k]_q-MWS 码的最小长度 M(H,k,q) 仍是一个开放问题。当前工作首先将讨论扩展到一般的逐坐标权函数,随后具体考察 Lee 权和一种类 Manhattan 权。在一般情形下,我们给出了存在 FWS 码的 n 的界,以及存在 MWS 码的 n 的界。当专门讨论 Lee 或 Manhattan 情形时,我们能够完全确定 FWS 码的参数。与 Hamming 情形一样,我们能够给出 M(L,k,q)(Lee MWS 码的最小长度)的一个上界,并将确定 M(L,k,q) 提为一个开放问题。另一方面,关于 Manhattan 权,我们完全确定了 MWS 码的参数。
英文摘要:
A combinatorial problem concerning the maximum size of the (hamming) weight set of an $[n,k]_q$ linear code was recently introduced. Codes attaining the established upper bound are the Maximum Weight Spectrum (MWS) codes. Those $[n,k]_q $ codes with the same weight set as $ \mathbb{F}_q^n $ are called Full Weight Spectrum (FWS) codes. FWS codes are necessarily ``short", whereas MWS codes are necessarily ``long". For fixed $ k,q $ the values of $ n $ for which an $ [n,k]_q $-FWS code exists are completely determined, but the determination of the minimum length $ M(H,k,q) $ of an $ [n,k]_q $-MWS code remains an open problem. The current work broadens discussion first to general coordinate-wise weight functions, and then specifically to the Lee weight and a Manhattan like weight. In the general case we provide bounds on $ n $ for which an FWS code exists, and bounds on $ n $ for which an MWS code exists. When specializing to the Lee or to the Manhattan setting we are able to completely determine the parameters of FWS codes. As with the Hamming case, we are able to provide an upper bound on $ M(\mathcal{L},k,q) $ (the minimum length of Lee MWS codes), and pose the determination of $ M(\mathcal{L},k,q) $ as an open problem. On the other hand, with respect to the Manhattan weight we completely determine the parameters of MWS codes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。