Codes with the Same Weight Distributions as the Goethals Codes and the Delsarte-Goethals Codes

The Goethals code is a binary nonlinear code of length 2^m+1 which has codewords and minimum Hamming distance 8 for any odd . Recently, Hammons et. al. showed that codes with the same weight distribution can be obtained via the Gray map from a linear code over Z ₄of length 2^m and Lee distance 8. The Gray map of the dual of the corresponding Z ₄ code is a Delsarte-Goethals code. We construct codes over Z ₄ such that their Gray maps lead to codes with the same weight distribution as the Goethals codes and the Delsarte-Goethals codes.     

Two New Infinite Families of 3-Designs from Kerdock Codes over Z4

In this paper we show that the support of the codewords of each type in the Kerdock code of length 2^m over Z₄ form 3-designs for any odd integer . In particular, twonew infinite families of 3-designs are obtained in this constructionfor any odd integer . In particular, twonew infinite families of 3-designs are obtained in this constructionfor any odd integer , whose parameters are ,and .     

3-Designs from the Z 4-Goethals Codes via a New Kloosterman Sum Identity

Recently, active research has been performed on constructing t-designs from linear codes over Z ₄. In this paper, we will construct a new simple 3 – (2 ^m , 7, 14/3 (2 ^m – 8)) design from codewords of Hamming weight 7 in the Z ₄-Goethals code for odd m 5. For 3 arbitrary positions, we will count the number of codewords of Hamming weight 7 whose support includes those 3 positions. This counting can be simplified by using the double-transitivity of the Goethals code and divided into small cases. It turns out interestingly that, in almost all cases, this count is related to the value of a Kloosterman sum. As a result, we can also prove a new Kloosterman sum identity while deriving the 3-design.     

Maximal partial packings of $${Z_2^n}$$ with perfect codes

A maximal partial Hamming packing of is a family of mutually disjoint translates of Hamming codes of length n, such that any translate of any Hamming code of length n intersects at least one of the translates of Hamming codes in . The number of translates of Hamming codes in is the packing number, and a partial Hamming packing is strictly partial if the family does not constitute a partition of . A simple and useful condition describing when two translates of Hamming codes are disjoint or not disjoint is proved. This condition depends on the dual codes of the corresponding Hamming codes. Partly, by using this condition, it is shown that the packing number p, for any maximal strictly partial Hamming packing of , n = 2 ^m −1, satisfies . It is also proved that for any n equal to 2 ^m −1, , there exist maximal strictly partial Hamming packings of with packing numbers n−10,n−9,n−8,...,n−1. This implies that the upper bound is tight for any n = 2 ^m −1, . All packing numbers for maximal strictly partial Hamming packings of , n = 7 and 15, are found by a computer search. In the case n = 7 the packing number is 5, and in the case n = 15 the possible packing numbers are 5,6,7,...,13 and 14.      

Weighted Bergman Spaces and Carleson Measures on the Unit Ball of Cn

Let be a normal function on [0, 1), B _n the unit ball of C ⁿ , and A ^p (B _n ) the weighted Bergman spaces on B _n with weight . The purpose of this paper is to discuss some relations among A ^p (B _n ), weighted Bergman kernels, and Carleson measures on B _n .     

A Class of Perfect Ternary Constant-Weight Codes

We construct a class of perfect ternary constant-weight codes of length 2 ^r , weight 2 ^r -1 and minimum distance 3. The codes have codewords. The construction is based on combining cosets of binary Hamming codes. As a special case, for r=2 the construction gives the subcode of the tetracode consisting of its nonzero codewords. By shortening the perfect codes, we get further optimal codes.     

Une variante à la Coxeter du groupe de Steinberg

LetG _n ()be the semi-direct product of the symmetric groupS _n by the Steinberg groupSt _n ()of a ringWe first prove thatG _n ()has a Coxeter-type presentation. The canonical morphism St _n () GL _n ()extends to a group homo G_n() GL _n ()We next determine the kernel of for n = We also give an expression for the generator of the algebraic K group K ₂(Z)of the integers in terms of permutation matrices.     

