Applied Mathematics Commons^™

S-Extremal Additive F4 Codes, Evangeline P. Bautista, Philippe Gaborit, Jon-Lark Kim, Judy L. Walker

Department of Mathematics: Faculty Publications

Binary self-dual codes and additive self-dual codes over F₄ have in common interesting properties, for example, Type I, Type II, shadows, etc. Recently Bachoc and Gaborit introduced the notion of s-extremality for binary self-dual codes, generalizing Elkies' study on the highest possible minimum weight of the shadows of binary self-dual codes. In this paper, we introduce a concept of s-extremality for additive self-dual codes over F₄, give a bound on the length of these codes with even distance d, classify them up to minimum distance d = 4, give possible lengths and (shadow) weight …

Characterizations Of Pseudo-Codewords Of Ldpc Codes, Ralf Koetter, Wen-Cheng W. Li, Pascal O. Vontobel, Judy L. Walker

Department of Mathematics: Faculty Publications

An important property of high-performance, low complexity codes is the existence of highly efficient algorithms for their decoding. Many of the most efficient, recent graph-based algorithms, e.g. message passing algorithms and decoding based on linear programming, crucially depend on the efficient representation of a code in a graphical model. In order to understand the performance of these algorithms, we argue for the characterization of codes in terms of a so called fundamental cone in Euclidean space which is a function of a given parity check matrix of a code, rather than of the code itself. We give a number of …

Norming Algebras And Automatic Complete Boundedness Of Isomorphisms Of Operator Algebras, David R. Pitts

Department of Mathematics: Faculty Publications

We combine the notion of norming algebra introduced by Pop, Sinclair and Smith with a result of Pisier to show that if A1 and A2 are operator algebras, then any bounded epimorphism of A1 onto A2 is completely bounded provided that A2 contains a norming C*-subalgebra. We use this result to give some insights into Kadison’s Similarity Problem: we show that every faithful bounded homomorphism of a C*-algebra on a Hilbert space has completely bounded inverse, and show that a bounded representation of a C-algebra is similar to a -representation precisely when the image operator algebra -norms itself. We give …

Why Is The Number Of Dna Bases 4?, Bo Deng

Department of Mathematics: Faculty Publications

In this paper we construct a mathematical model for DNA replication based on Shannon’s mathematical theory for communication. We treatDNAreplication as a communication channel. We show that the mean replication rate is maximal with four nucleotide bases under the primary assumption that the pairing time of the G–C bases is between 1.65 and 3 times the pairing time of the A–T bases.

Coordinate Systems And Bounded Isomorphisms, David R. Pitts, David R. Pitts

Department of Mathematics: Faculty Publications

For a Banach D-bimoduleMover an abelian unital C*-algebraD, we define E1(M) as the collection of norm-one eigenvectors for the dual action of D on the Banach space dual M#. Equip E1(M) with the weak*-topology. We develop general properties of E1(M). It is properly viewed as a coordinate system for M when M C, where C is a unital C*-algebra containing D as a regular MASA with the extension property; moreover, E1(C) coincides with Kumjian’s twist in the context of C*-diagonals. We identify the C*-envelope of a subalgebra A of a C*-diagonal when D A C. For triangular subalgebras, each containing …

Weak Solutions To The Cauchy Problem Of A Semilinear Wave Equation With Damping And Source Terms, Petronela Radu

Department of Mathematics: Faculty Publications

In this paper we prove local existence of weak solutions for a semilinear wave equation with power-like source and dissipative terms on the entire space ℝⁿ. The main theorem gives an alternative proof of the local in time existence result due to J. Serrin, G. Todorova and E. Vitillaro, and also some extension to their work. In particular, our method shows that sources that are not locally Lipschitz in L² can be controlled without any damping at all. If the semilinearity involving the displacement has a “good” sign, we obtain global existence of solutions.

Reversals And Transpositions Over Finite Alphabets, A. J. Radcliffe, A. D. Scott, E. L. Wilmer

Department of Mathematics: Faculty Publications

Extending results of Christie and Irving, we examine the action of reversals and transpositions on finite strings over an alphabet of size k. We show that determining reversal, transposition, or signed reversal distance between two strings over a finite alphabet is NP-hard, while for “dense” instances we give a polynomial-time approximation scheme. We also give a number of extremal results, as well as investigating the distance between random strings and the problem of sorting a string over a finite alphabet.

