4.2 Article

The build-up construction of quasi self-dual codes over a non-unital ring

期刊

出版社

WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0219498822501432

关键词

Non-unital rings; self-orthogonal codes; type IV codes

向作者/读者索取更多资源

This research explores the recursive construction of self-orthogonal codes over a local ring E without an identity for multiplication. It classifies self-orthogonal codes of length n and size 2(n) (referred to as quasi self-dual codes or QSD) up to n = 12, up to permutation equivalence. In particular, it focuses on classifying Type IV codes (even-weight QSD codes) up to n = 12.
There is a local ring E of order 4, without identity for the multiplication, defined by generators and relations as E = < a, b vertical bar 2a = 2b = 0, a(2) = a, b(2) = b, ab = a, ba = b >. We study a recursive construction of self-orthogonal codes over E. We classify, up to permutation equivalence, self-orthogonal codes of length n and size 2(n) (called here quasi self-dual codes or QSD) up to the length n = 12. In particular, we classify Type IV codes (QSD codes with even weights) up to n = 12.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Interdisciplinary Applications

Quasi type IV codes over a non-unital ring

Adel Alahmadi, Alaa Altassan, Widyan Basaffar, Alexis Bonnecaze, Hatoon Shoaib, Patrick Sole

Summary: The article investigates the algebraic structure of linear codes over non-unital rings, introduces concepts such as quasi self-dual codes and different types of codes, and provides formulas and classifications for these codes in short lengths.

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING (2021)

Article Mathematics, Applied

Type IV codes over a non-unital ring

Adel Alahmadi, Alaa Altassan, Widyan Basaffar, Hatoon Shoaib, Alexis Bonnecaze, Patrick Sole

Summary: This paper studies the algebraic structure of linear codes over a special local ring E, including residue codes and torsion codes. The concepts of quasi self-dual codes and Type IV codes, which are quasi self-dual codes with all codewords having even Hamming weight, are introduced. The weight enumerators of these codes are analyzed using invariant theory and classified in short lengths.

JOURNAL OF ALGEBRA AND ITS APPLICATIONS (2022)

Article Chemistry, Analytical

Cyber-Security Threats and Side-Channel Attacks for Digital Agriculture

Adel N. Alahmadi, Saeed Ur Rehman, Husain S. Alhazmi, David G. Glynn, Hatoon Shoaib, Patrick Sole

Summary: The digital transformation in agriculture is driven by smart sensors monitoring crops to improve food quality and quantity. This paper discusses security threats, side-channel attacks specific to digital agriculture, as well as open research challenges and future directions.

SENSORS (2022)

Article Computer Science, Theory & Methods

The build-up construction over a commutative non-unital ring

Adel Alahmadi, Amani Alkathiry, Alaa Altassan, Alexis Bonnecaze, Hatoon Shoaib, Patrick Sole

Summary: The paper investigates a recursive construction of self-orthogonal codes over a local ring I, classifying self-orthogonal codes of length n and size 2(n) up to n = 6, including Type IV codes and quasi Type IV codes.

DESIGNS CODES AND CRYPTOGRAPHY (2022)

Article Mathematics

Connections between Linear Complementary Dual Codes, Permanents and Geometry

Adel N. Alahmadi, Husain S. Alhazmi, Hatoon Shoaib, David G. Glynn, Saeed Ur Rehman, Patrick Sole

Summary: Linear codes with complementary duals, or LCD codes, have been used in recent years as countermeasures against side-channel and fault injection attacks in cryptography. In characteristic two fields, they exist if the permanent of any generator matrix is non-zero; alternatively, in the binary case, the matroid represented by the columns of the matrix has an odd number of bases. The connection between Grassmannian varieties, linear and quadratic complexes, and LCD codes is explained. By accessing the classification of polarities, binary LCD codes of dimension k are related to two types of symmetric non-singular binary matrices, certain truncated Reed-Muller codes, and geometric codes of planes in finite projective space through self-orthogonal codes of dimension k.

MATHEMATICS (2023)

Article Mathematics

The Quantum States of a Graph

Mohd Arif Raza, Adel N. Alahmadi, Widyan Basaffar, David G. Glynn, Manish K. Gupta, James W. P. Hirschfeld, Abdul Nadim Khan, Hatoon Shoaib, Patrick Sole

Summary: Quantum codes are essential for quantum computers, as each self-dual quantum code corresponds to a unique stabilised quantum state. Building on previous research, we demonstrate how to determine coefficients on the basis of kets in these states. The proof relies on algebraic graph theory and quadratic forms, with the Arf invariant playing a significant role.

MATHEMATICS (2023)

Article Mathematics

On the arguments of the roots of the generalized Fibonacci polynomial

Adel Alahmadi, Oleksiy Klurman, Florian Luca, Hatoon Shoaib

Summary: In this study, we revisit the equidistribution problem of roots of Littlewood-type polynomials. Specifically, we prove that the roots of the polynomial family & psi;(k)(z) = z(k)-z(k-1)-MIDLINE HORIZONTAL ELLIPSIS-1 are uniformly distributed around the unit circle in a strong quantitative form, confirming a conjecture from [Gomez and Luca, Commentat. Math. Univ. Carol., On the distribution of roots of z(k) - z(k-1)-MIDLINE HORIZONTAL ELLIPSIS-z - 1, 62(3):291-296, 2021].

LITHUANIAN MATHEMATICAL JOURNAL (2023)

Article Mathematics, Applied

Double circulant codes for the Lee and Euclidean distance

Adel Alahmadi, Altaf Alshuhail, Alaa Altassan, Hatoon Shoaib, Patrick Sole

Summary: This paper investigates the application of double circulant codes of length 2n over 7Gpm, where p is an odd prime, n tends to infinity, and m≥1 is a fixed integer. Through random coding, we obtain families of asymptotically good Lee codes over 7Gpm for both small and large alphabets, and asymptotically good Euclidean codes over 7Gpm for small alphabets. We use Euclidean codes to construct spherical codes and Lee codes to construct insertion/deletion codes, employing projection techniques from (Yaglom, 1958) for spherical codes and (Sok et al., 2018) for deletion codes.

AIMS MATHEMATICS (2023)

Article Mathematics, Applied

Double circulant complementary dual codes over F4

Hatoon Shoaib

Summary: This paper studies a special class of quasi-cyclic codes, called double circulant codes, over F4, which have complementary-duals. The main techniques used in this study include Chinese reminder theory decomposition, explicit enumeration, and asymptotics. Particularly, it is shown that the considered class of codes is asymptotically good.

AIMS MATHEMATICS (2023)

Article Mathematics, Applied

k-GENERALIZED FIBONACCI NUMBERS WHICH ARE CONCATENATIONS OF TWO REPDIGITS

Adel Alahmadi, Alaa Altassan, Florian Luca, Hatoon Shoaib

Summary: The k-generalized Fibonacci numbers formed by concatenating two identical digits have at most four digits.

GLASNIK MATEMATICKI (2021)

暂无数据