Related papers: $\ell$-Complementary Subspaces and Codes in Finite…
We analyse wave propagation in two-dimensional bianisotropic media with the Finite Element Method (FEM). We start from the Maxwell-Tellegen's equations in bianisotropic media, and derive some system of coupled Partial Difference Equations…
This work comprises a detailed theoretical and computational study of the boundary value problem for transversely isotropic linear elastic bodies. General conditions for well-posedness are derived in terms of the material parameters. The…
A $\lambda$-fold $r$-packing (multiple radius-$r$ covering) in a Hamming metric space is a code $C$ such that the radius-$r$ balls centered in $C$ cover each vertex of the space by not more (not less, respectively) than $\lambda$ times. The…
Linear complementary dual codes were defined by Massey in 1992, and were used to give an optimum linear coding solution for the two user binary adder channel. In this paper, we define the analog of LCD codes over fields in the ambient space…
One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics -…
Perfect codes are arguably the most fascinating structures in combinatorial coding theory, and their classification and weight distribution are of considerable interest. This classification also involves the analysis of some related…
We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a…
We study perfect error-correcting codes in $\mathbb{Z}^n$ for the symmetric limited-magnitude error channel, where at most $e$ coordinates of an integer vector may be altered by a value whose magnitude is at most $s$. Geometrically, such…
Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of a binary linear code. The information sets and the minimum distance…
Intersecting codes are linear codes where every two nonzero codewords have non-trivially intersecting support. In this article we expand on the theory of this family of codes, by showing that nondegenerate intersecting codes correspond to…
Linear codes with large minimal distances are important error correcting codes in information theory.Orthogonal codes have more applications in the other fields of mathematics. In this paper, we study the binary and ternary orthogonal codes…
As a result of their applications in network coding, space-time coding, and coding for criss-cross errors, matrix codes have garnered significant attention; in various contexts, these codes have also been termed rank-metric codes,…
Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…
The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight enumerators of special cases, such as self-dual codes and…
Using ambient space we develop a fully gauge and o(d,2) covariant approach to boundary values of AdS(d+1) gauge fields. It is applied to the study of (partially) massless fields in the bulk and (higher-order) conformal scalars, i.e.…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures and constructions are stated. The existence problem is also discussed and known results for some particular cases are…
Singularities hidden in the collinear region around an external massless leg may lead to conformal symmetry breaking in otherwise conformally invariant finite loop momentum integrals. For an $\ell$-loop integral, this mechanism leads to a…