Related papers: On weak isometries of Preparata codes
For a linear code $C$ over a finite field, if its dual code $C^{\perp}$ is equivalent to itself, then the code $C$ is said to be {\it isometry-dual}. In this paper, we first confirm a conjecture about the isometry-dual MDS elliptic codes…
In this paper, we introduce a weakening of the Freiman isomorphisms between subsets of non necessarily abelian groups. Inspired by the breakthrough result of Kravitz, [14], on cyclic groups, as a first application, we prove that any subset…
A weak homomorphism from a graph G to a graph H is a mapping f from V(G) to V(H), where either f(x) = f(y) or {f(x), f(y)} is an element of E(H), and this holds for all {x, y} in E(G). A rectangular grid graph is formed by taking the…
We consider the punctured plane with volume density $|x|^\alpha$ and perimeter density $|x|^\beta$. We show that centred balls are uniquely isoperimetric for indices $(\alpha,\beta)$ which satisfy the conditions $\alpha-\beta+1>0$,…
There is no supercyclic power bounded operator of class $C_{1{\textstyle\cdot}}.$ There exist, however, weakly l-sequentially supercyclic unitary operators$.$ We show that if $T$ is a weakly l-sequentially supercyclic power bounded operator…
A closed curve in the plane is weakly simple if it is the limit (in the Fr\'echet metric) of a sequence of simple closed curves. We describe an algorithm to determine whether a closed walk of length n in a simple plane graph is weakly…
Any two compact, complete, one-dimensional geodesic spaces with identical marked length spectrum have isometric $\pi_1$-hull. The present version contains errors, notably in Lemmas 2.2 and 2.3 (path cancellations can be more complicated),…
The problem of identifying whether the family of cyclic codes is asymptotically good or not is a long-standing open problem in the field of coding theory. It is known in the literature that some families of cyclic codes such as BCH codes…
From cosets of binary Hamming codes we construct diameter perfect constant-weight ternary codes with weight $n-1$ (where $n$ is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before. Keywords:…
We call a linear code $C$ with length $n$ over a field $F$, a linear complementary equi-dual code, when there exists a linear code $D$ over $F$ such that $D$ is permutation equivalent to $C^\perp$ and $(C,D)$ is a linear complementary pair…
Nested code pairs play a crucial role in the construction of ramp secret sharing schemes [Kurihara et al. 2012] and in the CSS construction of quantum codes [Ketkar et al. 2006]. The important parameters are (1) the codimension, (2) the…
We show that ||u*u - v*v|| \leq ||u - v|| for partial isometries u and v. There is a stronger inequality if both u and v are extreme points of the unit ball of a C*-algebra, and both inequalities are sharp. If u and v are partial isometries…
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…
A classical counterexample due to E. De Giorgi, shows that the weak maximum principle does not remain true for general linear elliptic differential systems. After that, there are some efforts to establish the weak maximum principle for…
The aim of this paper is to prove the existence of common fixed points for a pair of weakly compatible selfmaps satisfying weakly contractive condition and property (E. A). In this context, first we modify Beg and Abbas theorem (\cite{Beg},…
Binary cyclic codes are worth studying due to their applications and theoretical importance. It is an important problem to construct an infinite family of cyclic codes with large minimum distance $d$ and dual distance $d^{\perp}$. In recent…
In this letter we consider the ensemble of codes formed by the serial concatenation of a Hamming code and two accumulate codes. We show that this ensemble is asymptotically good, in the sense that most codes in the ensemble have minimum…
We express the weight enumerators of self-dual and doubly even (Type II for short) codes of length $24$ with a specified basis. As a consequence, we present some congruence relations among the weight enumerators.
A map $f:X\to Y$ between topological spaces is called weakly discontinuous if each subspace $A\subset X$ contains an open dense subspace $U\subset A$ such that the restriction $f|U$ is continuous. A bijective map $f:X\to Y$ between…
Previously, self-dual codes have been constructed from weighing matrices, and in particular from conference matrices (skew and symmetric). In this paper, codes constructed from matrices of skew symmetric type whose determinants reach the…