We obtain general theorems which enable the calculation of the Dixmier trace in terms of the asymptotics of the zeta function and of the heat operator in a general semi-finite von Neumann algebra. Our results have several applications. We deduce a formula for the Chern character of an odd L-summable Breuer-Fredholm module in terms of a Hochschild 1-cycle. We explain how to derive a Wodzicki res...

The structure of the twisted squaring construction, a generalization of the squaring construction, is studied with respect to trellis diagrams and complexity. We show that binary affine-invariant codes, which include the extended primitive BCH codes, and the extended binary quadratic-residue codes, are equivalent to twisted squaring construction codes. In particular, a recursive symmetric rever...

Quadratic residue (QR) codes are cyclic, nominally half-rate codes, that are powerful with respect to their error-correction capabilities. Decoding QR codes is in general a difficult task, but great progress has been made in the binary case since the work of Elia [1] and He et al. [2]. Decoding algorithms for certain nonbinary QR codes were proposed by Higgs and Humphreys in [3] and [4]. In [5]...

In this study, an efficient and fast algebraic decoding algorithm (ADA) for the binary systematic quadratic residue (QR) code of length 73 with the reducible generator polynomial to correct up to six errors is proposed. The S(I, J ) matrix method given by He et al. (2001) is utilised to compute the unknown syndromes S5. A technique called swap base is proposed to correct the weight-4 error patt...

  is only defined when the bottom is an odd prime. You can extend the definition to allow an odd positive number on the bottom using the Jacobi symbol. Most of the properties of Legendre symbols go through for Jacobi symbols, which makes Jacobi symbols very convenient for computation. We’ll see, however, that there is a price to pay for the greater generality: Euler’s formula no longer works,...

Let p ≡ 1 (mod 4) be a prime. Let a, b ∈ Z with p a(a2 + b2). In the paper we mainly determine ( b+ √ a2+b2 2 ) p−1 2 (mod p) by assuming p = c2 + d2 or p = Ax2 + 2Bxy + Cy2 with AC − B2 = a2 + b2. As an application we obtain simple criteria for εD to be a quadratic residue (mod p), where D > 1 is a squarefree integer such that D is a quadratic residue of p, εD is the fundamental unit of the qu...

The paper is devoted to the study of the weight distribution of irreducible cyclic codes. We start from the interpretation due to McEliece of these weights by means of Gauss sums. Firstly, a p-adic analysis using Stickelberger congruences and Gross-Koblitz formula enable us to improve the divisibility theorem of McEliece by giving results on the multiplicity of the weights. Secondly, in connect...

We discuss several classes of redundant arrays. These arrays have applications for indirect imaging in a variety of elds including coded-aperture imaging, interferomet-ric radio imaging, and optical imaging in the presence of atmospheric turbulence. The speciic classes we will discuss are all based on Galois elds and include: antisymmet-ric redundant arrays (ARAs) which have as a subset the hex...

We study the problem of bounding the least prime that does not split completely in a number field. This is a generalization of the classic problem of bounding the least quadratic non-residue. Here, we present two distinct approaches to this problem. The first is by studying the behavior of the Dedekind zeta function of the number field near 1, and the second by relating the problem to questions...

We study finite and infinite Sidon sets in N. The additive energy of two sets is used to obtain new upper bounds for the cardinalities of finite Sidon subsets of some sets as well as to provide short proofs of already known results. We also disprove a conjecture of Lindstrom on the largest Sidon set in [1, N ]× [1, N ] and relate it to a known conjecture of Vinogradov concerning the size of the...