Absolutely Continuous Representations And A Kaplansky Density Theorem For Free Semigroup Algebras, Kenneth R. Davidson, Jiankui Li, David R. Pitts

Department of Mathematics: Faculty Publications

We introduce notions of absolutely continuous functionals and representations on the non-commutative disk algebra An. Absolutely continuous functionals are used to help identify the type L part of the free semigroup algebra associated to a ∗-extendible represen- tation . A ∗-extendible representation of An is regular if the absolutely continuous part coincides with the type L part. All known examples are regular. Absolutely continuous func- tionals are intimately related to maps which intertwine a given ∗-extendible representation with the left regular representation. A simple application of these ideas extends reflexivity and hyper-reflexivity results. Moreover the use of absolute continuity is …

Integral Transforms, Convolution Products, And First Variations, Bong Jin Kim, Byoung Soo Kim, David Skough

Department of Mathematics: Faculty Publications

We establish the various relationships that exist among the integral transform F_α,βF, the convolution product (F∗G)α, and the first variation δF for a class of functionals defined on K[0,T], the space of complex-valued continuous functions on [0,T] which vanish at zero.

A Survey Of Results Involving Transforms And Convolutions In Function Space, David Skough, David Storvick

Department of Mathematics: Faculty Publications

In this paper we survey various results involving Fourier-Wiener transforms, Fourier-Feynman transforms, integral transforms and convolution products of functionals over function space that have been established since Cameron and Martin first introduced Fourier-Wiener transforms in 1945.

Applications Of List Decoding To Tracing Traitors, Alice Silverberg, Jessica Staddon, Judy L. Walker

Department of Mathematics: Faculty Publications

We apply results from algebraic coding theory to solve problems in cryptography, by using recent results on list decoding of error-correcting codes to efficiently find traitors who collude to create pirates. We produce schemes for which the TA (traceability) traitor tracing algorithm is very fast. We compare the TA and IPP (identifiable parent property) traitor tracing algorithms, and give evidence that when using an algebraic structure, the ability to trace traitors with the IPP algorithm implies the ability to trace with the TA algorithm. We also demonstrate that list decoding techniques can be used to find all possible pirate coalitions. …

Homogeneous Weights And Exponential Sums, José Felipe Voloch, Judy L. Walker

Department of Mathematics: Faculty Publications

In this paper, we give a formula as an exponential sum for a homogeneous weight defined by Constantinescu and Heise [3] in the case of Galois rings (or equivalently, rings of Witt vectors) and use this formula to estimate the weight of codes obtained from algebraic geometric codes over rings.

Finite Subsets Of The Plane Are 18-Reconstructible, L. Pebody, A. J. Radcliffe, A. D. Scott

Department of Mathematics: Faculty Publications

We prove that every finite subset of the plane is reconstructible from the multiset of its subsets of at most 18 points, each given up to rigid motion. We also give some results concerning the reconstructibility of infinite subsets of the plane.

Integral Transforms Of Functionals In L2(C0[0, T]), Byoung Soo Kim, David Skough

Department of Mathematics: Faculty Publications

In this paper we give a necessary and sufficient condition that a functional F(x) in L₂(C₀[0, T]) has an integral transform F_α,βF(x) which also belongs to L₂(C₀[0, T]).

Automatic Closure Of Invariant Linear Manifolds For Operator Algebras, Allan P. Donsig, Alan Hopenwasser, David R. Pitts

Department of Mathematics: Faculty Publications

Kadison's transitivity theorem implies that, for irreducible representations of C*-algebras, every invariant linear manifold is closed. It is known that CSL algebras have this property if, and only if, the lattice is hyperatomic (every projection is generated by a nite number of atoms). We show several other conditions are equivalent, including the condition that every invariant linear manifold is singly generated.

We show that two families of norm closed operator algebras have this property. First, let L be a CSL and suppose A is a norm closed algebra which is weakly dense in Alg L and is a bimodule over …

Constructing Critical Indecomposable Codes, Judy L. Walker

Department of Mathematics: Faculty Publications

