English
Related papers

Related papers: Generalized Hadamard full propelinear codes

200 papers

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é

We define Bush-type generalized Hadamard matrices over abelian groups and construct symmetric Bush-type generalized Hadamard matrices over the additive group of finite field $\mathbb{F}_q$, $q$ a prime power. We then show and study an…

Combinatorics · Mathematics 2015-09-18 Hadi Kharaghani , Sho Suda

In this paper, a new class of convex functions as a generalization of convexity which is called (h-m)-convex functions and some properties of this class is given. We also prove some Hadamard's type inequalities.

Classical Analysis and ODEs · Mathematics 2011-04-01 M. E. Ozdemir , Ahmet Ocak Akdemir , Erhan Set

A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…

Information Theory · Computer Science 2015-12-23 Can Xiang

Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…

Information Theory · Computer Science 2017-01-05 Nuh Aydin , Ajdin Halilovic

The $\Z_p\Z_{p^2}$-additive codes are subgroups of $\Z_p^{\alpha_1} \times \Z_{p^2}^{\alpha_2}$, and can be seen as linear codes over $\Z_p$ when $\alpha_2=0$, $\Z_{p^2}$-additive codes when $\alpha_1=0$, or $\Z_2\Z_4$-additive codes when…

Information Theory · Computer Science 2022-03-30 Dipak K. Bhunia , Cristina Fernández-Córdoba , Mercè Villanueva

Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with…

Information Theory · Computer Science 2024-12-17 Giacomo Micheli , Vincenzo Pallozzi Lavorante , Phillip Waitkevich

Generalized concatenated codes were introduced in the 1970s by Zinoviev. There are many types of codes in the literature that are known by other names that can be viewed as generalized concatenated codes. Examples include matrix-product…

Information Theory · Computer Science 2020-04-08 Ferdinand Blomqvist , Oliver W. Gnilke , Marcus Greferath

In this paper we introduce a notion of {\it generalized operad} containing as special cases various kinds of operad--like objects: ordinary, cyclic, modular, properads etc. We then construct inner cohomomorphism objects in their categories…

Category Theory · Mathematics 2011-01-10 D. Borisov , Yu. I. Manin

Recently, a geometrical characterization of vector spaces served to generalize them into a new class of algebras. Instead of the algebraic properties of the underlying fields, we generalized the recently discovered property of such spaces…

Algebraic Geometry · Mathematics 2019-01-23 Gabriele Ricci

The punctured binary Reed-Muller code is cyclic and was generalized into the punctured generalized Reed-Muller code over $\gf(q)$ in the literature. The major objective of this paper is to present another generalization of the punctured…

Information Theory · Computer Science 2017-01-03 Cunsheng Ding , Chunlei Li , Yongbo Xia

Nowadays there are several classes of constrained codes intended for different applications. The following two large classes can be distinguished. The first class contains codes with local constraints; for example, the source data must be…

Information Theory · Computer Science 2024-05-27 Boris Ryabko

This article introduces Generalized Hyperderivative Reed-Solomon codes (GHRS codes), which generalize NRT Reed-Solomon codes. Its main results are as follows: 1) every GHRS code is MDS, 2) the dual of a GHRS code is also an GHRS code, 3)…

Information Theory · Computer Science 2025-12-30 Mahir Bilen Can , Benjamin Horowitz

In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such…

Information Theory · Computer Science 2023-03-21 Joaquim Borges , Josep Rifà , Victor Zinoviev

The existence of a projective plane of order $p\equiv3\pmod{4}$, where $p$ is a prime power, is shown to be equivalent to the existence of a balancedly multi-splittable embeddable $p^2\times p(p+1)$ partial Hadamard matrix.

Combinatorics · Mathematics 2023-12-20 Hadi Kharaghani , Sho Suda , Yash Shamsundar Khobragade

We classify binary completely regular codes of length $m$ with minimum distance $\delta$ for $(m,\delta)=(12,6)$ and $(11,5)$. We prove that such codes are unique up to equivalence, and in particular, are equivalent to certain Hadamard…

Combinatorics · Mathematics 2014-04-08 Neil I. Gillespie , Cheryl E. Praeger

We provide a comprehensive overview of the fundamental structural properties of weighted projective Reed-Muller codes. We give a recursive construction for these codes, under some conditions for the weights, and we use it to derive bounds…

Information Theory · Computer Science 2026-03-26 Jade Nardi , Rodrigo San-José

Apart from the ordinary and the periodic Golay pairs, we define also the negaperiodic Golay pairs. (They occurred first, under a different name, in a paper of Ito.) If a Hadamard matrix is also a Toeplitz matrix, we show that it must be…

Combinatorics · Mathematics 2015-11-30 N. A. Balonin , D. Z. Djokovic

As we all know, many interesting and important codes are obtained by modifying or combining existing codes. In this paper, we focus on generalized Roth-Lempel (in short, GRL) codes and define a class of extended codes, i.e., the extended…

Information Theory · Computer Science 2025-08-19 Zhonghao Liang , Qunying Liao

Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit…

Combinatorics · Mathematics 2025-04-17 Santiago Barrera Acevedo , Padraig Ó Catháin , Heiko Dietrich , Ronan Egan