English
Related papers

Related papers: On optimal constant weight codes derived from $\om…

200 papers

A weighing matrix $W$ of order $n=\frac{p^{m+1}-1}{p-1}$ and weight $p^m$ is constructed and shown that the rows of $W$ and $-W$ form optimal constant weight ternary codes of length $n$, weight $p^m$ and minimum distance…

Combinatorics · Mathematics 2021-12-09 Hadi Kharaghani , Sho Suda , Vlad Zaitsev

An optimal constant-composition or constant-weight code of weight $w$ has linear size if and only if its distance $d$ is at least $2w-1$. When $d\geq 2w$, the determination of the exact size of such a constant-composition or constant-weight…

Information Theory · Computer Science 2010-08-11 Yeow Meng Chee , Son Hoang Dau , Alan C. H. Ling , San Ling

In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.

Information Theory · Computer Science 2017-06-28 Long Yu , Xiusheng Liu

Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of…

Information Theory · Computer Science 2015-08-11 Liqing Xu , Hao Chen

A new construction for constant weight codes is presented. The codes are constructed from $k$-dimensional subspaces of the vector space $\F_q^n$. These subspaces form a constant dimension code in the Grassmannian space $\cG_q(n,k)$. Some of…

Information Theory · Computer Science 2015-03-14 Tuvi Etzion , Alexander Vardy

This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary…

Information Theory · Computer Science 2007-07-13 Yeow Meng Chee , San Ling

Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let $q$ be a prime power. In this paper, by using the simplicial complexes of ${\mathbb…

Information Theory · Computer Science 2024-07-16 Bing Chen , Yunge Xu , Zhao Hu , Nian Li , Xiangyong Zeng

Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatorial constructions for MCWCs which yield several new infinite…

Information Theory · Computer Science 2014-11-11 Yeow Meng Chee , Han Mao Kiah , Hui Zhang , Xiande Zhang

Constacyclic codes are important classes of linear codes that have been applied to the construction of quantum codes. Six new families of asymmetric quantum codes derived from constacyclic codes are constructed in this paper. Moreover, the…

Information Theory · Computer Science 2014-04-01 Liqi Wang , Shixin Zhu

The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…

Information Theory · Computer Science 2008-07-18 Yeow Meng Chee , Gennian Ge , Alan C. H. Ling

This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to the sizes of optimal constant-weight, binary, error-correcting…

Information Theory · Computer Science 2007-10-15 Russell Bent , Michael Schear , Lane A. Hemaspaandra , Gabriel Istrate

Balanced weighing matrices with parameters $$ \left(1+18\cdot\frac{9^{m+1}-1}{8},9^{m+1},4\cdot 9^m\right), $$ for each nonzero integer $m$ is constructed. This is the first infinite class not belonging to those with classical parameters.…

Combinatorics · Mathematics 2021-10-01 Hadi Kharaghani , Thomas Pender , Sho Suda

Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…

Information Theory · Computer Science 2007-07-13 Eric Zhi Chen

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

Information Theory · Computer Science 2009-01-09 Eric Z. Chen

In this paper, on one hand, a class of linear codes with one or two weights is obtained. Based on these linear codes, we construct two classes of constant composition codes, which includes optimal constant composition codes depending on…

Information Theory · Computer Science 2017-06-23 Long Yu , Xiusheng Liu

We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension. One family is built from nonlinear…

Quantum Physics · Physics 2009-07-30 Peter W. Shor , Graeme Smith , John A. Smolin , Bei Zeng

Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In…

Information Theory · Computer Science 2012-07-12 Cunsheng Ding

A unified approach to the construction of weighing matrices and certain symmetric designs is presented. Assuming the weight $p$ in a weighing matrix $W(n,p)$ is a prime power, it is shown that there is a…

Combinatorics · Mathematics 2021-10-01 Hadi Kharaghani , Thomas Pender , Sho Suda

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, a class of three-weight…

Information Theory · Computer Science 2013-02-05 Zhengchun Zhou , Cunsheng Ding

From cosets of binary Hamming codes we construct diameter perfect constant-weight ternary codes with weight $n-1$ (where $n$ is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before. Keywords:…

Combinatorics · Mathematics 2009-08-03 Denis Krotov
‹ Prev 1 2 3 10 Next ›