Critical indecomposable codes were introduced by Assmus, who also gave a recursive construction for these objects. One of the key ingredients in the construction is an auxiliary code, which is an indecomposable code of minimum distance at least 3. In terms of actually being able to construct all critical indecomposable codes, however, Assmus leaves many unanswered questions about these auxiliary codes. In this paper, we provide answers to these questions, including a description of when two equivalent auxiliary codes can yield inequivalent critical indecomposable codes, and results on both the minimum length and the maximum number of critical columns of …

A Critical Look At Self-Dual Codes, Judy L. Walker

Department of Mathematics: Faculty Publications

We investigate self-dual codes from a structural point of view. In particular, we study properties of critical indecomposable codes which appear in the spectrum of a self-dual code. As an application of the results we obtain, we revisit the study of self-dual codes of dimension at most 10.

In the late 1950’s, Slepian [4] became the first to take an abstract approach to the study of error-correcting codes. He introduced a structure theory for binary linear codes, developing in particular the idea of an indecomposable code; that is, a code which is not isomorphic to a nontrivial direct sum of …

Efficient Traitor Tracing Algorithms Using List Decoding, Alice Silverberg, Jessica Staddon, Judy L. Walker

Department of Mathematics: Faculty Publications

We use powerful new techniques for list decoding error-correcting codes to efficiently trace traitors. Although much work has focused on constructing traceability schemes, the complexity of the tracing algorithm has received little attention. Because the TA tracing algorithm has a runtime of O(N) in general, where N is the number of users, it is inefficient for large populations.We produce schemes for which the TA algorithm is very fast. The IPP tracing algorithm, though less efficient, can list all coalitions capable of constructing a given pirate. We give evidence that when using an algebraic structure, the ability to …

The Structure Of Free Semigroup Algebras, Kenneth R. Davidson, Elias Katsoulis, David R. Pitts

Department of Mathematics: Faculty Publications

A free semigroup algebra is WOT-closed algebra generated by an n-tuple of isometries with pairwise orthogonal ranges. The interest in these algebras arises primarily from two of their interesting features. The first is that they provide useful information about unitary invariants of representations of the Cuntz-Toeplitz algebras. The second is that they form a class of nonself-adjoint operator algebras which are of interest in their own right. This class contains a distinguished representative, the "non-commutative Toeplitz algebra", which is generated by the left regular representation of the free semigroup on n letters and denoted . This paper provides a general …

Euclidean Weights Of Codes From Elliptic Curves Over Rings, José Felipe Voloch, Judy L. Walker

Department of Mathematics: Faculty Publications

We construct certain error-correcting codes over finite rings and estimate their parameters. For this purpose, we need to develop some tools, notably an estimate for certain exponential sums and some results on canonical lifts of elliptic curves. These results may be of independent interest.

A code is a subset of Aⁿ, where A is a finite set (called the alphabet). Usually A is just the field of two elements and, in this case, one speaks of binary codes. Such codes are used in applications where one transmits information through noisy channels. By building redundancy into the code, transmitted …

Two-Groups With Few Conjugacy Classes, Nigel Boston, Judy L. Walker

Department of Mathematics: Faculty Publications

An old question of Brauer asking how fast numbers of conjugacy classes grow is investigated by considering the least number c_n of conjugacy classes in a group of order 2ⁿ. The numbers c_n are computed for n ≤ 14 and a lower bound is given for c₁₅. It is observed that c_n grows very slowly except for occasional large jumps corresponding to an increase in coclass of the minimal groups G_n. Restricting to groups that are 2-generated or have coclass at most 3 allows us to extend these computations.

Translation Theorems For Fourier-Feynman Transforms And Conditional Fourier-Feynman Transforms, Seung Jun Change, Chull Park, David Skough

Department of Mathematics: Faculty Publications

Translation theorems for Wiener integrals were given by Cameron and Martin in [3] and by Cameron and Graves in [2]. Translation theorems for analytic Feynman integrals were given by Cameron and Storvick in [4], [7] and translation theorems for Feynman integrals on abstract Wiener and Hilbert spaces were given by Chung and Kang in [12].

Codes And Curves, Judy L. Walker

Department of Mathematics: Faculty Publications

