243 research outputs found
MacWilliams' Extension Theorem for Bi-Invariant Weights over Finite Principal Ideal Rings
A finite ring R and a weight w on R satisfy the Extension Property if every
R-linear w-isometry between two R-linear codes in R^n extends to a monomial
transformation of R^n that preserves w. MacWilliams proved that finite fields
with the Hamming weight satisfy the Extension Property. It is known that finite
Frobenius rings with either the Hamming weight or the homogeneous weight
satisfy the Extension Property. Conversely, if a finite ring with the Hamming
or homogeneous weight satisfies the Extension Property, then the ring is
Frobenius.
This paper addresses the question of a characterization of all bi-invariant
weights on a finite ring that satisfy the Extension Property. Having solved
this question in previous papers for all direct products of finite chain rings
and for matrix rings, we have now arrived at a characterization of these
weights for finite principal ideal rings, which form a large subclass of the
finite Frobenius rings. We do not assume commutativity of the rings in
question.Comment: 12 page
Fourier-Reflexive Partitions and MacWilliams Identities for Additive Codes
A partition of a finite abelian group gives rise to a dual partition on the
character group via the Fourier transform. Properties of the dual partitions
are investigated and a convenient test is given for the case that the bidual
partition coincides the primal partition. Such partitions permit MacWilliams
identities for the partition enumerators of additive codes. It is shown that
dualization commutes with taking products and symmetrized products of
partitions on cartesian powers of the given group. After translating the
results to Frobenius rings, which are identified with their character module,
the approach is applied to partitions that arise from poset structures
The Packing Radius of a Code and Partitioning Problems: the Case for Poset Metrics
Until this work, the packing radius of a poset code was only known in the
cases where the poset was a chain, a hierarchy, a union of disjoint chains of
the same size, and for some families of codes. Our objective is to approach the
general case of any poset. To do this, we will divide the problem into two
parts.
The first part consists in finding the packing radius of a single vector. We
will show that this is equivalent to a generalization of a famous NP-hard
problem known as "the partition problem". Then, we will review the main results
known about this problem giving special attention to the algorithms to solve
it. The main ingredient to these algorithms is what is known as the
differentiating method, and therefore, we will extend it to the general case.
The second part consists in finding the vector that determines the packing
radius of the code. For this, we will show how it is sometimes possible to
compare the packing radius of two vectors without calculating them explicitly
Level Eulerian Posets
The notion of level posets is introduced. This class of infinite posets has
the property that between every two adjacent ranks the same bipartite graph
occurs. When the adjacency matrix is indecomposable, we determine the length of
the longest interval one needs to check to verify Eulerianness. Furthermore, we
show that every level Eulerian poset associated to an indecomposable matrix has
even order. A condition for verifying shellability is introduced and is
automated using the algebra of walks. Applying the Skolem--Mahler--Lech
theorem, the -series of a level poset is shown to be a rational
generating function in the non-commutative variables and .
In the case the poset is also Eulerian, the analogous result holds for the
-series. Using coalgebraic techniques a method is developed to
recognize the -series matrix of a level Eulerian poset
- …