Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was introduced by Luo, et. al. (2010). One of our main results is the development of general algorithms, called the Chain Algorithms, for finding ODPs of linear codes...

Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was introduced by Luo, et. al. (2010). One of our main results is the development of general algorithms, called the Chain Algorithms, for finding ODPs of linear codes...

This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic non-residue and the least prime in an arithmetic progression. We also refine the classical conditional bounds of Littlewood for L-functions at s = 1. In particula...

Abstract Recently, Lovejoy introduced the construct of overpartition pairs which are a natural generalization of overpartitions. Here we generalize that idea to overpartition ktuples and prove several congruences related to them. We denote the number of overpartition k-tuples of a positive integer n by pk(n) and prove, for example, that for all n ≥ 0, pt−1(tn + r) ≡ 0 (mod t) where t is prime a...

Abstract. We prove two related concentration inequalities concerning the number of rational points of hyperelliptic curves over subsets of a finite field. In particular, we investigate the probability of a large discrepancy between the numbers of quadratic residues and non-residues in the image of such subsets over uniformly random hyperelliptic curves of given degrees. We find a constant proba...

In this paper, we introduce a new definitions of the Gray weight and the Gray map for linear codes over Z9+uZ9 with u 2 = u. Some results on self-dual codes over this ring are investigated. Further, the structural properties of quadratic residue codes are also considered. Two self-dual codes with parameters [22, 11, 5] and [24, 12, 9] over Z9 are obtained.

In this paper a new algebraic decoding approach for (17,9,5) Quadratic Residue Code is proposed by using the Inverse Free Berlekamp-MasseyAlgorithm i.e. IFBM algorithm. By using an efficient algorithm an unknown syndrome are also developed in this paper. With the help of unknown syndromes, we achieve the alternative consecutive syndromes which are needed for the application of the Berlekamp-Mas...

Residue Number Systems require the selection of ring moduli whose product is greater than the predicted dynamic range of the computation being performed. The restriction that the moduli be relatively prime usually limits the set of available moduli and hence the maximum dynamic range. This is particularly the case when small moduli are to be considered for efficient hardware implementation. Sev...

In this paper, a modification decoding algorithm for the (89, 45, 17) QR code is proposed to decode all error patterns with weight less than six and high percentage weight-6, weight-7, and weight-8 error patterns.