Convexity theories 0. Foundations

For an arbitrary prenormed semiring, the closed unit ball functor from the category _R pnSmod ¹ ofR-prenormedR-semimodules with contractions to the category of sets has a left adjoint. For such a semiringR the notion of finitary convexity theory overR is introduced and the category C of -modules is defined. It is shown that the canonical functor _R pnSmod ¹ C has a left adjoint. In caseR is a banach semiring one has infinitary convexity theories, in addition to the finitary ones, and again the canonical functor _R bnSmod ¹ C has a left adjoint.Many more happy returns, Nico. Sixty is forever.     

Exact Bounds on the Sizes of Covering Codes

A code c is a covering code of X with radius r if every element of X is within Hamming distance r from at least one codeword from c. The minimum size of such a c is denoted by c _r(X). Answering a question of Hämäläinen et al. [10], we show further connections between Turán theory and constant weight covering codes. Our main tool is the theory of supersaturated hypergraphs. In particular, for n > n ₀(r) we give the exact minimum number of Hamming balls of radius r required to cover a Hamming ball of radius r + 2 in {0, 1}ⁿ. We prove that c _r(B _n(0, r + 2)) = _{1 i r + 1} ( ^{(n + i – 1) / (r + 1) 2}) + n / (r + 1) and that the centers of the covering balls B(x, r) can be obtained by taking all pairs in the parts of an (r + 1)-partition of the n-set and by taking the singletons in one of the parts.     

TheO(n3) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix

Let twon×n matrices be given, namely a real matrixA=(a_ij) and a (0, 1)-matrixT=(t_ij). For a cyclic permutation=(i ₁,i ₂,...,i _k) of a subset of N={1, 2, ..., n} we define _A;T(), the cost-to-time ratio weight of, as . This paper presents an O(n³) algorithm for finding (A;T)=max _A;T(), the maximum cost-to-time ratio weight of the matricesA andT. Moreover a generalised eigenproblem is proposed.     

White Noise Approach to the Construction of Φ4 4 Quantum Fields

In this paper by Sobolev imbedding theorem and characterization theorem of generalized operators the existence of ₄ ⁴ quantum fields as generalized operators is obtained with space cut-off and a rigorous mathematical interpretation of renormalization procedure is given under white noise theory.     

G8 estimator of solutions of systems of linear algebraic equations

For linear forms of regularized solutions (x, c)=Re c' · Re[I + i)+A'A_n ^–1]^–1 A'_nb of systems of equations Ax=b, where A is an n×m matrix, x, c, b are vectors, and _n is a sequence of constants, we propose the estimator , where is any measurable solution of the equation ()Re[1+₁a(())]²+ (₁–₂)(1+₁(gq()))=, a(y)=n^–1 Sp[Iy+^–1Z_s'Z^s+ iI]^–1, , _i=n_n ²_n ^–1s_n ^–1, ⁿ=mI_n ²_n ^–1s_n ^–1, X_i are independent observations on the matrix A. Under certain conditions, it is proved that G₈ is a consistent estimator for n and 0.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 66, pp. 111–119, 1988.     

On Lower Bounds for the Redundancy of Optimal Codes

The problem of providing bounds on the redundancy of an optimal code for a discrete memoryless source in terms of the probability distribution of the source, has been extensively studied in the literature. The attention has mainly focused on binary codes for the case when the most or the least likely source letter probabilities are known. In this paper we analyze the relationships among tight lower bounds on the redundancy r. Let r _D,i(x) be the tight lower bound on r for D-ary codes in terms of the value x of the i-th most likely source letter probability. We prove that _D,i-1(x) _D,i(x) for all possible x and i. As a consequence, we can bound the redundancy when only the value of a probability (but not its rank) is known. Another consequence is a shorter and simpler proof of a known bound. We also provide some other properties of tight lower bounds. Finally, we determine an achievable lower bound on r in terms of the least likely source letter probability for D 3, generalizing the known bound for the case D = 2.     

