English
Related papers

Related papers: Equivariant theory for codes and lattices I

200 papers

Since MacWilliams proved the original identity relating the Hamming weight enumerator of a linear code to the weight enumerator of its dual code there have been many different generalizations, leading to the development of $m$-tuple support…

Information Theory · Computer Science 2017-06-13 Nathan Kaplan

By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…

Representation Theory · Mathematics 2023-06-05 Lizhong Wang , Jiping Zhang

Encoding and indexing of lattice codes is generalized from self-similar lattice codes to a broader class of lattices. If coding lattice $\Lambda_{\textrm{c}}$ and shaping lattice $\Lambda_{\textrm{s}}$ satisfy $\Lambda_{\textrm{s}}…

Information Theory · Computer Science 2016-07-14 Brian M. Kurkoski

In this paper we give the generalization of lifted codes over any finite chain ring. This has been done by using the construction of finite chain rings from $p$-adic fields. Further we propose a lattice construction from linear codes over…

Information Theory · Computer Science 2020-07-14 Reguia Lamia Bouzara , Kenza Guenda , Edgar Martínez-Moro

In this paper, we introduce the notion of the complete joint Jacobi polynomial of two linear codes of length $n$ over $\mathbb{F}_q$ and $\mathbb{Z}_k$. We give the MacWilliams type identity for the complete joint Jacobi polynomials of…

Combinatorics · Mathematics 2021-07-13 Himadri Shekhar Chakraborty , Tsuyoshi Miezaki

This paper investigates the generalized rank weights, with a definition implied by the study of the generalized rank weight enumerator. We study rank metric codes over $L$, where $L$ is a finite Galois extension of a field $K$. This is a…

Information Theory · Computer Science 2017-10-24 Relinde Jurrius , Ruud Pellikaan

The MacWilliams Extension Theorem states that each linear Hamming isometry of a linear code extends to a monomial map. In this paper an analogue of the extension theorem for linear codes over a module alphabet is observed. A geometric…

Information Theory · Computer Science 2017-05-29 Serhii Dyshko

Firstly, we give a formula on the generalized Hamming weight of linear codes constructed generically by defining sets. Secondly, by choosing properly the defining set we obtain a class of cyclotomic linear codes and then present two…

Information Theory · Computer Science 2022-06-17 Fei Li

Let R > S be finite Frobenius rings for which there exists a trace map T from R onto S as left S modules. Let C:= {x -> T(ax + bf(x)) : a,b in R}. Then C is an S-linear subring-subcode of a left linear code over R. We consider functions f…

Rings and Algebras · Mathematics 2011-01-10 Eimear Byrne

This paper develops a harmonic Galois theory for finite graphs, thereby classifying harmonic branched $G$-covers of a fixed base $X$ in terms of homomorphisms from a suitable fundamental group of $X$ together with $G$-inertia structures on…

Combinatorics · Mathematics 2012-12-10 Scott Corry

It is well known that the discrete analogue of a lattice is a linear code which is a vector subspace of Hamming space $\mathbb{F}^n$. The set $\mathbb{F}$ is a finite field and $n \in \mathbb{Z}_{>0}$. Our attempt is to construct a class of…

Information Theory · Computer Science 2023-08-15 Rameez Raja

If $\mathbb{F}_{q}$ is a finite field, $C$ is a vector subspace of $\mathbb{F}_{q}^{n}$ (linear code), and $G$ is a subgroup of the group of linear automorphisms of $\mathbb{F}_{q}^{n}$, $C$ is said to be $G$-invariant if $g(C)=C$ for all…

Information Theory · Computer Science 2018-10-23 Elias Javier Garcia Claro , Horacio Tapia Recillas

We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e.,…

Information Theory · Computer Science 2018-02-06 Antonio Campello

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…

Information Theory · Computer Science 2007-07-13 Maximilien Gadouleau , Zhiyuan Yan

It is well known that there is a deep relationship between codes and lattices. Concepts from coding theory are related to concepts of lattice theory as, for example, weight enumerators to theta series, MacWilliams identity to Jacobi…

Number Theory · Mathematics 2025-09-03 Thanasis Bouganis , Jolanta Marzec-Ballesteros

Congruence lattices of semiprime algebras from semi--degenerate congruence--modular varieties fulfill the equivalences from B. A. Davey`s well--known characterization theorem for $m$--Stone bounded distributive lattices, moreover, changing…

Rings and Algebras · Mathematics 2017-09-05 Claudia Mureşan

The goal of this paper is to introduce the notion of $G$-Frobenius manifolds for any finite group $G$. This work is motivated by the fact that any $G$-Frobenius algebra yields an ordinary Frobenius algebra by taking its $G$-invariants. We…

Algebraic Geometry · Mathematics 2015-01-12 Byeongho Lee

We use derivatives to prove the equivalences between MacWilliams identity and its four equivalent forms, and present new interpretations for the four equivalent forms. Our results explicitly give out the relationships between MacWilliams…

Information Theory · Computer Science 2014-02-11 Xiaomin Bao

Suppose $G$ is a locally solid lattice group. It is known that there are non-equivalent classes of bounded homomorphisms on $G$ which have topological structures. In this paper, our attempt is to assign lattice structures on them. More…

Functional Analysis · Mathematics 2019-09-06 Omid Zabeti

Given a principal fibre bundle with structure group $S$, and a fibre transitive Lie group $G$ of automorphisms thereon, Wang's theorem identifies the invariant connections with certain linear maps $\psi\colon \mathfrak{g}\rightarrow…

Mathematical Physics · Physics 2015-01-28 Maximilian Hanusch