Improved lower bounds on sizes of single-error correcting codes

A construction of codes of length n = q + 1 and minimum Hamming distance 3 over is given. Substitution of the derived codes into a concatenation construction yields nonlinear binary single-error correcting codes with better than known parameters. In particular, new binary single-error correcting codes having more codewords than the best previously known in the range n ≤ 512 are obtained for the lengths 64–66, 128–133, 256–262, and 512.     

On Lagrangian–Grassmannian codes

Using the Lagrangian–Grassmannian, a smooth algebraic variety of dimension n(n + 1)/2 that parametrizes isotropic subspaces of dimension n in a symplectic vector space of dimension 2n, we construct a new class of linear codes generated by this variety, the Lagrangian–Grassmannian codes. We explicitly compute their word length, give a formula for their dimension and an upper bound for the minimum distance in terms of the dimension of the Lagrangian–Grassmannian variety.     

Entropy Theory from the Orbital Point of View

 Inspired by [17], we develop an orbital approach to the entropy theory for actions of countable amenable groups. This is applied to extend – with new short proofs – the recent results about uniform mixing of actions with completely positive entropy [17], Pinsker factors and the relative disjointness problems [10], Abramov–Rokhlin entropy addition formula [19], etc. Unlike the cited papers our work is independent of the standard machinery developed by Ornstein–Weiss [14] or Kieffer [12]. We do not use non-orbital tools like the Rokhlin lemma, the Shannon–McMillan theorem, castle analysis, joining techniques for amenable actions, etc. which play an essential role in [17], [19] and [10]. (Received 23 October 2000)     

Convergence theorems for semigroup-type families of non-self mappings

Motivated by a paper Chidume and Zegeye [Strong convergence theorems for common fixed points of uniformly L-Lipschitzian pseudocontractive semi-groups, Applicable Analysis, 86 (2007), 353–366], we prove several strong convergence theorems for a family (not necessarily a semigroup) ℱ = {T(t): t ∈ G} of nonexpansive or pseudocontractive non-self mappings in a reflexive strictly convex Banach space with a uniformly Gateaux differentiable norm, where G is an unbounded subset of ℝ⁺. Our results extend and improve the corresponding ones byMatsushita and Takahashi [Strong convergence theorems for nonexpansive nonself-mappings without boundary conditions,Nonlinear Analysis, 68 (2008), 412–419],Morales and Jung [Convergence of paths for pseudo-contractive mappings in Banach spaces, Proceedings of American Mathematical Society, 128 (2000), 3411–3419], Song [Iterative approximation to common fixed points of a countable family of nonexpansive mappings, Applicable Analysis, 86 (2007), 1329–1337], Song and Xu [Strong convergence theorems for nonexpansive semigroup in Banach spaces, Journal of Mathematical Analysis and Applications, 338 (2008), 152–161], Wong, Sahu, and Yao [Solving variational inequalities involving nonexpansive type mappings, Nonlinear Analysis, (2007) doi:10.1016/j.na. 2007.11.025] in the context of a non-semigroup family of non-self mappings.      

Morse potential energy minimization: Improved bounds for optimal configurations

We improve lower bounds on the minimal distance between two points of a minimum energy configuration w.r.t. the Morse potential. This is achieved by generalizing a method that was already applied to the Lennard-Jones potential in Schachinger et al. (Comput. Optim. Appl. 38:329–349, 2007), resulting in improvements of the currently best bounds known for ρ∈[4.967,15] both for minimal distance and for energy of optimal configurations.     

A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays

In (Can J Math 51(2):326–346, 1999), Martin and Stinson provide a generalized MacWilliams identity for linear ordered orthogonal arrays and linear ordered codes (introduced by Rosenbloom and Tsfasman (Prob Inform Transm 33(1):45–52, 1997) as “codes for the m-metric”) using association schemes. We give an elementary proof of this generalized MacWilliams identity using group characters and use it to derive an explicit formula for the dual type distribution of a linear ordered code or orthogonal array.      

Variations of mixed Hodge structure, Higgs fields, and quantum cohomology

Following C. Simpson, we show that every variation of graded-polarized mixed Hodge structure defined over ℚ carries a natural Higgs bundle structure which is invariant under the ℂ^* action studied in [20]. We then specialize our construction to the context of [6], and show that the resulting Higgs field θ determines (and is determined by) the Gromov–Witten potential of the underlying family of Calabi–Yau threefolds. Received: 14 February 2000     

