English
Related papers

Related papers: Characterization and Enumeration of Complementary …

200 papers

The Z_64-algebra of the genetic code and DNA sequences of length N was recently stated. In order to beat the limits of this structure such as the impossibility of non-coding region analysis in genomes and the impossibility of the insertions…

Quantitative Methods · Quantitative Biology 2007-05-23 Robersy Sanchez , Jesus Barreto , Eberto Morgado , Ricardo Grau

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

Information Theory · Computer Science 2023-06-27 Hao Chen

Let G be a finite abelian group and F a field such that char(F) does not divide |G|. Denote by FG the group algebra of G over F. A (semisimple) abelian code is an ideal of FG. Two codes I and J of FG are G-equivalent if there exists an…

Information Theory · Computer Science 2012-03-27 Raul Antonio Ferraz , Marinês Guerreiro , César Polcino Milies

Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact…

Information Theory · Computer Science 2017-03-10 Adel Alahmadi , Cem Güneri , Buket Özkaya , Hatoon Shoaib , Patrick Solé

In recent years, linear complementary pairs (LCP) of codes and linear complementary dual (LCD) codes have gained significant attention due to their applications in coding theory and cryptography. In this work, we construct explicit LCPs of…

Algebraic Geometry · Mathematics 2024-12-31 Alonso S. Castellanos , Adler V. Marques , Luciane Quoos

In this paper a wide family of identifying codes over regular Cayley graphs of degree four which are built over finite Abelian groups is presented. Some of the codes in this construction are also perfect. The graphs considered include some…

Information Theory · Computer Science 2014-12-22 Cristóbal Camarero , Carmen Martínez , Ramón Beivide

Let S be a basic closed semi-algebraic set in R^n and P the corresponding preordering in R[X_1,...,X_n]. We examine for which polynomials f there exist identities f+\ep q \in P for all \ep>0. These are precisely the elements of the…

Algebraic Geometry · Mathematics 2008-07-22 Tim Netzer

In this paper, we introduce a standard generator matrix for mixed-alphabet linear codes over finite chain rings. Furthermore, we show that, when one has a linear complementary pair (LCP) of mixed-alphabet linear codes, both codes are…

Information Theory · Computer Science 2023-09-26 Maryam Bajalan , Javier de la Cruz , Alexandre Fotue-Tabue , Edgar Martínez-Moro

The goal of this thesis is to define a 2-dimensional version of abelian categories, where symmetric 2-groups play the role that abelian groups played in 1-dimensional algebra. Abelian and 2-abelian groupoid enriched categories are defined…

Category Theory · Mathematics 2008-09-11 Mathieu Dupont

Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and only if…

Information Theory · Computer Science 2016-03-14 Odessa D. Consorte , Lilibeth D. Valdez

The Euclidean hull of a linear code $C$ is defined as $C\cap C^{\perp}$, where $C^\perp$ denotes the dual of $C$ under the Euclidean inner product. A linear code with zero hull dimension is called a linear complementary dual (LCD) code. A…

Information Theory · Computer Science 2023-04-25 Zohreh Aliabadi , Tekgül Kalaycı

Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual…

Information Theory · Computer Science 2025-12-22 Lin Sok , Martianus Frederic Ezerman , Ling San

It is shown that universal algebras that are injective in their equational classes are characterized by internal property that can be called completeness. We define universal algebra $A$ as complete (closed to simple extensions) if for each…

Commutative Algebra · Mathematics 2021-12-14 Pavlo Dzikovskyi

In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon…

Information Theory · Computer Science 2025-06-03 Puyin Wang , Jinquan Luo

LCD codes are linear codes that intersect with their dual trivially. Quasi cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are…

Information Theory · Computer Science 2016-08-08 Cem Güneri , Buket Özkaya , Patrick Solé

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

Group Theory · Mathematics 2012-11-08 László Tóth

Here we present a working framework to establish finite abelian groups in python. The primary aim is to allow new A-level students to work with examples of finite abelian groups using open source software. We include the code used in the…

Group Theory · Mathematics 2017-11-17 Paul Bradley , John Smethurst

We give a categorical description of all abelian varieties with commutative endomorphism ring over a finite field with $q=p^a$ elements in a fixed isogeny class in terms of pairs consisting of a fractional $\mathbb Z[\pi,q/\pi]$-ideal and a…

Number Theory · Mathematics 2025-08-05 Jonas Bergström , Valentijn Karemaker , Stefano Marseglia

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada , Ken Saito

In this paper, we investigate the structure and properties of additive complementary dual (ACD) codes over the mixed alphabet $\mathbb{F}_2\mathbb{F}_4$ relative to a certain inner product defined over $\mathbb{F}_2\mathbb{F}_4$. We…

Information Theory · Computer Science 2025-08-08 S. Ouagagui , N. Benbelkacem , A. Batoul , T. Abualrub