Generalized hamming weights and equivalences of codes

It is proved that any linear isomorphism between two linear codes which preserves a generalizedHamming weight is a monomial equivalence.which is an extension of a theorem of MacWilliams.     

Error detection capability of shortened hamming codes and their dual codes

1. IntroductionIn ant omat ic--rep eat-- request (ARQ ) error- cont rol syst em 3 t he u-ndet ect ed error probability (UEP) of an error-detecting code is one of the most importallt performance characteristics. There are a number of papers dedicated to examining the error detection capabilityfor some well known classes of linear codes, suCh as Reed-Solomon codes, BCH codes andReed-Muller codes. For a general introduction to the theory of error detecting codes, werefer the readers to [if …     

On the compact-open and admissible topologies

It is known (see, for example, [H. Render, Nonstandard topology on function spaces with applications to hyperspaces, Trans. Amer. Math. Soc. 336 (1) (1993) 101-119; M. Escardo, J. Lawson, A. Simpson, Comparing cartesian closed categories of (core) compactly generated spaces, Topology Appl. 143 (2004) 105-145; D.N. Georgiou, S.D. Iliadis, F. Mynard, Function space topologies, in: Open Problems in Topology 2, Elsevier, 2007, pp. 15-23]) that the intersection of all admissible topologies on the set C(Y,Z) of all continuous maps of an arbitrary space Y into an arbitrary space Z, is always the greatest splitting topology (which in general is not admissible). The following, interesting in our opinion, problem is arised: when a given splitting topology (for example, the compact-open topology, the Isbell topology, and the greatest splitting topology) is the intersection of k admissible topologies, where k is a finite number. Of course, in this case this splitting topology will be the greatest splitting.In the case, where a given splitting topology is admissible the above number k is equal to one. For example, if Y is a locally compact Hausdorff space, then k=1 for the compact-open topology (see [R.H. Fox, On topologies for function spaces, Bull. Amer. Math. Soc. 51 (1945) 429-432; R. Arens, A topology for spaces of transformations, Ann. of Math. 47 (1946) 480-495; R. Arens, J. Dugundji, Topologies for function spaces, Pacific J. Math. 1 (1951) 5-31]). Also, if Y is a corecompact space, then k=1 for the Isbell topology (see [P. Lambrinos, B.K. Papadopoulos, The (strong) Isbell topology and (weakly) continuous lattices, in: Continuous Lattices and Applications, in: Lect. Notes Pure Appl. Math., vol. 101, Marcel Dekker, New York, 1984, pp. 191-211; F. Schwarz, S. Weck, Scott topology, Isbell topology, and continuous convergence, in: Lect. Notes Pure Appl. Math., vol. 101, Marcel Dekker, New York, 1984, pp. 251-271]).In [R. Arens, J. Dugundji, Topologies for function spaces, Pacific J. Math. 1 (1951) 5-31] a non-locally compact completely regular space Y is constructed such that the compact-open topology on C(Y,S), where S is the Sierpinski space, coincides with the greatest splitting topology (which is not admissible). This fact is proved by the construction of two admissible topologies on C(Y,S) whose intersection is the compact-open topology, that is k=2.In the present paper improving the method of [R. Arens, J. Dugundji, Topologies for function spaces, Pacific J. Math. 1 (1951) 5-31] we construct some other non-locally compact spaces Y such that the compact-open topology on C(Y,S) is the intersection of two admissible topologies. Also, we give some concrete problems concerning the above arised general problem.     

On admissible constellations of consecutive primes

Admissible constellations of primes are patterns which, like the twin primes, no simple divisibility relation would prevent from being repeated indefinitely in the series of primes. All admissible constellations, formed ofconsecutive primes, beginning with a prime <1000, are established, and some properties of such constellations in general are conjectured.Dedicated to Peter Naur on the occasion of his 60th birthday     

On the structure of the set of admissible perturbations

Translated from Teoriya Funktsii, Funktsional'nyi Analiz i Ikh Prilozheniya, No. 53, pp. 79–87, 1990.     

On perfect codes in the hamming schemes H(n, q) with q arbitrary

For each e ? 3, there are at most finitely many nontrivial perfect e-codes in the Hamming schemes H(n, q) where n and q are arbitrary.     

On existence of admissible and weakly admissible limits for functions of several complex variables

Kishinev. Translated fromSibirski Matematicheski Zhurnal, Vol. 33, No. 4, pp. 212–214, July–August, 1992.     

On admissible perturbations for exponential dichotomy

In this work we obtain an optimal upper bound for exponential dichotomy roughness in infinite-dimensional Banach spaces. Unlike some previous works, we do not assume bounded growth. We consider linear, non-autonomous ordinary differential equations with bounded and unbounded coefficients.     

On admissible shifts of generalized white noises

Let $\text{S}$ be the Schwartz space of rapidly decreasing real functions. The dual space $\text{S}$¹ consists of the tempered distributions and the relation $\text{S}$ ? L²($\text{R}$) ? $\text{S}$¹ holds. Let γ be the Gaussian white noise on $\text{S}$¹ with the characteristic functional $\text{γ}\text{(ξ) =}\text{exp}\text{{?∥ξ∥}{}^2\text{/2}}$, ξ ∈ $\text{S}$, where ∥·∥ is the L²($\text{R}$)-norm. Let ν be the Poisson white noise on $\text{S}$¹ with the characteristic functional $\text{ν}\text{(ξ)}$ = exp?_$\text{R}$∫_$\text{R}$ {[exp(iξ(t)u)] ? 1 ? (1 + u²)^?1(iξ(t)u)} dη(u)dt), ξ ∈ $\text{S}$, where the Lévy measure is assumed to satisfy the condition ∫_$\text{R}$u²dη(u) < ∞. It is proved that γ1ν has the same dichotomy property for shifts as the Gaussian white noise, i.e., for any ω ∈ $\text{S}$¹, the shift $\text{(γ1ν)}{}_{\mathrm{\omega }}$ of γ1ν by ω and γ1ν are either equivalent or orthogonal. They are equivalent if and only if when ω ∈ L²($\text{R}$) and the Radon-Nikodym derivative is derived. It is also proved that for the Poisson white noice ν_ω is orthogonal to ν for any non-zero ω in $\text{S}$¹.     

