Related papers: Asymptotically good binary linear codes with asymp…
We introduce the notion of a bisector field, which is a maximal collection of pairs of lines such that for each line in each pair, the midpoint of the points where the line crosses every pair is the same, regardless of choice of pair. We…
We show that the tensor product of two random linear codes is robustly testable with high probability. This implies that one can obtain pairs of linear codes such that their product and the product of their dual codes are simultaneously…
In this paper, using additive characters of finite field, we find a codebook which is equivalent to the measurement matrix in [20]. The advantage of our construction is that it can be generalized naturally to construct the other five…
We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…
For a pair of given binary perfect codes C and D of lengths t and m respectively, the Mollard construction outputs a perfect code M(C,D) of length tm + t + m, having subcodes C1 and D2, that are obtained from codewords of C and D…
Generalizing even-like duadic cyclic codes and Type-II duadic negacyclic codes, we introduce even-like (i.e.,Type-II) and odd-like duadic constacyclic codes, and study their properties and existence. We show that even-like duadic…
We construct families of symmetric, antisymmetric, and asymmetric solitary modes in one-dimensional bichromatic lattices with the second-harmonic-generating ($\chi ^{(2)}$) nonlinearity concentrated at a pair of sites placed at distance…
In this paper, we provide a complete Plancherel-Rotach asymptotic analysis of polynomials that satisfy a second-order difference equation with linear coefficients. According to the signs of the parameters, we classify the difference…
We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…
It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be…
In this paper, we employ group rings and automorphism groups of binary linear codes to construct new record-breaking binary linear codes. We consider the semidirect product of abelian groups and cyclic groups and use these groups to…
The error coefficient of a linear code is defined as the number of minimum-weight codewords. In an additive white Gaussian noise channel, optimal linear codes with the smallest error coefficients achieve the best possible asymptotic frame…
A binary code is said to be a disjunctive list-decoding $s_L$-code (LD $s_L$-code), $s \ge 2$, $L \ge 1$, if the code is identified by the incidence matrix of a family of finite sets in which the union (or disjunctive sum) of any $s$ sets…
We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of…
Based on the theoretical neuroscience, G. Cotardo and A. Ravagnavi in \cite{CR} introduced a kind of asymmetric binary codes called combinatorial neural codes (CN codes for short), with a "matched metric" $\delta_{r}$ called asymmetric…
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, monomials and trinomials over…
Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…
General isometries of cyclic codes, including multipliers and translations, are introduced; and isometrically self-dual cyclic codes are defined. In terms of Type-I duadic splittings given by multipliers and translations, a necessary and…
Locally repairable codes (LRCs), which can recover any symbol of a codeword by reading only a small number of other symbols, have been widely used in real-world distributed storage systems, such as Microsoft Azure Storage and Ceph Storage…
We investigate additive cyclic codes over the alphabet $\mathbb{F}_{q}\mathbb{F}_{q^2}$, where $q$ is a prime power. First, its generator polynomials and minimal spanning set are determined. Then, examples of $\mathbb{F}_{q^2}$-additive…