English
Related papers

Related papers: Construction of self-dual codes over $\mathbb{Z}_{…

200 papers

For some extremal (optimal) odd unimodular lattice $L$ in dimensions $12,16,20,28,32,36,40$ and $44$, we determine all integers $k$ such that $L$ contains a $k$-frame. This result yields the existence of an extremal Type I…

Combinatorics · Mathematics 2015-03-17 Masaaki Harada

In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of…

Combinatorics · Mathematics 2020-12-22 Tsuyoshi Miezaki , Akihiro Munemasa , Hiroyuki Nakasora

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we solve one more special case. The problem of finding the weight distribution is transformed into a…

Number Theory · Mathematics 2012-10-17 Maosheng Xiong

We define Jacobi forms of indefinite lattice index, and show that they are isomorphic to vector-valued modular forms also in this setting. We also consider several operations of the two types of objects, and obtain an interesting bilinear…

Number Theory · Mathematics 2021-09-14 Shaul Zemel

We study the structure of linear codes over the ring $B_k$ which is defined by $\mathbb{F}_{p^r}[v_1,v_2,\ldots,v_k]/\langle v_i^2=v_i,~v_iv_j=v_jv_i \rangle_{i,j=1}^k.$ In order to study the codes, we begin with studying the structure of…

Information Theory · Computer Science 2018-01-18 Irwansyah , Djoko Suprijanto

We show that it is possible to remove two differential operators from the standard collection of $m$ of them used to embed the space of Jacobi forms of \textit{odd} weight $k$ and index $m$ into several pieces of elliptic modular forms.…

Number Theory · Mathematics 2020-02-04 Soumya Das , Ritwik Pal

There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…

Information Theory · Computer Science 2021-06-15 Minjia Shi , Shukai Wang , Jon-Lark Kim , Patrick Solé

This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$)…

Information Theory · Computer Science 2012-06-26 Manish. K. Gupta , C. Durairajan

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $\lambda$ and $k$ be integers satisfying $\lambda,k\geq 2$ and denote $R=\mathbb{F}_{2^m}[u]/\langle u^{2\lambda}\rangle$. Let $\delta,\alpha\in \mathbb{F}_{2^m}^{\times}$. For…

Information Theory · Computer Science 2019-05-10 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Songsak Sriboonchitta , Guidong Wang

In this paper, we construct self-dual codes from a construction that involves both block circulant matrices and block quadratic residue circulant matrices. We provide conditions when this construction can yield self-dual codes. We construct…

Rings and Algebras · Mathematics 2020-04-02 Joe Gildea , Abidin Kaya , Rhian Taylor , Alexander Tylyshchak , Bahattin Yildiz

Let $m\geq 2$ be any natural number and let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+\cdots+u^{m-1}\mathbb{F}_{p}$ be a finite non-chain ring, where $u^m=u$ and $p$ is a prime congruent to $1$ modulo $(m-1)$. In this…

Number Theory · Mathematics 2016-09-27 Mokshi Goyal , Madhu Raka

We prove two new forms of Jacobi-type J-fraction expansions generating the binomial coefficients, $\binom{x+n}{n}$ and $\binom{x}{n}$, over all $n \geq 0$. Within the article we establish new forms of integer congruences for these binomial…

Combinatorics · Mathematics 2017-02-07 Maxie D. Schmidt

We propose an innovative approach to investigating the linearity of $\mathbb{Z}_{2^L}$-linear codes derived from $\mathbb{Z}_{2^L}$-additive codes using the generalized Gray map. To achieve this, we define two related binary codes: the…

Information Theory · Computer Science 2025-09-05 Gustavo T. Bastos , Maiara F. Bollauf , Agnaldo J. Ferrari , Øyvind Ytrehus

In this paper, we construct, investigate and, in some cases, classify several new classes of (simple) modules over the Takiff $\mathfrak{sl}_{2}$. More precisely, we first explicitly construct and classify, up to isomorphism, all modules…

Representation Theory · Mathematics 2022-11-15 Xiaoyu Zhu

In this paper, we present a new bordered construction for self-dual codes which employs $\lambda$-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring…

Information Theory · Computer Science 2023-03-24 Joe Gildea , Adrian Korban , Adam Michael Roberts , Alexander Tylyshchak

We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.

Information Theory · Computer Science 2016-01-12 MinJia Shi , Yan Liu , Patrick Solé

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

Information Theory · Computer Science 2012-01-31 Sunghyu Han , Jon-Lark Kim , Heisook Lee , Yoonjin Lee

The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the…

Information Theory · Computer Science 2012-10-09 Yun Fan , Guanghui Zhang

A new generalization of the Gray map is introduced. The new generalization $\Phi: Z_{2^k}^n \to Z_{2}^{2^{k-1}n}$ is connected with the known generalized Gray map $\phi$ in the following way: if we take two dual linear $Z_{2^k}$-codes and…

Combinatorics · Mathematics 2009-10-05 Denis Krotov

We provide an algorithm to construct unitary matrices over finite fields. We present various constructions of Hermitian self-dual code by means of unitary matrices, where some of them generalize the quadratic double circulant constructions.…

Information Theory · Computer Science 2019-11-26 Lin Sok
‹ Prev 1 3 4 5 6 7 10 Next ›