English
Related papers

Related papers: Optimal codes with small constant weight in $\ell_…

200 papers

Insertion-deletion codes (insdel codes for short) are used for correcting synchronization errors in communications, and in other many interesting fields such as DNA storage, date analysis, race-track memory error correction and language…

Information Theory · Computer Science 2022-06-02 Qinqin Ji , Dabin Zheng , Hao Chen , Xiaoqiang Wang

The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of…

Combinatorics · Mathematics 2016-11-18 Tsonka Baicheva , Iliya Bouyukliev , Stefan Dodunekov , Veerle Fack

It is shown that the maximum size of a binary subspace code of packet length $v=6$, minimum subspace distance $d=4$, and constant dimension $k=3$ is $M=77$; in Finite Geometry terms, the maximum number of planes in $\operatorname{PG}(5,2)$…

Combinatorics · Mathematics 2015-10-16 Thomas Honold , Michael Kiermaier , Sascha Kurz

Binary constant-weight codes have been extensively studied, due to both their numerous applications and to their theoretical significance. In particular, constant-weight codes have been proposed for error correction in store and forward. In…

Information Theory · Computer Science 2017-09-12 Maximilien Gadouleau

Hermitian linear complementary dual codes are linear codes whose intersection with their Hermitian dual code is trivial. The largest minimum weight among quaternary Hermitian linear complementary dual codes of dimension $2$ is known for…

Combinatorics · Mathematics 2020-04-21 Keita Ishizuka

In this paper, a class of two-weight and three-weight linear codes over $\gf(p)$ is constructed, and their application in secret sharing is investigated. Some of the linear codes obtained are optimal in the sense that they meet certain…

Information Theory · Computer Science 2015-03-24 Kelan Ding , Cunsheng Ding

The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in…

Information Theory · Computer Science 2014-04-22 Sarit Buzaglo , Tuvi Etzion

Boolean functions have very nice applications in cryptography and coding theory, which have led to a lot of research focusing on their applications. The objective of this paper is to construct binary linear codes with few weights from the…

Information Theory · Computer Science 2020-06-18 Xiaoqiang Wang , Dabin Zheng , Yan Zhang

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

Let $A_2(n,d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$. In this paper we present the following new lower bounds: $A_2(18,4) \ge 5632$, $A_2(21,4) \ge 40960$, $A_2(22,4) \ge 81920$, $A_2(23,4) \ge 163840$,…

Information Theory · Computer Science 2016-07-19 Antti Laaksonen , Patric R. J. Östergård

Based on a generic construction, two classes of ternary three-weight linear codes are obtained from a family of power functions, including some APN power functions. The weight distributions of these linear codes are determined through…

Information Theory · Computer Science 2016-04-12 Yongbo Xia , Chunlei Li

We construct a family of (n,k) convolutional codes with degree \delta in {k,n-k} that have a maximum distance profile. The field size required for our construction is of the order n^{2\delta}, which improves upon the known constructions of…

Information Theory · Computer Science 2021-12-09 Zitan Chen

Generalized bicycle (GB) codes is a class of quantum error-correcting codes constructed from a pair of binary circulant matrices. Unlike for other simple quantum code ans\"atze, unrestricted GB codes may have linear distance scaling. In…

Quantum Physics · Physics 2022-04-01 Renyu Wang , Leonid P. Pryadko

In this paper, based on the nonbinary graph state, we present a systematic way of constructing good non-binary quantum codes, both additive and nonadditive, for systems with integer dimensions. With the help of computer search, which…

Quantum Physics · Physics 2009-11-13 Dan Hu , Weidong Tang , Meisheng Zhao , Qing Chen , Sixia Yu , C. H. Oh

We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…

Information Theory · Computer Science 2022-12-16 Heide Gluesing-Luerssen , Alberto Ravagnani

In this paper, we completely determine the number of solutions to $ \operatorname{Tr}^{q^2}_q(bx+b)+c=0, x\in \mu_{q+1}\backslash \{-1\}$ for all $b\in \mathbb{F}_{q^2}, c\in\mathbb{F}_{q}$. As an application, we can give the weight…

Information Theory · Computer Science 2023-04-11 Wei Lu , Xia Wu

In this work, we study the DNA codes from the ring R = Z4 + wZ4, where w^2 = 2+2w with 16 elements. We establish a one to one correspondence between the elements of the ring R and all the DNA codewords of length 2 by defining a…

Information Theory · Computer Science 2018-01-10 Dixita Limbachiya , Krishna Gopal , Bansari Rao , Manish K. Gupta

In this paper, we apply two-to-one functions over $\mathbb{F}_{2^n}$ in two generic constructions of binary linear codes. We consider two-to-one functions in two forms: (1) generalized quadratic functions; and (2) $\left(x^{2^t}+x\right)^e$…

Information Theory · Computer Science 2020-06-23 Kangquan Li , Chunlei Li , Tor Helleseth , Longjiang Qu

A set of sufficient conditions to construct $\lambda$-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight…

Information Theory · Computer Science 2016-11-17 G. Susinder Rajan , B. Sundar Rajan

In [9], the codewords of small weight in the dual code of the code of points and lines of Q(4, q) are characterised. Inspired by this result, using geometrical arguments, we characterise the codewords of small weight in the dual code of the…

Combinatorics · Mathematics 2012-01-17 Valentina Pepe , Leo Storme , Geertrui Van de Voorde