English
Related papers

Related papers: $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-Additive Ha…

200 papers

The Zps-additive codes of length n are subgroups of Zps^n , and can be seen as a generalization of linear codes over Z2, Z4, or more general over Z2s . In this paper, we show two methods for computing a parity-check matrix of a Zps-additive…

Information Theory · Computer Science 2024-01-11 Cristina Fernández-Córdoba , Adrián Torres , Carlos Vela , Mercè Villanueva

We study a new class of codes over Z_2 x Z_2 which we call L-codes. They arise as a natural fifth step in a series of analogies between Kleinian codes, binary codes, lattices and vertex operator algebras. This analogy will be explained in…

Combinatorics · Mathematics 2010-08-12 Julia Galstad , Gerald Hoehn

In this paper, we introduce $\mathbb{Z}_{p^r}\mathbb{Z}_{p^r}\mathbb{Z}_{p^s}$-additive cyclic codes for $r\leq s$. These codes can be identified as $\mathbb{Z}_{p^s}[x]$-submodules of $\mathbb{Z}_{p^r}[x]/\langle x^{\alpha}-1\rangle \times…

Information Theory · Computer Science 2022-02-24 Cristina Fernández-Córdoba , Sachin Pathak , Ashish Kumar Upadhyay

Complex Hadamard matrices H of order 6 are characterized in a novel manner, according to the presence/absence of order 2 Hadamard submatrices. It is shown that if there exists one such submatrix, H is equivalent to a Hadamard matrix where…

Mathematical Physics · Physics 2013-06-12 Bengt R. Karlsson

In classical coding theory, Gray isometries are usually defined as mappings between finite Frobenius rings, which include the ring $Z_m$ of integers modulo $m$, and the finite fields. In this paper, we derive an isometric mapping from $Z_8$…

Information Theory · Computer Science 2017-06-30 Sierra Marie M. Lauresta , Virgilio P. Sison

We introduce an additive but not $\mathbb{F}_4$-linear map $S$ from $\mathbb{F}_4^{n}$ to $\mathbb{F}_4^{2n}$ and exhibit some of its interesting structural properties. If $C$ is a linear $[n,k,d]_4$-code, then $S(C)$ is an additive…

Information Theory · Computer Science 2020-04-28 Martianus Frederic Ezerman , San Ling , Patrick Sole , Olfa Yemen

A Hadamard matrix $H$ of order $n$ is a square matrix with entries $\pm 1$ satisfying $HH^T = nI_n$, where $I_n$ is the identity matrix of order $n$. A circulant Hadamard matrix is a Hadamard matrix whose rows are cyclic shifts of one…

Signal Processing · Electrical Eng. & Systems 2026-05-12 Piyush Priyanshu , Sudhan Majhi , Subhabrata Paul

A $(G,[k_1,\dots,k_t],\lambda)$ {\it partitioned difference family} (PDF) is a partition $\cal B$ of an additive group $G$ into sets ({\it blocks}) of sizes $k_1$, \dots, $k_t$, such that the list of differences of ${\cal B}$ covers exactly…

Combinatorics · Mathematics 2023-07-20 Anamari Nakic

Inspired by the Z2Z4-additive codes, linear codes over Z2^r x(Z2+uZ2)^s have been introduced by Aydogdu et al. more recently. Although these family of codes are similar to each other, linear codes over Z2^r x(Z2+uZ2)^s have some advantages…

Information Theory · Computer Science 2017-04-25 Ismail Aydogdu

All generalized Hadamard matrices of order 18 over a group of order 3, H(6,3), are enumerated in two different ways: once, as class regular symmetric (6,3)-nets, or symmetric transversal designs on 54 points and 54 blocks with a group of…

Combinatorics · Mathematics 2012-05-28 Masaaki Harada , Clement Lam , Akihiro Munemasa , Vladimir D. Tonchev

Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are…

Information Theory · Computer Science 2024-01-24 Yansheng Wu , Chao Li , Lin Zhang , Fu Xiao

Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…

Combinatorics · Mathematics 2021-05-05 Ruslan Sharipov

Two submatrices $A,D$ of a Hadamard matrix $H$ are called complementary if, up to a permutation of rows and columns, $H=[^A_C{\ }^B_D]$. We find here an explicit formula for the polar decomposition of $D$. As an application, we show that…

Combinatorics · Mathematics 2014-03-24 Teo Banica , Ion Nechita , Jean-Marc Schlenker

In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…

Information Theory · Computer Science 2020-05-13 Zilong Wang , Guang Gong

Extremal Type II $\mathbb{Z}_{8}$-codes are a class of self-dual $\mathbb{Z}_{8}$-codes with Euclidean weights divisible by $16$ and the largest possible minimum Euclidean weight for a given length. We introduce a doubling method for…

Information Theory · Computer Science 2024-05-02 Sara Ban , Sanja Rukavina

An additive quaternary $[n,k,d]$-code (length $n,$ quaternary dimension $k,$ minimum distance $d$) is a $2k$-dimensional F_2-vector space of $n$-tuples with entries in $Z_2\times Z_2$ (the $2$-dimensional vector space over F_2) with minimum…

Combinatorics · Mathematics 2020-07-13 Juergen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

For every $n = 2^k > 8$ there exist exactly $[(k+1)/2]$ mutually nonequivalent $Z_4$-linear extended perfect codes with distance 4. All these codes have different ranks.

Information Theory · Computer Science 2008-05-10 Denis Krotov

In this paper, we study the codes over the matrix ring over $\mathbb{Z}_4$, which is perhaps the first time the ring structure $M_2(\mathbb{Z}_4)$ is considered as a code alphabet. This ring is isomorphic to…

Information Theory · Computer Science 2018-07-16 Sanjit Bhowmick , Satya Bagchi , Ramakrishna Bandi

In this paper, we introduce a additive Tridiagonal and Double-Tridiagonal codes over $\mathbb{F}_4$ and then we study the properties of the code. Also, we find the number of additive Tridiagonal codes over $\mathbb{F}_4.$ Finally, we study…

Information Theory · Computer Science 2021-04-13 N. Annamalai , Anandhu Mohan , C. Durairajan

Unit derived schemes applied to Hadamard matrices are used to construct and analyse linear block and convolutional codes. Codes are constructed to prescribed types, lengths and rates and multiple series of self-dual, dual-containing, linear…

Information Theory · Computer Science 2025-12-09 Ted Hurley
‹ Prev 1 3 4 5 6 7 10 Next ›