相关论文: An Elementary Approach to MacWilliams Extension Pr…
Let $\mathbf{H}$ be the cartesian product of a family of left modules over a ring $S$, indexed by a finite set $\Omega$. We are concerned with the $(\mathbf{P},\omega)$-weight on $\mathbf{H}$, where…
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…
The Equivalence Theorem states that, for a given weight on the alphabet, every linear isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets,…
In the 1960s, MacWilliams proved that the Hamming weight enumerator of a linear code over a finite field completely determines, and is determined by, the Hamming weight enumerator of its dual code. In particular, if two linear codes have…
In this paper we study codes where the alphabet is a finite Frobenius bimodule over a finite ring. We discuss the extension property for various weight functions. Employing an entirely character-theoretic approach and a duality theory for…
The MacWilliams extension theorem is investigated for various weight functions over finite Frobenius rings. The problem is reformulated in terms of a local-global property for subgroups of the general linear group. Among other things, it is…
In this paper, we consider codes over finite fields, finite abelian groups, and finite Frobenius rings. For such codes, the complete weight enumerator and the Hamming weight enumerator serve as powerful tools. These two types of weight…
Let $\mathbb F$ be a finite field and let $\mathcal A$ and $\mathcal B$ be vector spaces of $\mathbb F$-valued continuous functions defined on locally compact spaces $X$ and $Y$, respectively. We look at the representation of linear…
This paper investigates the relationship between the rank weight distribution of a linear code and that of its dual code. The main result of this paper is that, similar to the MacWilliams identity for the Hamming metric, the rank weight…
In this paper, we present the harmonic generalizations of well-known polynomials of codes over finite fields, namely the higher weight enumerators and the extended weight enumerators, and we derive the correspondences between these weight…
The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In this paper, we derive the MacWilliams identity for linear…
Error-correcting codes have an important role in data storage and transmission and in cryptography, particularly in the post-quantum era. Hermitian matrices over finite fields and equipped with the rank metric have the potential to offer…
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…
The weight generating functions associated with convolutional codes (CCs) are based on state space realizations or the weight adjacency matrices (WAMs). The MacWilliams identity for CCs on the WAMs was first established by Gluesing-…
This work develops new foundations for the theory of linear codes over local Artinian commutative rings. We use algebraic invariants such as the socle, type, length, and minimal number of generators to measure the size of codes. We prove a…
A characterization of module alphabets with the Hamming weight EP (abbreviation for Extension Property) had been settled. A thoughtfully constructed example by J.A.Wood finished the tour. Frobenius bimodules were proved to satisfy the EP…
Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…
We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of…
We study sequences of linear or affine codes with uniform weight spectrum, i.e., a part of codewords with any fixed weight tends to zero. It is proved that a sequence of linear codes has a uniform weight spectrum if the number of vectors…
We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…