首页/论文/2003.00483

arXiv 2003.004832020-03cs.ITmath.IT

Optimal codes with small constant weight in $\ell_1$-metric

Tingting Chen, Yiming Ma, Xiande Zhang

英文摘要：

Motivated by the duplication-correcting problem for data storage in live DNA, we study the construction of constant-weight codes in $\ell_1$-metric. By using packings and group divisible designs in combinatorial design theory, we give constructions of optimal codes over non-negative integers and optimal ternary codes with $\ell_1$-weight $w\leq 4$ for all possible distances. In general, we derive the size of the largest ternary code with constant weight $w$ and distance $2w-2$ for sufficiently large length $n$ satisfying $n\equiv 1,w,-w+2,-2w+3\pmod{w(w-1)}$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A simple construction of cover-free $(s,\ell)$-code with certain constant weight

We give a method of constructing a cover-free $(s, \ell)$-code. For $k > s$, our construction yields a $ {{n \choose s} \choose \ell}\times {n \choose k}$ cover-free $(s, \ell)$-code with a constant column weight.

2016-05-22cs.ITmath.IT

循环码和椭圆曲线的重量分布

The Weight Distributions of Cyclic Codes and Elliptic Curves

双零循环码及其对偶码作为一类理论上和实际上都很有意义的线性码，已经被研究了很多年。然而，循环码的重量分布很难确定。本文从椭圆曲线出发，进一步确定了具有两个零点的循环码的对偶码的重量分布。

2011-09-03cs.ITmath.IT

MacWilliams type identities on the Lee and Euclidean weights for linear codes over $\mathbb{Z}_{\ell}$

Motivated by the works of Shiromoto [3] and Shi et al. [4], we study the existence of MacWilliams type identities with respect to Lee and Euclidean weight enumerators for linear codes over $\mathbb{Z}_{\ell}.$ Necessary and sufficient conditions for the existence of MacWilliams type identities with respect to Lee and Euclidean weight enumerators for linear codes over $\mathbb{Z}_{\ell}$ are given. Some examples about such MacWilliams type identities are also presented.

2016-07-14cs.ITmath.IT

Weighted $\ell_1$-Minimization for Sparse Recovery under Arbitrary Prior Information

Weighted $\ell_1$-minimization has been studied as a technique for the reconstruction of a sparse signal from compressively sampled measurements when prior information about the signal, in the form of a support estimate, is available. In this work, we study the recovery conditions and the associated recovery guarantees of weighted $\ell_1$-minimization when arbitrarily many distinct weights are permitted. For example, such a setup might be used when one has multiple estimates for the support of a signal, and these estimates have varying degrees of accuracy. Our analysis yields an extension to …

2016-12-08cs.ITmath.IT

Constructions of Snake-in-the-Box Codes under $\ell_{\infty}$-metric for Rank Modulation

In the rank modulation scheme, Gray codes are very useful in the realization of flash memories. For a Gray code in this scheme, two adjacent codewords are obtained by using one "push-to-the-top" operation. Moreover, snake-in-the-box codes under the $\ell_{\infty}$-metric are Gray codes, which can be capable of detecting one $\ell_{\infty}$-error. In this paper, we give two constructions of $\ell_{\infty}$-snakes. On the one hand, inspired by Yehezkeally and Schwartz's construction, we present a new construction of the $\ell_{\infty}$-snake. The length of this $\ell_{\infty}$-snake is longer th…

2016-01-21cs.ITmath.IT

基于加权$\ell_1$优化的稀疏信息最优融合

Optimal incorporation of sparsity information by weighted $\ell_1$ optimization

稀疏源的压缩感知可以通过结合源的先验知识来改进。在本文中，我们展示了一种方法，在加权$L_1$范数最小化的无噪声重建模型的权重的最佳选择，并显示压缩，可以实现的改进。

2010-04-30cs.ITmath.IT

更多相关论文收起更多论文

Quasi-perfect codes in the $\ell_p$ metric

We consider quasi-perfect codes in $\mathbb{Z}^n$ over the $\ell_p$ metric, $2 \leq p < \infty$. Through a computational approach, we determine all radii for which there are linear quasi-perfect codes for $p = 2$ and $n = 2, 3$. Moreover, we study codes with a certain \textit{degree of imperfection}, a notion that generalizes the quasi-perfect codes. Numerical results concerning the codes with the smallest degree of imperfection are presented.

2015-09-17cs.ITmath.IT

Weight distributions of all irreducible $μ$-constacyclic codes of length $\ell^n$

Let $\mathbb{F}_q$ be a finite field of order $q$ and integer $n\ge 1$. Let $\ell$ be a prime such that $\ell^k|(q-1)$ for some integer $k\ge 1$ and $μ$ be an element of order $\ell^k$ in $\mathbb{F}_q$. In this paper, we determine the weight distributions of all irreducible $μ$-constacyclic codes of length $\ell^n$ over $\mathbb{F}_q$. Explicit expressions for the generator polynomials and codewords of these codes are also obtained.

2018-06-27cs.ITmath.COmath.IT

Distribution-aware $\ell_1$ Analysis Minimization

This work is about recovering an analysis-sparse vector, i.e. sparse vector in some transform domain, from under-sampled measurements. In real-world applications, there often exist random analysis-sparse vectors whose distribution in the analysis domain are known. To exploit this information, a weighted $\ell_1$ analysis minimization is often considered. The task of choosing the weights in this case is however challenging and non-trivial. In this work, we provide an analytical method to choose the suitable weights. Specifically, we first obtain a tight upper-bound expression for the expected n…

2022-12-27cs.ITeess.SPmath.IT

长度为$2^\ell$的不可约循环码的重量枚举式

The weight enumerators of irreducible cyclic codes of length $2^\ell$

Universidad Nacional de Córdoba（科尔多瓦国立大学）；FaMAF – CIEM (CONICET)（FaMAF–CIEM（阿根廷国家科学研究委员会））

本文利用不可约循环码与广义Paley图的谱关系，刻画长度为$2^\ell$的不可约循环码对应的广义Paley图类型，计算其谱后得到这类码重量枚举式的显式表达式。

2026-10-14cs.ITmath.COmath.IT