Related papers: A duality for nonabelian group codes
Through the notion of weakly sound class of weights, we recover many known dualities involving accessible categories with a chosen class of limits, as instances of a general duality theorem. These include the Gabriel-Ulmer duality for…
We extend Ravagnani's MacWilliams duality theory to the settings of rank metric codes over finite chain rings, relating the sequences of $q$-binomial moments of a rank metric code over this class of rings with those of its dual.
Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes…
Non--Abelian duality in relation to supersymmetry is examined. When the action of the isometry group on the complex structures is non--trivial, extended supersymmetry is realized non--locally after duality, using path ordered Wilson lines.…
In $1991$, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei's duality theorem has since been extensively studied from different…
Past few years have seen an extensive use of RAM chips with wide I/O data (e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an $m$-spotty byte error, which can be…
Let $\mathbb{F}_q$ be a finite field of characteristic not equal to $2$ or $3$. We compute the weight enumerators of some projective and affine Reed-Muller codes of order $3$ over $\mathbb{F}_q$. These weight enumerators answer enumerative…
In this paper we present a new method for finding the weight enumerator of binary linear block codes by using genetic algorithms. This method consists in finding the binary weight enumerator of the code and its dual and to create from the…
Cyclic codes have efficient encoding and decoding algorithms. The decoding error probability and the undetected error probability are usually bounded by or given from the weight distributions of the codes. Most researches are about the…
In this paper, we study linear codes over $\mathbb{Z}_k$ based on lattices and theta functions. We obtain the complete weight enumerators MacWilliams identity and the symmetrized weight enumerators MacWilliams identity based on the theory…
A method for implementing non-Abelian duality on string backgrounds is given. It is shown that a direct generalisation of the familiar Abelian duality induces an extra local symmetry in the gauge invariant theory. The non-Abelian isometry…
We study trace codes with defining set $L,$ a subgroup of the multiplicative group of an extension of degree $m$ of the alphabet ring $\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3},$ with $u^{3}=1.$ These codes are abelian, and their…
The classical duality theory associates to an abelian group a dual companion. Passing to a non-abelian group, a dual object can still be defined, but it is no longer a group. The search for a broader category which should include both the…
The determination of weight distribution of cyclic codes involves evaluation of Gauss sums and exponential sums. Despite of some cases where a neat expression is available, the computation is generally rather complicated. In this note, we…
The weight distribution of an error correcting code is a crucial statistic in determining it's performance. One key tool for relating the weight of a code to that of it's dual is the MacWilliams Identity, first developed for the Hamming…
We study the notion of formal self duality in finite abelian groups. Formal duality in finite abelian groups has been proposed by Cohn, Kumar, Reiher and Sch\"urmann. In this paper we give a precise definition of formally self dual sets and…
The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…
Past few years have seen an extensive use of RAM chips with wide I/O data (e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an $m$-spotty byte error, which can be…
This paper examines the $w$-weight enumerators of weights $w$ with maximal symmetry over finite chain rings and matrix rings over finite fields. In many cases, including the homogeneous weight, the MacWilliams identities for $w$-weight…
Burst errors are very common in practice. There have been many designs in order to control and correct such errors. Recently, a new class of byte error control codes called spotty byte error control codes has been specifically designed to…