اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe poset metrics that allow binary codes of codimension m to be m-, (m-1)-, or (m-2)-perfect
133
0
0.0
(
0
)
تأليف
Hyun Kwang Kim
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A binary poset code of codimension M (of cardinality 2^{N-M}, where N is the code length) can correct maximum M errors. All possible poset metrics that allow codes of codimension M to be M-, (M-1)- or (M-2)-perfect are described. Some general conditions on a poset which guarantee the nonexistence of perfect poset codes are derived; as examples, we prove the nonexistence of R-perfect poset codes for some R in the case of the crown poset and in the case of the union of disjoin chains. Index terms: perfect codes, poset codes
قيم البحث
اقرأ أيضاً
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index, $m$. Such polygons are called emph{$m$-convex} polygons and are characterised by having up to $
m$ indentations in the side. We use a `divide and conquer approach, factorising 2-convex polygons by extending a line along the base of its indents. We then use the inclusion-exclusion principle, the Hadamard product and extensions to known methods to derive the generating functions for each case.
In recent work, G. E. Andrews and G. Simay prove a surprising relation involving parity palindromic compositions, and ask whether a combinatorial proof can be found. We extend their results to a more general class of compositions that are palindromic
modulo $m$, that includes the parity palindromic case when $m=2$. We then provide combinatorial proofs for the cases $m=2$ and $m=3$.
Given a graph whose edges are labeled by ideals in a ring, a generalized spline is a labeling of each vertex by a ring element so that adjacent vertices differ by an element of the ideal associated to the edge. We study splines over the ring Z/mZ. Pr
evious work considered splines over domains, in which very different phenomena occur. For instance when the ring is the integers, the elements of bases for spline modules are indexed by the vertices of the graph. However we prove that over Z/mZ spline modules can essentially have any rank between 1 and n. Using the classification of finite Z-modules, we begin the work of classifying splines over Z/mZ and produce minimum generating sets for splines on cycles over Z/mZ. We close with many open questions.
A set $X$ in the Euclidean space $mathbb{R}^d$ is called an $m$-distance set if the set of Euclidean distances between two distinct points in $X$ has size $m$. An $m$-distance set $X$ in $mathbb{R}^d$ is said to be maximal if there does not exist a v
ector $x$ in $mathbb{R}^d$ such that the union of $X$ and ${x}$ still has only $m$ distances. Bannai--Sato--Shigezumi (2012) investigated the maximal $m$-distance sets which contain the Euclidean representation of the Johnson graph $J(n,m)$. In this paper, we consider the same problem for the Hamming graph $H(n,m)$. The Euclidean representation of $H(n,m)$ is an $m$-distance set in $mathbb{R}^{m(n-1)}$. We prove that the maximum $n$ is $m^2 + m - 1$ such that the representation of $H(n,m)$ is not maximal as an $m$-distance set. Moreover we classify the largest $m$-distance sets which contain the representation of $H(n,m)$ for $mleq 4$ and any $n$. We also classify the maximal $2$-distance sets in $mathbb{R}^{2n-1}$ which contain the representation of $H(n,2)$ for any $n$.
Goldman, Joichi, and White proved a beautiful theorem showing that the falling factorial generating function for the rook numbers of a Ferrers board factors over the integers. Briggs and Remmel studied an analogue of rook placements where rows are re
placed by sets of $m$ rows called levels. They proved a version of the factorization theorem in that setting, but only for certain Ferrers boards. We generalize this result to any Ferrers board as well as giving a p,q-analogue. We also consider a dual situation involving weighted file placements which permit more than one rook in the same row. In both settings, we discuss properties of the resulting equivalence classes such as the number of elements in a class. In addition, we prove analogues of a theorem of Foata and Schutzenberger giving a distinguished representative in each class as well as make connections with the q,t-Catalan numbers. We end with some open questions raised by this work.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