Optimal ternary quasi-cyclic codes

Quasi-cyclic codes have provided a rich source of good linear codes. Previous constructions of quasi-cyclic codes have been confined mainly to codes whose length is a multiple of the dimension. In this paper it is shown how searches may be extended to codes whose length is a multiple of some integer which is greater than the dimension. The particular case of 5-dimensional codes over GF(3) is considered and a number of optimal codes (i.e., [n, k, d]-codes having largest possible minimum distance d for given length n and dimension k) are constructed. These include ternary codes with parameters [45, 5, 28], [36, 5, 22], [42, 5, 26], [48, 5, 30] and [72, 5, 46], all of which improve on the previously best known bounds.This research has been supported by the British SERC.     

On quasi-prime,weakly quasi-prime left ideals in ordered-Γ-semigroups

In this paper we obtain and establish some important results in ordered Γ-semigroups extending and generalizing those for semigroups given in [PETRICH, M.: Introduction to Semigroups, Merill, Columbus, 1973] and for ordered semigroups from [KEHAYOPULU, N.: On weakly prime ideals of ordered semigroups, Math. Japon. 35 (1990), 1051–1056], [KEHAYOPULU, N.: On prime, weakly prime ideals in ordered semigroups, Semigroup Forum 44 (1992), 341–346] and [XIE, X. Y.—WU, M. F.: On quasi-prime, weakly quasi-prime left ideals in ordered semigroups, PU.M.A. 6 (1995), 105–120]. We introduce and give some characterizations about the quasi-prime and weakly quasi-prime left ideals of ordered-Γ-semigroups. We also introduce the concept of weakly m-systems in ordered Γ-semigroups and give some characterizations of the quasi-prime and weakly quasi-prime left ideals by weakly m-systems.     

Asymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies

In (Gluskin, Litvak in Geom. Dedicate 90:45–48, [2002]) it was shown that a polytope with few vertices is far from being symmetric in the Banach–Mazur distance. More precisely, it was shown that Banach–Mazur distance between such a polytope and any symmetric convex body is large. In this note we introduce a new, averaging-type parameter to measure the asymmetry of polytopes. It turns out that, surprisingly, this new parameter is still very large, in fact it satisfies the same lower bound as the Banach–Mazur distance. In a sense it shows the following phenomenon: if a convex polytope with small number of vertices is as close to a symmetric body as it can be, then most of its vertices are as bad as the worst one. We apply our results to provide a lower estimate on the vertex index of a symmetric convex body, which was recently introduced in (Bezdek, Litvak in Adv. Math. 215:626–641, [2007]). Furthermore, we give the affirmative answer to a conjecture by Bezdek (Period. Math. Hung. 53:59–69, [2006]) on the quantitative illumination problem.     

Pseudomonotone operators and the Bregman Proximal Point Algorithm

To permit the stable solution of ill-posed problems, the Proximal Point Algorithm (PPA) was introduced by Martinet (RIRO 4:154–159, 1970) and further developed by Rockafellar (SIAM J Control Optim 14:877–898, 1976). Later on, the usual proximal distance function was replaced by the more general class of Bregman(-like) functions and related distances; see e.g. Chen and Teboulle (SIAM J Optim 3:538–543, 1993), Eckstein (Math Program 83:113–123, 1998), Kaplan and Tichatschke (Optimization 56(1–2):253–265, 2007), and Solodov and Svaiter (Math Oper Res 25:214–230, 2000). An adequate use of such generalized non-quadratic distance kernels admits to obtain an interior-point-effect, that is, the auxiliary problems may be treated as unconstrained ones. In the above mentioned works and nearly all other works related with this topic it was assumed that the operator of the considered variational inequality is a maximal monotone and paramonotone operator. The approaches of El-Farouq (JOTA 109:311–326, 2001), and Schaible et al. (Taiwan J Math 10(2):497–513, 2006) only need pseudomonotonicity (in the sense of Karamardian in JOTA 18:445–454, 1976); however, they make use of other restrictive assumptions which on the one hand contradict the desired interior-point-effect and on the other hand imply uniqueness of the solution of the problem. The present work points to the discussion of the Bregman algorithm under significantly weaker assumptions, namely pseudomonotonicity [and an additional assumption much less restrictive than the ones used by El-Farouq and Schaible et al. We will be able to show that convergence results known from the monotone case still hold true; some of them will be sharpened or are even new. An interior-point-effect is obtained, and for the generated subproblems we allow inexact solutions by means of a unified use of a summable-error-criterion and an error criterion of fixed-relative-error-type (this combination is also new in the literature).     

Correction of CT burst array errors in the generalized-lee-RT spaces

In [Jain, S.： Array codes in the generalized-Lee-RT-pseudo-metric （the GLRTP-metric）, to appear in Algebra Colloq.], Jain introduced a new pseudo-metric on the space Matm×s（Zq）, the module space of all m × s matrices with entries from the finite ring Zq, generalized the classical Lee metric [Lee, C. Y.： Some properties of non-binary error correcting codes. IEEE Trans. Inform. Theory, IT-4, 77- 82 （1958）] and array RT-metric [Rosenbloom, M. Y., Tsfasman, M. A.： Codes for m-metric. Prob. Inf. Transm., 33, 45-52 （1997）] and named this pseudo-metric as the Generalized-Lee-RT-Pseudo-Metric （or the GLRTP-Metric）. In this paper, we obtain some lower bounds for two-dimensional array codes correcting CT burst array errors [Jain, S.： CT bursts from classical to array coding. Discrete Math., 308-309, 1489-1499 （2008）] with weight constraints under the GLRTP-metric.     

Evaluation codes and plane valuations

We apply tools coming from singularity theory, as Hamburger–Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions given by valuations of 2-dimensional function fields. We show that these order functions are simple when their ordered domains are isomorphic to the value semigroup algebra of the corresponding valuation. Otherwise, we provide parametric equations to compute them. In the first case, we construct, for each order function, families of error correcting codes which can be decodified by the Berlekamp–Massey–Sakata algorithm and we give bounds for their minimum distance depending on minimal sets of generators for the above value semigroup.     

New Quantum MDS Code from Constacyclic Codes

In recent years, there have been intensive activities in the area of constructing quantum maximum distance separable(MDS for short) codes from constacyclic MDS codes through the Hermitian construction. In this paper, a new class of quantum MDS code is constructed, which extends the result of [Theorems 3.14–3.15, Kai, X., Zhu, S., and Li,P., IEEE Trans. on Inf. Theory, 60(4), 2014, 2080–2086], in the sense that our quantum MDS code has bigger minimum distance.     

Minimal surfaces in a wedge

Continuing our papers [4]–[6] we study the global behaviour of minimal surfaces in a wedge which meet the faces of the wedge perpendicularly and are transversal to the edge. We derive a H?lder estimate for the Gauss maps of such surfaces which immediately implies a Bernstein–type result: Each complete minimal sector in the wedge of the type described before is necessarily a plane sector. The method uses in an essential way ideas developed in [2], [3], [5], and [9].     

Asymptotic bound on binary self-orthogonal codes

We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R = 1/2, by our constructive lower bound, the relative minimum distance δ ≈ 0.0595 (for GV bound, δ ≈ 0.110). Moreover, we have proved that the binary self-orthogonal codes asymptotically achieve the Gilbert-Varshamov bound. This work was supported by the China Scholarship Council, National Natural Science Foundation of China (Grant No.10571026), the Cultivation Fund of the Key Scientific and Technical Innovation Project of Ministry of Education of China, and the Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20060286006)     

Retrieving random media

Benjamini asked whether the scenery reconstruction methods of Matzinger (see e.g. [21], [22], [20]) can be done in polynomial time. In this article, we give the following answer for a 2-color scenery and simple random walk with holding: We prove that a piece of the scenery of length of the order 3 ⁿ around the origin can be reconstructed – up to a reflection and a small translation – with high probability from the first 2 · 3^{10 αn} observations with a constant α > 0 independent of n. Thus, the number of observations needed is polynomial in the length of the piece of scenery which we reconstruct. The probability that the reconstruction fails tends to 0 as n→∞. In contrast to [21], [22], and [20], the proofs in this article are all constructive. Our reconstruction algorithm is an algorithm in the sense of computer science. This is the first article which shows that the scenery reconstruction is also possible in the 2-color case with holding. The case with holding is much more difficult than [22] and requires completely different methods.     

Stability and asymptotic behaviour of a class of discrete systems

Summary This paper is concerned with convolution discrete systems on the half-axis. Necessary and sufficient conditions for uniform stability as well as admissibility results similar to that from continuous case (see [1], [4–5], [8–9]) are given. Entrata in Redazione il 24 febbraio 1976.