Related papers: A Class of Narrow-Sense BCH Codes
Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…
It is a major challenge to construct good quantum codes supporting fault-tolerant (e.g. transversal) non-Clifford gates with low-weight parity-check measurements. In this paper, we construct the first known quantum codes with linear…
Codes for storage systems aim to minimize the repair locality, which is the number of disks (or nodes) that participate in the repair of a single failed disk. Simultaneously, the code must sustain a high rate, operate on a small finite…
In this paper we propose a technique to blindly synthesize the generator polynomial of BCH codes. The proposed technique involves finding Greatest Common Divisor (GCD) among different codewords and block lengths. Based on this combinatorial…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
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…
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…
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…
The problem of blind identification of channel codes at a receiver involves identifying a code chosen by a transmitter from a known code-family, by observing the transmitted codewords through the channel. Most existing approaches for…
Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional…
We extend our previous studies to calculate the B meson B parameters B_B and B_S on the lattice, and present an update of the results for the B_s meson width difference. We perform an extensive study of systematic errors in the quenched…
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, we settle an open problem…
Cyclic codes are an important class of linear codes. Bounding the minimum distance of cyclic codes is a long-standing research topic in coding theory, and several well-known and basic results have been developed on this topic. Recently,…
We propose a novel binary message passing decoding algorithm for product-like codes based on bounded distance decoding (BDD) of the component codes. The algorithm, dubbed iterative BDD with scaled reliability (iBDD-SR), exploits the channel…
Boltzmann codes are used extensively by several groups for constraining cosmological parameters with Cosmic Microwave Background and Large Scale Structure data. This activity is computationally expensive, since a typical project requires…
Low check weight is practically crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we explore the theory of weight-constrained stabilizer…
Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attacks and fault non-invasive attacks. Let $d_{LCD}(n, k)$ denote…
Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…
We construct error correcting nonlinear binary codes using a construction of Bose and Chowla in additive number theory. Our method extends a construction of Graham and Sloane for constant weight codes. The new codes improve 1028 of the 7168…
For a linear Hamming metric code of length n over a finite field, the number of distinct weights of its codewords is at most n. The codes achieving the equality in the above bound were called full weight spectrum codes. In this paper we…