Best mean-square approximation of functions of m variables

Let be the best mean-square approximation of a functionf(x) L₂(R_m) (m=1, 2, ...) by integral functions of the exponential spherical type (in the sense of thel _q metric, 0>0, where(f,/; l _p)L₂(R_m) is the spherical (in the sense of the metricl _p, 0f(x) L₂(R_m). For the quantity two-sided estimates are obtained which are uniform in the parameters m, q, and p. Similar results are also obtained in the case of q=p=2 for classes of functions W _f2 (R_m) (=1,2,...).Translated from Matematicheskie Zametki, Vol. 14, No. 6, pp. 913–924, December, 1973.The author would like to express his deep gratitude to N. I. Chernykh under whose guidance this work has been carried out.     

The number of self-dual codes over $${Z_{p^3}}$$

Let p be a prime number. In this paper, we consider codes over the ring of integers modulo p ³ and give a characterization of self-duality. This leads to a construction of self-dual codes and a mass formula, which counts the number of such codes over .      

Number of no nisomorphic subgraphs in an n-point graph

LetG(n) be the set of all nonoriented graphs with n enumerated points without loops or multiple lines, and let v_k(G) be the number of mutually nonisomorphic k-point subgraphs of G G(n). It is proved that at least |G(n)| (1–1/n) graphs G G(n) possess the following properties: a) for any k [6log₂n], where c=–c log₂c–(1–c)×log₂(1–c) and c>1/2, we havev _k(G) > C _n ^k (1–1/n²); b) for any k [cn + 5 log₂n] we havev _k(G) = C _n ^k . Hence almost all graphs G G(n) containv(G) 2ⁿ pairwise nonisomorphic subgraphs.Translated from Matematicheskie Zametki, Vol. 9, No. 3, pp. 263–273, March, 1971.     

On the postulation of a general projection of a curve inP N,N⩾4

Summary Fix a curve X of genus g and L Pic ^d (X). Let _L(X) be the image of X through the complete linear system H⁰(X, L). Here we prove that a general projection of _L(X) intoP ^N has maximal rank if either (a) N4, 0gN–1, dg+N, or (b) dd (g, N) for suitable d(g, N).     

Solving systems of polynomial inequalities over a real closed field in subexponential time

Let _m= (₁,..., _m) denote an ordered field, where _i+1>0 is infinitesimal relative to the elements of _i, 0 < –i < m (by definition, ₀= ). Given a system of inequalities f₁ > 0, ..., f_s > 0, f_s+1 0, ..., f_k 0, where f_{j m} [X₁,..., X_n] are polynomials such that, and the absolute value of any integer occurring in the coefficients of the f_js is at most 2^M. An algorithm is constructed which tests the above system of inequalities for solvability over the real closure of _m in polynomial time with respect to M, ((d)ⁿd₀)^n+m. In the case _m=, the algorithm explicitly constructs a family of real solutions of the system (provided the latter is consistent). Previously known algorithms for this problem had complexity of the order ofM(d d ₀ ^{m 2U(n)} .Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Maternaticheskogo Instituta im. V. A. Steklova Akad. Nauk SSSR, Vol. 174, pp. 3–36, 1988.     

A Minimal Triangulation of the Hopf Map and its Application

We give a minimal triangulation : S ₁₂ ³ S ₄ ² of the Hopf map h:S ³S ² and use it to obtain a new construction of the 9-vertex complex projective plane.     

Gewichtete Volumsmittelwerte von Simplices,welche zufällig in einem konvexen Körper des ℝ gewählt werden

For any set ofn+1 pointsx ₁, ...,x _n+1F we denote byv(C(x ₁,...,x _n+1)) then-dimensional oriented volume of the convex hullC(x ₁,...,x _n+1) of these points. With a fixed symmetric functionf: >> strictly monotone increasing on the nonnegative real line, we consider the real functional RODEL on the set of all convex bodiesK of ⁿ with absolute volume |v(K)|=1 and assert, that it takes its minimal value on the ellipsoids with absolute volume 1.