ترغب بنشر مسار تعليمي؟ اضغط هنا

Perfect truncated-metric codes and a union of ternary squares expanding the square lattice

54   0   0.0 ( 0 )
 نشر من قبل Italo Dejter Prof
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Perfect truncated-metric codes (PTMCs) in the $n$-dimensio-nal grid $Lambda_n$ of $mathbb{Z}^n$ ($0<ninmathbb{Z}$) and its quotient toroidal grids were obtained via the truncated distance $rho(u,v)$ in $mathbb{Z}^n$ given between vertices $u=(u_1,cdots,u_n)inmathbb{Z}^n$ and $v=(v_1, ldots,v_n)inmathbb{Z}^n$ as the Hamming distance $h(u,v)$ in $mathbb{Z}^n$ (or graph distance $h(u,v)$ in $Lambda_n$) if $|u_i-v_i|le 1$, for all $iin{1, ldots,n}$, and as $n+1$, otherwise. While this $rho$ is related to the $ell_p$ metrics, PTMCs associated with lattice tilings of $mathbb{Z}^n$ were recently worked upon as rainbow perfect dominating sets. Now, PTMCs are extended to ternary compounds $Gamma_n$ obtained by glueing, or locking, ternary $n$-cubes along their codimension 1 ternary subcubes. Such compounds may be taken as alternate reality graphs, since they offer a third option in each coordinate direction at each vertex. We ascertain the existence of an infinite number of isolated PTMC of radius 2 in $Gamma_n$ for $n=2$ and conjecture such existence for $n>2$ with radius $n$. We ask whether there exists a suitable notion replacing that of quotient toroidal grids of $Lambda_n$ for the case of $Gamma_n$.



قيم البحث

اقرأ أيضاً

We investigate perfect codes in $mathbb{Z}^n$ under the $ell_p$ metric. Upper bounds for the packing radius $r$ of a linear perfect code, in terms of the metric parameter $p$ and the dimension $n$ are derived. For $p = 2$ and $n = 2, 3$, we determine all radii for which there are linear perfect codes. The non-existence results for codes in $mathbb{Z}^n$ presented here imply non-existence results for codes over finite alphabets $mathbb{Z}_q$, when the alphabet size is large enough, and has implications on some recent constructions of spherical codes.
We describe odd-length-cube tilings of the n-dimensional q-ary torus what includes q-periodic integer lattice tilings of R^n. In the language of coding theory these tilings correspond to perfect codes with respect to the maximum metric. A complete ch aracterization of the two-dimensional tillings is presented and in the linear case, a description of general matrices, isometry and isomorphism classes is provided. Several methods to construct perfect codes from codes of smaller dimension or via sections are derived. We introduce a special type of matrices (perfect matrices) which are in correspondence with generator matrices for linear perfect codes in arbitrary dimensions. For maximal perfect codes, a parametrization obtained allows to describe isomorphism classes of such codes. We also approach the problem of what isomorphism classes of abelian groups can be represented by q-ary n-dimensional perfect codes of a given cardinality N.
We define the rank-metric zeta function of a code as a generating function of its normalized $q$-binomial moments. We show that, as in the Hamming case, the zeta function gives a generating function for the weight enumerators of rank-metric codes. We further prove a functional equation and derive an upper bound for the minimum distance in terms of the reciprocal roots of the zeta function. Finally, we show invariance under suitable puncturing and shortening operators and study the distribution of zeroes of the zeta function for a family of codes.
A new quantum spin model with frustration, the `Union Jack model on the square lattice, is analyzed using spin-wave theory. For small values of the frustrating coupling $alpha$, the system is N{ e}el ordered as usual, while for large $alpha$ the frus tration is found to induce a canted phase. The possibility of an intermediate spin-liquid phase is discussed.
In this paper we study properties and invariants of matrix codes endowed with the rank metric, and relate them to the covering radius. We introduce new tools for the analysis of rank-metric codes, such as puncturing and shortening constructions. We g ive upper bounds on the covering radius of a code by applying different combinatorial methods. We apply the various bounds to the classes of maximal rank distance and quasi maximal rank distance codes.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا