Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Chakraborty, Ananda
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2511.14480
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866918208224624640
author Chakraborty, Ananda
author_facet Chakraborty, Ananda
contents In this paper, we study variants of weight enumerators of linear codes over $\mathbb{F}_q$. We generalize the concept of average complete joint weight enumerators of two linear codes over $\mathbb{F}_q$. We also give its MacWilliams type identities. Then we establish a monomial analogue of Yoshida's theorem for this average complete joint weight enumerators. Finally, we present the generalized representation for average of $g$-fold complete joint weight enumerators for $\mathbb{F}_q$-linear codes and establish a monomial matrix analogue of Yoshida's theorem for average $g$-fold complete joint weight enumerators.
format Preprint
id arxiv_https___arxiv_org_abs_2511_14480
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Monimial Matrix Analogue of Yoshida's theorem
Chakraborty, Ananda
Information Theory
Combinatorics
In this paper, we study variants of weight enumerators of linear codes over $\mathbb{F}_q$. We generalize the concept of average complete joint weight enumerators of two linear codes over $\mathbb{F}_q$. We also give its MacWilliams type identities. Then we establish a monomial analogue of Yoshida's theorem for this average complete joint weight enumerators. Finally, we present the generalized representation for average of $g$-fold complete joint weight enumerators for $\mathbb{F}_q$-linear codes and establish a monomial matrix analogue of Yoshida's theorem for average $g$-fold complete joint weight enumerators.
title Monimial Matrix Analogue of Yoshida's theorem
topic Information Theory
Combinatorics
url https://arxiv.org/abs/2511.14480