On perturbations of strongly admissible prior distributions

Consider a parametric statistical model, P(dx|θ), and an improper prior distribution, ν(dθ), that together yield a (proper) formal posterior distribution, Q(dθ|x). The prior is called strongly admissible if the generalized Bayes estimator of every bounded function of θ is admissible under squared error loss. Eaton [M.L. Eaton, A statistical diptych: Admissible inferences-recurrence of symmetric Markov chains, Annals of Statistics 20 (1992) 1147–1179] used the Blyth–Stein Lemma to develop a sufficient condition, call it , for strong admissibility of ν. Our main result says that, under mild regularity conditions, if ν satisfies and g(θ) is a bounded, non-negative function, then the perturbed prior distribution g(θ)ν(dθ) also satisfies and is therefore strongly admissible. Our proof has three basic components: (i) Eaton's [M.L. Eaton, A statistical diptych: Admissible inferences-recurrence of symmetric Markov chains, Annals of Statistics 20 (1992) 1147–1179] result that the condition is equivalent to the local recurrence of the Markov chain whose transition function is R(dθ|η)=∫Q(dθ|x)P(dx|η); (ii) a new result for general state space Markov chains giving conditions under which local recurrence is equivalent to recurrence; and (iii) a new generalization of Hobert and Robert's [J.P. Hobert, C.P. Robert, Eaton's Markov chain, its conjugate partner and -admissibility, Annals of Statistics 27 (1999) 361–373] result that says Eaton's Markov chain is recurrent if and only if the chain with transition function is recurrent. One important application of our results involves the construction of strongly admissible prior distributions for estimation problems with restricted parameter spaces.     

Constructions of new families of nonbinary CSS codes

New families of good q-ary (q is an odd prime power) Calderbank-Shor-Steane (CSS) quantum codes derived from two distinct classical Bose-Chaudhuri-Hocquenghem (BCH) codes, not necessarily self-orthogonal, are constructed. These new families consist of CSS codes whose parameters are better than the ones available in the literature and comparable to the parameters of quantum BCH codes generated by applying the q-ary Steane’s enlargement of CSS codes.