When information is transmitted, errors are likely to occur. Coding theory examines effi cient ways of packaging data so that these errors can be detected, or even corrected. The traditional tools of coding theory have come from combinatorics and group theory. Lately, however, coding theorists have added techniques from algebraic geometry to their toolboxes. In particular, by re-interpreting the Reed- Solomon codes, one can see how to defi ne new codes based on divisors on algebraic curves. For instance, using modular curves over fi nite fi elds, Tsfasman, Vladut, and Zink showed that one can defi ne a sequence of …

Codes Over Rings From Curves Of Higher Genus, José Felipe Voloch, Judy L. Walker

Department of Mathematics: Faculty Publications

We construct certain error-correcting codes over finite rings and estimate their parameters. These codes are constructed using plane curves and the estimates for their parameters rely on constructing “lifts” of these curves and then estimating the size of certain exponential sums.

THE purpose of this paper is to construct certain error-correcting codes over finite rings and estimate their parameters. For this purpose, we need to develop some tools; notably, an estimate for the dimension of trace codes over rings (generalizing work of van der Vlugt over fields and some results on lifts of affin curves from field of characteristic p …

Reconstructing Subsets Of Reals, A. J. Radcliffe, A. D. Scott

Department of Mathematics: Faculty Publications

We consider the problem of reconstructing a set of real numbers up to translation from the multiset of its subsets of fixed size, given up to translation. This is impossible in general: for instance almost all subsets of Z contain infinitely many translates of every finite subset of Z. We therefore restrict our attention to subsets of R which are locally finite; those which contain only finitely many translates of any given finite set of size at least 2. We prove that every locally finite subset of R is reconstructible from the multiset of its 3-subsets, given up to …

Algebraic Geometric Codes Over Rings, Judy L. Walker

Department of Mathematics: Faculty Publications

The techniques of algebraic geometry have been widely and successfully applied to the study of linear codes over finite fields since the early 1980’s. Recently, there has been an increased interest in the study of linear codes over finite rings. In this paper, we combine these two approaches to coding theory by introducing the study of algebraic geometric codes over rings. In addition to defining these new codes, we prove several results about their properties.

Relationships Among The First Variation, The Convolution Product, And The Fourier-Feynman Transform, Chull Park, David Skough, David Storvick

Department of Mathematics: Faculty Publications

In this paper we examine the various relationships that exist among the first variation, the Fourier- Feynman transform, and the convolution product for functionals on Wiener space that belong to a Banach algebra S.

Lee Weights Of Z/4z-Codes From Elliptic Curves, José Felipe Voloch, Judy L. Walker

Department of Mathematics: Faculty Publications

In [15: J. L. Walker, Algebraic geometric codes over rings], the second author defined algebraic geometric codes over rings. This definition was motivated by two recent trends in coding theory: the study of algebraic geometric codes over finite fields, and the study of codes over rings. In that paper, many of the basic parameters of these new codes were computed. However, the Lee weight, which is very important for codes over the ring Z/4Z, was not considered. In [14: J.-F. Voloch and J. L. Walker, Euclidean weights of codes from elliptic curves over rings], this …

Invariant Subspaces And Hyper-Reflexivity For Free Semigroup Algebras, Kenneth R. Davidson, David R. Pitts

Department of Mathematics: Faculty Publications

In this paper, we obtain a complete description of the invariant subspace structure of an interesting new class of algebras which we call free semigroup algebras. This enables us to prove that they are reflexive, and moreover to obtain a quantitative measure of the distance to these algebras in terms of the invariant subspaces. Such algebras are called hyper-reflexive. This property is very strong, but it has been established in only a very few cases. Moreover the prototypes of this class of algebras are the natural candidate for a non-commutative analytic Toeplitz algebra on n variables. The case we make …

The Nordstrom–Robinson Code Is Algebraic-Geometric, Judy L. Walker

Department of Mathematics: Faculty Publications

The techniques of algebraic geometry have been widely and successfully applied to the study of linear codes over finite field since the early 1980’s. Recently, there has been an increased interest in the study of linear codes over finite rings. In a previous paper [10], we combined these two approaches to coding theory by introducing and studying algebraic-geometric codes over rings. In this correspondence, we show that the Nordstrom–Robinson code is the image under the Gray mapping of an algebraic geometric code over Z = 4Z.