English
Related papers

Related papers: Binary and Ternary Quasi-perfect Codes with Small …

200 papers

Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three…

Information Theory · Computer Science 2016-08-22 Yang Yan , Fei Li , Qiuyan Wang

Cyclic codes have efficient encoding and decoding algorithms over finite fields, so that they have practical applications in communication systems, consumer electronics and data storage systems. The objective of this paper is to give eight…

Information Theory · Computer Science 2022-05-02 Lanqiang Li , Li Liu , Shixin Zhu

Let $\mathcal{O}$ be a conic in the classical projective plane $PG(2,q)$, where $q$ is an odd prime power. With respect to $\mathcal{O}$, the lines of $PG(2,q)$ are classified as passant, tangent, and secant lines, and the points of…

Combinatorics · Mathematics 2009-11-12 Peter Sin , Junhua Wu , Qing Xiang

Two families of complementary codes over finite fields $\mathbb{F}_q$ are studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and…

Information Theory · Computer Science 2017-10-13 Kriangkrai Boonniyom , Somphong Jitman

Quantum error correction is rapidly seeing first experimental implementations, but there is a significant gap between asymptotically optimal error-correcting codes and codes that are experimentally feasible. Quantum LDPC codes range from…

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

Information Theory · Computer Science 2012-01-31 Sunghyu Han , Jon-Lark Kim , Heisook Lee , Yoonjin Lee

Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain…

Information Theory · Computer Science 2022-11-01 Meng Cao

In this paper, we provide a polynomial characterization of linear complementary pairs of quasi-cyclic and quasi-twisted codes of index 2. We also give several examples of linear complementary pairs of quasi-cyclic and quasi-twisted codes…

Information Theory · Computer Science 2026-01-21 Kanat Abdukhalikov , Duy Ho , San Ling , Gyanendra K. Verma

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…

Information Theory · Computer Science 2016-02-03 Fei Li , Yang Yan , Qiuyan Wang , Tongjiang Yan

A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…

Information Theory · Computer Science 2015-12-23 Can Xiang

Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary…

Information Theory · Computer Science 2016-12-15 Deng Tang , Claude Carlet , Zhengchun Zhou

Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…

Information Theory · Computer Science 2020-03-18 Yansheng Wu , Yoonjin Lee

The dual codes of the ternary linear codes of the residual designs of biplanes on 56 points are used to prove the nonexistence of quasi-symmetric 2-$(56,12,9)$ and 2-$(57,12,11)$ designs with intersection numbers 0 and 3, and the…

Combinatorics · Mathematics 2020-06-09 Akihiro Munemasa , Vladimir D. Tonchev

For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to making short cycles. Also, the existing high-rate quasi-cyclic…

Information Theory · Computer Science 2016-11-18 Hosung Park , Seokbeom Hong , Jong-Seon No , Dong-Joon Shin

We investigate perfect codes in $\mathbb{Z}^n$ under the $\ell_p$ metric. Upper bounds for the packing radius $r$ of a linear perfect code, in terms of the metric parameter $p$ and the dimension $n$ are derived. For $p = 2$ and $n = 2, 3$,…

Combinatorics · Mathematics 2015-11-11 Antonio Campello , Grasiele C. Jorge , and João Strapasson , Sueli I. R. Costa

We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian…

Group Theory · Mathematics 2013-01-29 Eldho K. Thomas , Frederique Oggier

Construction of quantum codes and entanglement-assisted quantum codes with good parameters via classical codes is an important task for quantum computing and quantum information. In this paper, by a family of one-generator quasi-cyclic…

Information Theory · Computer Science 2020-09-08 Jingjie Lv , Ruihu Li , Yu Yao

A linear code is said to be self-orthogonal if it is contained in its dual. Self-orthogonal codes are of interest because of their important applications, such as for constructing linear complementary dual (LCD) codes and quantum codes. In…

Information Theory · Computer Science 2023-12-08 Dengcheng Xie , Shixin Zhu , Yang Li

This correspondence introduces two new constructive techniques to complete the determination of the sizes of optimal q-ary codes of constant weight three and distance four.

Information Theory · Computer Science 2008-03-27 Yeow Meng Chee , Son Hoang Dau , Alan C. H. Ling , San Ling

Linear codes and $t$-designs are interactive with each other. It is well known that some $t$-designs have been constructed by using certain linear codes in recent years. However, only a small number of infinite families of the extended…

Information Theory · Computer Science 2022-11-28 Can Xiang , Chunming Tang
‹ Prev 1 3 4 5 6 7 10 Next ›