164 results
Search Results
2. Optimal Quaternary Hermitian LCD Codes.
- Author
-
Lu, Liangdong, Li, Ruihu, and Ren, Yuezhen
- Subjects
LINEAR codes ,CRYPTOSYSTEMS - Abstract
Linear complementary dual (LCD) codes, which are a class of linear codes introduced by Massey, have been extensively studied in the literature recently. It has been shown that LCD codes play a role in measures to counter passive and active side-channel analyses on embedded cryptosystems. In this paper, tables are presented of good quaternary Hermitian LCD codes and they are used in the construction of puncturing, shortening and combination codes. The results of this, including three tables of the best-known quaternary Hermitian LCD codes of any length n ≤ 25 with corresponding dimension k, are presented. In addition, many of these quaternary Hermitian LCD codes given in this paper are optimal and saturate the lower or upper bound of Grassl's code table, and some of them are nearly optimal. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
3. Linear feedback coding scheme for multiple-access fading channels with degraded message sets.
- Author
-
Liao, Yuan and Wang, Xiaofang
- Subjects
LINEAR codes ,LINEAR network coding ,CHANNEL coding ,PHYSICAL layer security ,WIRELESS communications ,COMPUTER simulation - Abstract
Channel coding technology plays an important role in wireless communication systems, and it serves as a crucial mechanism to reduce interference during the transmission process. As the fifth-generation (5G) and sixth-generation (6G) wireless communication systems rapidly advance, requirements of the users on the quality and security of wireless service are increasing. To solve these problems, it calls for us to explore the new channel coding technologies. In this paper, a linear feedback coding scheme for fading multiple-access channels with degraded message sets (FMAC-DMS) is proposed. In this scheme, the transmitting beamforming and channel splitting are used to transform the channel with complex signals into scalar equivalent sub-channels. Then, the extended Schalkwijk-Kailath coding scheme (SK) is further applied to each sub-channel. The channel capacity, finite blocklength (FBL) sum-rate and FBL secrecy achievable sum-rate of the FMAC-DMS in single-input single-output (SISO) and multi-input single-output (MISO) cases are derived. Finally, we show that the proposed scheme not only provides a FBL coding solution but also guarantees physical layer security(PLS). The numerical and simulation results show the effectiveness of the proposed scheme as a channel coding solution. The study of this paper provides a new method to construct a practical FBL scheme for the FMAC-DMS. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
4. On a family of linear MRD codes with parameters [8×8,16,7]q.
- Author
-
Timpanella, Marco and Zini, Giovanni
- Subjects
ALGEBRAIC geometry ,ALGEBRAIC varieties ,FINITE fields ,FINITE geometries ,PROJECTIVE spaces ,LINEAR codes ,FAMILIES - Abstract
In this paper we consider a family F of 2n-dimensional F q -linear rank metric codes in F q n × n arising from polynomials of the form x q s + δ x q n 2 + s ∈ F q n [ x ] . The family F was introduced by Csajbók et al. (JAMA 548:203–220) as a potential source for maximum rank distance (MRD) codes. Indeed, they showed that F contains MRD codes for n = 8 , and other subsequent partial results have been provided in the literature towards the classification of MRD codes in F for any n. In particular, the classification has been reached when n is smaller than 8, and also for n greater than 8 provided that s is small enough with respect to n. In this paper we deal with the open case n = 8 , providing a classification for any large enough odd prime power q. The techniques are from algebraic geometry over finite fields, since our strategy requires the analysis of certain 3-dimensional F q -rational algebraic varieties in a 7-dimensional projective space. We also show that the MRD codes in F are not equivalent to any other MRD codes known so far. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
5. New classes of NMDS codes with dimension 3.
- Author
-
Fan, Cuiling, Wang, An, and Xu, Li
- Subjects
LINEAR codes ,ELLIPTIC curves ,ALGEBRAIC codes ,INTEGERS - Abstract
The singleton defect of an [n, k, d] linear code C is defined as s (C) = n - k + 1 - d . Codes with s (C) = s (C ⊥) = 1 are called near maximum distance separable (NMDS) codes. It is known that an [ n , 3 , n - 3 ] NMDS code is equivalent to an (n, 3)-arc in PG(2, q). In this paper, by adding some suitable projective points into some known (q + 5 , 3) -arcs in PG(2, q), we obtain two families of [ q + 7 , 3 , q + 4 ] NMDS codes for even prime power q and a family of [ q + 6 , 3 , q + 3 ] NMDS codes for odd prime power q. In addition, when q = 2 m and m is odd, by adding m suitable projective points into the maximum arcs in PG(2, q), we obtain a family of [ q + m + 2 , 3 , q + m - 1 ] NMDS codes over F q , from which we further induce a family of NMDS codes with parameters [ q t + m + 2 , 3 , q t + m - 1 ] over the extension field F q t for any odd integer t. All the resulting NMDS codes in this paper are shown to be linearly inequivalent to the NMDS codes constructed from elliptic curves, and their weight distributions are completely determined. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
6. The algebraic structure of additive codes over 28.
- Author
-
Cheng, Xiangdong
- Subjects
FINITE fields ,LINEAR operators ,ADDITIVES ,LINEAR codes - Abstract
In this paper, we investigate the algebraic structure of 2 r 8 s -additive codes, where r and s are nonnegative integers, 2 (respectively, 8 ) denotes the finite field of order 2 (respectively, 8). We first give the generator polynomials of additive cyclic codes over 8 and then the generator polynomials of additive cyclic codes over 2 8 is also given. In addition, we introduce a linear map W : 2 8 → 2 , and study its properties. What's more, the dual of additive cyclic codes over 2 8 are investigated as well. And we get that the duals of any additive cyclic codes over 2 8 are also additive cyclic codes. Finally, separable 2 8 -additive cyclic codes are investigated. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
7. Reversible codes in the Rosenbloom-Tsfasman metric.
- Author
-
Gopinadh, Bodigiri Sai and Marka, Venkatrajam
- Subjects
LINEAR codes ,BINARY codes ,TELECOMMUNICATION systems ,DATA warehousing ,CRYPTOGRAPHY - Abstract
Reversible codes have a range of wide applications in cryptography, data storage, and communication systems. In this paper, we investigated reversible codes under the Rosenbloom-Tsfasman metric (RT-metric). First, some properties of reversible codes in the RT-metric were described. An essential condition for a reversible code to be a maximum distance separable code (MDS code, in short) in the RT-metric was established. A necessary condition for a binary self-dual code to be reversible was proven and the same was generalized for q-ary self-dual reversible codes. Several constructions for reversible RT-metric codes were provided in terms of their generator matrices. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
8. Construction of quantum codes from multivariate polynomial rings.
- Author
-
Yu, Cong, Zhu, Shixin, and Tian, Fuyin
- Subjects
POLYNOMIAL rings ,ERROR-correcting codes ,LINEAR codes ,QUANTUM rings - Abstract
In this paper, we use multivariate polynomial rings to construct quantum error-correcting codes (QECCs) via Hermitian construction. We establish a relation between linear codes and ideals of multivariate polynomial rings. We give a necessary and suffcient condition for a multivariate polynomial to generate a Hermitian dual-containing code. By comparing with the literatures in recent years, we construct 31 new QECCs over F q , where q = 3 , 4 , 5 , 7 . Some of them reach quantum singleton bound and some of them exceed quantum GV bound. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
9. Codes arising from directed strongly regular graphs with μ=1.
- Author
-
Huilgol, Medha Itagi and D'Souza, Grace Divya
- Subjects
DIRECTED graphs ,REGULAR graphs ,LINEAR codes ,FINITE fields ,ERROR-correcting codes ,RESEARCH personnel - Abstract
The rank of adjacency matrix plays an important role in construction of linear codes from a directed strongly regular graph using different techniques, namely, code orthogonality, adjacency matrix determinant and adjacency matrix spectrum. The problem of computing the dimensions of such codes is an intriguing one. Several conjectures to determine the rank of adjacency matrix of a DSRG Γ over a finite field, keep researchers working in this area. To address the same to an extent, we have considered the problem of finding the rank over a finite field of the adjacency matrix of a DSRG Γ (v , k , t , λ , μ) with μ = 1 , including some mixed Moore graphs and corresponding codes arising from them, in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
10. Construction of lattices over the real sub-field of ℚ(ς8) for block fading (wiretap) coding.
- Author
-
Singh, Ankur, Kumar, Pratyush, and Shukla, Ankur
- Subjects
- *
BINARY codes , *WIRETAPPING , *REAL numbers , *BLOCK codes , *LINEAR codes , *JACOBI forms , *LATTICE theory - Abstract
In this paper, we consider the challenge of ensuring secure communication in block-fading wiretap channels using encoding techniques. We investigate the coding for block-fading wiretap channels using stacked lattice codes constructed over completely real number fields, which is a well-established technique. In this paper, we consider degree-four complex multiplication field 풦 = ℚ(ς8) over ℚ. We employ binary codes to generate a lattice over ℚ(ς8), which is subsequently used to form an integral lattice. The resulting integral lattice can be effectively applied to enhance the security of communication within block-fading wiretap channels. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
11. Expanded low-rank parity-check codes and their application to cryptography.
- Author
-
Franck Rivel, Kamwa Djomou, Emmanuel, Fouotsa, and Calvin, Tadmon
- Subjects
CRYPTOGRAPHY ,CRYPTOSYSTEMS ,LINEAR codes ,PUBLIC key cryptography ,DECODING algorithms - Abstract
In this paper, we define expanded LRPC codes from LRPC codes with a decoding algorithm using the one of the underlying LRPC codes. Next, we propose to use these codes for cryptography by deriving two cryptosystems in a McEliece setting. in order to reduce the key sizes, we use a generator matrix in systematic form for the first scheme, and an m − order quasi-cyclic LRPC code that we define for the second scheme. The obtained code has a very poor structure and is more likely to be a random linear code. Next, we give some security parameters and compare the key sizes of our public key with the key sizes of some cryptosystems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
12. MDS codes with l-Galois hulls of arbitrary dimensions.
- Author
-
Qian, Liqin, Cao, Xiwang, Wu, Xia, and Lu, Wei
- Subjects
REED-Solomon codes ,LINEAR codes ,FINITE fields ,PROJECTIVE planes ,INTERSECTION graph theory - Abstract
The hull of a linear code is defined to be the intersection of the code and its dual, and was originally introduced to classify finite projective planes. The objective of this paper is to construct some MDS codes with l-Galois hulls of arbitrary dimensions by using the generalized Reed–Solomon codes over finite fields with regard to l-Galois inner product. We give a general construction theorem and some construction ideas of MDS with l-Galois hulls of arbitrary dimensions. Our approach provides a general framework that effectively unifies similar known techniques for constructing MDS codes. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
13. Linear complexity of two classes of quaternary sequences based on sign alternation transformation.
- Author
-
Zhao, Lu, Pei, Yongzhen, Cao, Tianqing, and Du, Jiao
- Subjects
FINITE fields ,LINEAR codes - Abstract
Two classes of optimal quaternary sequences have been constructed by applying the sign alternation transform and Gray mapping to Legendre sequence pair, twin-prime sequence pair and GMW sequence pair. In this paper, a new method for investigating the linear complexity over finite field is proposed, and the exact values of the linear complexity over finite field F 4 and Galois ring Z 4 of the quaternary sequences are determined. The results show that their linear complexity are quite good. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
14. Perfect mixed codes from generalized Reed–Muller codes.
- Author
-
Romanov, Alexander M.
- Subjects
REED-Muller codes ,PRODUCT coding ,LINEAR codes - Abstract
In this paper, we propose a new method for constructing 1-perfect mixed codes in the Cartesian product F n × F q n , where F n and F q are finite fields of orders n = q m and q. We consider generalized Reed-Muller codes of length n = q m and order (q - 1) m - 2 . Codes whose parameters are the same as the parameters of generalized Reed-Muller codes are called Reed-Muller-like codes. The construction we propose is based on partitions of distance-2 MDS codes into Reed-Muller-like codes of order (q - 1) m - 2 . We construct a set of q q cn nonequivalent 1-perfect mixed codes in the Cartesian product F n × F q n , where the constant c satisfies c < 1 , n = q m and m is a sufficiently large positive integer. We also prove that each 1-perfect mixed code in the Cartesian product F n × F q n corresponds to a certain partition of a distance-2 MDS code into Reed-Muller-like codes of order (q - 1) m - 2 . [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
15. On the parameters of extended primitive cyclic codes and the related designs.
- Author
-
Yan, Haode and Yin, Yanan
- Subjects
CYCLIC codes ,HAMMING weight ,HAMMING codes ,LINEAR codes ,EXTENDED families ,SHIFT registers - Abstract
Very recently, Heng et al. studied a family of extended primitive cyclic codes. It was shown that the supports of all codewords with any fixed nonzero Hamming weight in this code support a 2-design. In this paper, we study this family of extended primitive cyclic codes in more details. The weight distribution is determined and the parameters of the related 2-designs are also given. Moreover, we prove that the minimum weight codewords in this code support a 3-design when p = 2 , which gives an affirmative answer to Heng's conjecture. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
16. Infinite families of minimal binary codes via Krawtchouk polynomials.
- Author
-
Du, Xiaoni, Rodríguez, René, and Wu, Hao
- Subjects
BINARY codes ,LINEAR codes ,BOOLEAN functions ,POLYNOMIALS ,COMBINATORICS ,DATA warehousing ,QUANTUM cryptography - Abstract
Linear codes play a crucial role in various fields of engineering and mathematics, including data storage, communication, cryptography, and combinatorics. Minimal linear codes, a subset of linear codes, are particularly essential for designing effective secret sharing schemes. In this paper, we introduce several classes of minimal binary linear codes by carefully selecting appropriate Boolean functions. These functions belong to a renowned class of Boolean functions, namely, the general Maiorana–McFarland class. We employ a method first proposed by Ding et al. (IEEE Trans Inf Theory 64(10):6536–6545, 2018) to construct minimal codes violating the Ashikhmin–Barg bound (wide minimal codes) by using Krawtchouk polynomials. The lengths, dimensions, and weight distributions of the obtained codes are determined using the Walsh spectrum distribution of the chosen Boolean functions. Our findings demonstrate that a vast majority of the newly constructed codes are wide minimal. Furthermore, our proposed codes exhibit a significantly larger minimum distance, in some cases, compared to some existing similar constructions. Finally, we address this method, based on Krawtchouk polynomials, more generally, and highlight certain generic properties related to it. These general results offer insights into the scope of this approach. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
17. Optimized decoder for low-density parity check codes based on genetic algorithms.
- Author
-
El Ouakili, Hajar, El Ghzaoui, Mohammed, and El Alami, Rachid
- Subjects
DECODING algorithms ,GENETIC algorithms ,CODING theory ,BLOCK codes ,LINEAR codes ,GENETIC code ,LOW density parity check codes ,ERROR-correcting codes - Abstract
Low-density parity check (LDPC) codes, are a family of error-correcting codes, their performances close to the Shannon limit make them very attractive solutions for digital communication systems. There are several algorithms for decoding LDPC codes that show great diversity in terms of performance related to error correction. Also, very recently, many research papers involved the genetic algorithm (GA) in coding theory, in particular, in the decoding linear block codes case, which has heavily contributed to reducing the bit error rate (BER). In this paper, an efficient method based on the GA is proposed and it is used to improve the power of correction in terms of BER and the frame error rate (FER) of LDPC codes. Subsequently, the proposed algorithm can independently decide the most suitable moment to stop the decoding process, moreover, it does not require channel information (CSI) making it adaptable for all types of channels with different noise or intensity. The simulations show that the proposed algorithm is more efficient in terms of BER compared to other LDPC code decoders. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
18. Text-independent speaker identification system using discrete wavelet transform with linear prediction coding.
- Author
-
Alrusaini, Othman and Daqrouq, Khaled
- Subjects
LINEAR codes ,ADDITIVE white Gaussian noise ,SYSTEM identification ,GAUSSIAN mixture models ,DISCRETE systems ,FEATURE extraction ,VIDEO coding ,DISCRETE wavelet transforms ,WAVELET transforms - Abstract
One of the key problems of the modern day is the presentation of an identity verification system that can perform sufficient accuracy in identity verification, is resilient to assaults and noises, and can be recorded in the simplest possible method. In this study, a new speaker feature extraction which based on discrete wavelet transform (DWT) and linear prediction coding (LPC) algorithm (WLPCA) are investigated. This paper's primary objective is to evidence the performance of the new method for speaker identification by a Gaussian mixture model (GMM). The proposed method improves the recognition rate over the Mel-frequency cepstral coefficient (MFCC). Experimental evaluation of the process performance is performed on two speech databases; our recorded database and the publicly available TIMIT database. We show that the speech features derived by the newly proposed method are more suitable for GMM (91.53%), in terms of the time-consumed, by requiring less Gaussian mixtures than MFCC (85.77%). For testing the presented method in a noisy environment, Additive white Gaussian noise (AWGN) was added to the TIMIT database, where a slight improvement in the performance of the presented method (60.02%) over the MFCC (59.89%) was observed. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
19. Some new constructions of optimal linear codes and alphabet-optimal (r,δ)-locally repairable codes
- Author
-
Qiu, Jing and Fu, Fang-Wei
- Published
- 2024
- Full Text
- View/download PDF
20. Self-orthogonal and quantum codes over chain rings.
- Author
-
Bajalan, Maryam, Moeini, Mina, and Yildiz, Bahattin
- Subjects
GRAY codes ,LINEAR codes - Abstract
In this paper, we investigate the Gray images of codes over chain rings, leading to the derivation of infinite families of self-orthogonal linear codes over the residue field F
q . We determine the parameters of optimal self-orthogonal and divisible linear codes. Additionally, we study the Gray images of quasi-twisted codes, resulting in some self-orthogonal Griesmer quasi-cyclic codes. Finally, we employ the CSS construction to derive some quantum codes based on self-orthogonal linear codes. [ABSTRACT FROM AUTHOR]- Published
- 2024
- Full Text
- View/download PDF
21. On the construction of constacyclically permutable codes from constacyclic codes.
- Author
-
Guanghui Zhang and Shuhua Liang
- Subjects
ALGEBRAIC codes ,FINITE fields ,INTEGERS ,GENERALIZATION ,LINEAR codes - Abstract
In this paper, we propose a way to partition any constacyclic code over a finite field in its equivalence classes according to the algebraic structure of the code. Such a method gives the generalization of cyclically permutable codes (CPCs), which are called constacyclically permutable codes (CCPCs), and it is useful to derive a CCPC from a given constacyclic code. Moreover, we present an enumerative formula for the code size of such a CCPC, with all of the terms being positive integers, and we provide an algebraic method to produce such a CCPC. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
22. On double cyclic codes over Z2 + uZ2.
- Author
-
Aydogdu, Ismail
- Subjects
CYCLIC codes ,LINEAR codes ,BINARY codes ,LINEAR operators - Abstract
In this paper, we introduced double cyclic codes over R
r × Rs , where R = Z2 + uZ2 = {0, 1, u, 1 + u} is the ring with four elements and u² = 0. We first determined the generator polynomials of R-double cyclic codes for odd integers r and s, then gave the generators of duals of free double cyclic codes over Rr × Rs . By defining a linear Gray map, we looked at the binary images of R-double cyclic codes and gave several examples of optimal parameter binary linear codes obtained from R-double cyclic codes. Moreover, we studied self-dual R-double cyclic codes and presented an example of a self-dual R-double cyclic code. [ABSTRACT FROM AUTHOR]- Published
- 2024
- Full Text
- View/download PDF
23. New entanglement-assisted quantum error-correcting codes from negacyclic codes.
- Author
-
Chen, Xiaojing, Lu, Xingbo, Zhu, Shixin, Jiang, Wan, and Wang, Xindi
- Subjects
ERROR-correcting codes ,LINEAR codes ,INTEGERS ,GENERALIZATION - Abstract
Entanglement-assisted quantum error-correcting (EAQEC) codes are a generalization of quantum error-correcting (QEC) codes, which can be constructed from arbitrary classical linear codes by relaxing the dual-containing condition and by using preshared entangled states between the sender and the receiver. In this paper, we investigate EAQEC codes of length n = 2 (q 2 + 1) a , where q is an odd prime power, a = m 2 + 1 and m is an odd integer. The resulting EAQEC codes are entanglement-assisted quantum maximum-distance-separable (EAQMDS) codes when the minimum distance d ≤ n + 2 2 . [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
24. A class of three-weight linear codes over finite fields of odd characteristic.
- Author
-
Duan, Bingbing, Han, Guangguo, and Qi, Yanfeng
- Subjects
LINEAR codes ,DATA warehousing ,FINITE fields ,GAUSSIAN sums - Abstract
Applied in communication, data storage system, secret sharing schemes, authentication codes and association schemes, linear codes attract much attention. In this paper, a class of three-weight linear codes is obtained by the defining sets over finite fields of odd characteristic. The parameters and weight distributions of linear codes are determined by the additive characters, multiplicative characters and Gauss sums. Further, most of linear codes obtained are minimal, which can be used to construct secret sharing schemes. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
25. Construction of quasi self-dual codes over a commutative non-unital ring of order 4.
- Author
-
Kim, Jon-Lark and Roe, Young Gun
- Subjects
COMMUTATIVE rings ,TWO-dimensional bar codes ,CODE generators ,LINEAR codes ,NONCOMMUTATIVE algebras ,TORSION - Abstract
Let I be the commutative non-unital ring of order 4 defined by generators and relations. I = a , b ∣ 2 a = 2 b = 0 , a 2 = b , a b = 0. Alahmadi et al. have classified QSD codes, Type IV codes (QSD codes with even weights) and quasi-Type IV codes (QSD codes with even torsion code) over I up to lengths n = 6 , and suggested two building-up methods for constructing QSD codes. In this paper, we construct more QSD codes, Type IV codes and quasi-Type IV codes for lengths n = 7 and 8, and describe five new variants of the two building-up construction methods. We find that when n = 8 there is at least one QSD code with minimun distance 4, which attains the highest minimum distance so far, and we give a generator matrix for the code. We also describe some QSD codes, Type IV codes and quasi-Type IV codes with new weight distributions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
26. Skew cyclic codes over Fq[u1, u2, ..., ur]/?ui³ - ui, uiuj - ujui?i, jr=1.
- Author
-
Rai, Pradeep, Singh, Bhupendra, and Gupta, Ashok Ji
- Abstract
Our paper delves into exploring skew cyclic codes over a generalized class of rings denoted by T = T
r . We define Tr = Fq [u1 , u2 , ..., ur ]/(ui 3 - ui , ui uj -uj ui )i,j r =1, q = pm and p is some odd prime. Our study introduces a Gray map for the ring T and explores its properties. Using a decomposition theorem, we analyze the structural features of skew cyclic codes over T . Additionally, we offer a formula to find the count of skew cyclic codes of length n over the ring T under specific conditions. Further, we derive a criterion to get Linear Complementary Dual (LCD) codes over T from skew cyclic codes. Moreover, we present a technique for deriving quantum codes from a particular class of skew cyclic codes over T which contain their dual. [ABSTRACT FROM AUTHOR]- Published
- 2024
27. On Linear Codes over Finite Singleton Local Rings.
- Author
-
Alabiad, Sami, Alhomaidhi, Alhanouf Ali, and Alsarori, Nawal A.
- Subjects
LOCAL rings (Algebra) ,LINEAR codes ,BINARY codes ,CODING theory ,TWO-dimensional bar codes ,ISOMORPHISM (Mathematics) - Abstract
The study of linear codes over local rings, particularly non-chain rings, imposes difficulties that differ from those encountered in codes over chain rings, and this stems from the fact that local non-chain rings are not principal ideal rings. In this paper, we present and successfully establish a new approach for linear codes of any finite length over local rings that are not necessarily chains. The main focus of this study is to produce generating characters, MacWilliams identities and generator matrices for codes over singleton local Frobenius rings of order 32. To do so, we first start by characterizing all singleton local rings of order 32 up to isomorphism. These rings happen to have strong connections to linear binary codes and Z 4 codes, which play a significant role in coding theory. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
28. Hulls of linear codes from simplex codes.
- Author
-
Xu, Guangkui, Luo, Gaojun, Cao, Xiwang, and Xu, Heqian
- Subjects
AUTOMORPHISM groups ,LINEAR codes ,VECTOR spaces ,PROJECTIVE spaces - Abstract
The hull of a linear code plays an important role in determining the complexity of algorithms for checking permutation equivalence of two linear codes and computing the automorphism group of a linear code. Regarding the quantum error correction, linear codes with determined hull are used to construct quantum codes. In this paper, we focus on the hull of Simplex codes and punctured Simplex codes. We firstly study the properties of the matrix produced by the column vectors of a projective space and determine the Euclidean and Hermitian hull of punctured Simplex codes completely. Secondly, we investigate the Euclidean and Hermitian hull of several classes of linear codes from Simplex codes. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
29. On the equivalence of Zps-linear generalized Hadamard codes.
- Author
-
Bhunia, Dipak K., Fernández-Córdoba, Cristina, Vela, Carlos, and Villanueva, Mercè
- Subjects
HADAMARD codes ,LINEAR codes - Abstract
Linear codes of length n over Z p s , p prime, called Z p s -additive codes, can be seen as subgroups of Z p s n . A Z p s -linear generalized Hadamard (GH) code is a GH code over Z p which is the image of a Z p s -additive code under a generalized Gray map. It is known that the dimension of the kernel allows to classify these codes partially and to establish some lower and upper bounds on the number of such codes. Indeed, in this paper, for p ≥ 3 prime, we establish that some Z p s -linear GH codes of length p t having the same dimension of the kernel are equivalent to each other, once t is fixed. This allows us to improve the known upper bounds. Moreover, up to t = 10 if p = 3 or t = 8 if p = 5 , this new upper bound coincides with a known lower bound based on the rank and dimension of the kernel. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
30. Fq2-double cyclic codes with respect to the Hermitian inner product.
- Author
-
Aydogdu, Ismail, Abualrub, Taher, and Samei, Karim
- Subjects
CYCLIC codes ,LINEAR codes ,FINITE fields - Abstract
In this paper, we introduce F q 2 -double cyclic codes of length n = r + s , where F q 2 is the Galois field of q 2 elements, q is a power of a prime integer p and r, s are positive integers. We determine the generator polynomials for any F q 2 -double cyclic code. For any F q 2 -double cyclic code C , we will define the Euclidean dual code C ⊥ based on the Euclidean inner product and the Hermitian dual code C ⊥ H based on the Hermitian inner product. We will construct a relationship between C ⊥ and C ⊥ H and then find the generator polynomials for the Hermitian dual code C ⊥ H. As an application of our work, we will present examples of optimal parameter linear codes over the finite field F 4 and also examples of optimal quantum codes that were derived from F 4 -double cyclic codes using the Hermitian inner product. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
31. Theoretical Approaches of Interval-Valued Fuzzy Code and Fuzzy Soft Code.
- Author
-
Woldie, Masresha Wassie, Mebrat, Jejaw Demamu, and Taye, Mihret Alamneh
- Subjects
FUZZY sets ,LINEAR algebraic groups ,LINEAR codes ,ALGORITHMS ,DIAGNOSIS - Abstract
In this study, we attempted to demonstrate the interval-valued fuzzy code by extending the concept of an intervalvalued fuzzy set. Further, we discussed the operations of the interval-valued fuzzy code. The interval-valued fuzzy soft code is introduced, and various related properties are investigated in this paper. Finally, we show that the operations of interval-valued fuzzy soft code are discussed. Through this paper, we use the set of integers modulo 2, that is Z2= {0, 1}. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
32. Some variations of Tanner's construction for short length QC‐LDPC codes.
- Author
-
Kim, Wonjun, Cho, Hyunwoo, Song, Hong‐Yeop, and Song, Min Kyu
- Abstract
This paper proposes a modification to Tanner's work for constructing girth‐8 quasi‐cyclic low‐density parity‐check codes. The main contribution of this paper is to use an arithmetic sequence at the leftmost column for the exponent matrix so that the lifting size is not necessarily restricted to the prime numbers. Two theorems on the lifting sizes that achieve girth at least 8 using this approach is also provided. This construction exhibits better frame error rate results to the modified 5G new radio (NR) low‐density parity‐check codes for lengths around 500. Also, this construction achieves better frame error rate performance results than the recently proposed one using the Golomb rulers at around frame error rate of 10−6. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
33. Decoding of Z 2 S Linear Generalized Kerdock Codes.
- Author
-
Minja, Aleksandar and Šenk, Vojin
- Subjects
MACHINE learning ,DECODING algorithms ,LINEAR codes ,GRAY codes ,BINARY codes ,RINGS of integers - Abstract
Many families of binary nonlinear codes (e.g., Kerdock, Goethals, Delsarte–Goethals, Preparata) can be very simply constructed from linear codes over the Z 4 ring (ring of integers modulo 4), by applying the Gray map to the quaternary symbols. Generalized Kerdock codes represent an extension of classical Kerdock codes to the Z 2 S ring. In this paper, we develop two novel soft-input decoders, designed to exploit the unique structure of these codes. We introduce a novel soft-input ML decoding algorithm and a soft-input soft-output MAP decoding algorithm of generalized Kerdock codes, with a complexity of O (N S log 2 N) , where N is the length of the Z 2 S code, that is, the number of Z 2 S symbols in a codeword. Simulations show that our novel decoders outperform the classical lifting decoder in terms of error rate by some 5 dB. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
34. Construction and enumeration of self-orthogonal and self-dual codes over Galois rings of even characteristic.
- Author
-
Yadav, Monika and Sharma, Anuradha
- Subjects
BILINEAR forms ,LINEAR codes ,ADDITION (Mathematics) ,FINITE fields ,INTEGERS - Abstract
Let e ≥ 2 and r ≥ 1 be integers, and let R e , r denote the Galois ring of characteristic 2 e and cardinality 2 er. The Teichm u ¨ ller set T r of the Galois ring R e , r can be viewed as the finite field of order 2 r under the addition operation ⊕ and the multiplication operation of R e , r , where for a , b ∈ T r , a ⊕ b is the unique element in T r satisfying a ⊕ b = (a + b) (mod 2). Now a linear code C of length n over T r is said to be k-doubly even if it has a k-dimensional linear subcode C 0 satisfying c · c ≡ 0 (mod 4) for all c ∈ C 0 , where each c ∈ C 0 is viewed as an element of R e , r n and · denotes the Euclidean bilinear form on R e , r n. A k-doubly even code of length n and dimension k over T r is simply called a doubly even code. In this paper, we count all doubly even codes over T r and their two special classes, viz. the codes containing the all-one vector and the codes that do not contain the all-one vector by studying the geometry of a certain special quadratic space over T r. We further provide a recursive method to construct self-orthogonal and self-dual codes of the type { k 1 , k 2 , ... , k e } and length n over R e , r from a (k 1 + k 2 + ⋯ + k e 2 ) -doubly even self-orthogonal code of the same length n and dimension over T r , where n is a positive integer and k 1 , k 2 , ... , k e are non-negative integers satisfying 2 k 1 + 2 k 2 + ⋯ + 2 k e - i + 1 + k e - i + 2 + k e - i + 3 + ⋯ + k i ≤ n for , (here · denotes the floor function and denotes the ceiling function). With the help of this recursive construction method and the enumeration formulae for doubly even codes over T r and their two special classes, we obtain explicit enumeration formulae for all self-orthogonal and self-dual codes of an arbitrary length over R e , r. Using these enumeration formulae, we classify all self-orthogonal and self-dual codes of lengths 2, 3 and 4 over R 2 , 2 up to monomial equivalence. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
35. A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes.
- Author
-
Xu, Hengzhou, Zhang, Xiao‐Dong, Li, Huaan, Zhu, Hai, Zhang, Bo, and Liu, Hui
- Subjects
LOW density parity check codes ,TANNER graphs ,LINEAR codes ,CHANNEL coding - Abstract
M. Fossorier proposed how to determine the necessary and sufficient conditions for the existence of cycles in the Tanner graph of quasi‐cyclic LDPC (QC‐LDPC) codes, which has been widely investigated in the study of LDPC codes. This paper presents some new necessary and sufficient conditions for the existence of cycles with arbitrary lengths and proposes a simple and novel method for counting cycles of QC‐LDPC codes based on the improved conditions. Numerical results show that, compared with the existing methods, the presented method is effective and feasible and can enumerate cycles of QC‐LDPC codes in a cyclic‐shift way. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
36. On some skew codes over ℤq+uℤq.
- Author
-
Hebbache, Zineb, Kaya, Abidin, Aydin, Nuh, and Guenda, Kenza
- Subjects
LINEAR codes ,ELECTRONIC information resource searching ,DATABASE searching ,POLYNOMIAL rings - Abstract
In this paper, we investigate the structure and properties of skew negacyclic codes and skew quasi-negacyclic codes over the ring R = ℤ q + u ℤ q , u 2 = 0. Some structural properties of R [ x , Θ ] are discussed, where Θ is an automorphism of R. A skew quasi-negacyclic code of length s ℓ with index ℓ over R is viewed both as in the conventional row circulant form and also as an R [ x , Θ ] / (x s + 1) -submodule of G R (R , ℓ) [ x , δ ] / (x s + 1) , where G R (R , ℓ) is the Galois extension ring of degree ℓ over R and δ is an automorphism of G R (R , ℓ). A sufficient condition for one generator skew quasi-negacyclic codes to be free is determined. Some distance bounds for free one generator skew quasi-negacyclic codes are discussed. Furthermore, given the decomposition of a skew quasi-negacyclic code, we provide the decomposition of its dual code. As a result, a characterization of self-dual skew quasi-negacyclic codes over R = ℤ q + u ℤ q is provided. By using computer search we obtained a number of new linear codes over ℤ 4 from skew negacyclic and skew quasi-negacyclic codes over ℤ 4 + u ℤ 4 . [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
37. The properties and the error-correcting pair for lengthened GRS codes.
- Author
-
He, Boyi and Liao, Qunying
- Subjects
REED-Solomon codes ,LINEAR codes ,ERROR-correcting codes - Abstract
The error-correcting pair is a general algebraic decoding method for linear codes, which exists for many classical linear codes such as generalized Reed-Solomon codes. In this paper, we define a new extended generalized Reed-Solomon code, i.e., lengthened generalized Reed-Solomon code, which has good algebraic structure and many excellent properties, thus we extend the error-correcting pair to the case for lengthened generalized Reed-Solomon codes. Firstly, we give some sufficient conditions for which an LGRS code is non-GRS, and a necessary and sufficient condition for an LGRS code to be MDS or AMDS, respectively. And then, we constructively determine the existence of the error-correcting pair for lengthened generalized Reed-Solomon codes and give several examples to support our main results. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
38. Parameters of several families of binary duadic codes and their related codes.
- Author
-
Liu, Hai, Li, Chengju, and Qian, Haifeng
- Subjects
BINARY codes ,CYCLIC codes ,FINITE fields ,LINEAR codes ,SQUARE root - Abstract
Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length 2 m - 1 and develop some lower bounds on their minimum distances by using the BCH bound on cyclic codes, which partially solves one case of the open problem proposed in Liu et al (Finite Field Appl 91:102270, 2023). It is shown that the lower bounds on their minimum distances are close to the square root bound. Moreover, the parameters of the dual and extended codes of these binary duadic codes are investigated. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
39. Cost-Effective Optimization of an Array of Wave Energy Converters in Front of a Vertical Seawall.
- Author
-
Natarajan, Senthil Kumar and Cho, Il Hyoung
- Subjects
WAVE energy ,STANDING waves ,LINEAR codes ,SEA-walls - Abstract
The present paper focuses on investigating the cost-effective configuration of an array of wave energy converters (WECs) composed of vertical cylinders situated in front of a vertical seawall in irregular waves. First, the hydrodynamic calculations are performed using a WAMIT commercial code based on linear potential theory, where the influence of the vertical wall is incorporated using the method of image. The viscous damping experienced by the oscillating cylinder is considered through CFD simulations of a free decay test. A variety of parameters, including WEC diameter, number of WECs, and the spacing between them, are considered to determine an economically efficient WEC configuration. The design of the WEC configuration is aided by a cost indicator, defined as the ratio of the total submerged volume of the WEC to overall power capture. The cost-effective configuration of WECs is achieved when WECs are positioned in front of a vertical wall and the distance between them is kept short. It can be explained that the trapped waves formed between adjacent WECs as well as the standing waves in front of a seawall significantly intensify wave fields around WECs and consequently amplify the heave motion of each WEC. A cost-effective design strategy of WEC deployment enhances the wave energy greatly and, consequently, contributes to constructing the wave energy farm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
40. Investigation of the permutation and linear codes from the Welch APN function
- Author
-
Helleseth, Tor, Li, Chunlei, and Xia, Yongbo
- Published
- 2024
- Full Text
- View/download PDF
41. On binary LCD BCH codes of length $ \frac{{{2^m} + 1}}{3} $.
- Author
-
Liu, Yuzhe, Kai, Xiaoshan, and Zhu, Shixin
- Subjects
CYCLIC codes ,LINEAR codes ,DATA transmission systems ,BINARY codes - Abstract
BCH codes are a special subclass of cyclic codes and have many important applications in data storage and communication systems. In this paper, we investigate the structure of binary linear complementary dual (LCD) BCH codes with length $ n = \frac{{{2^m} + 1}}{3} $, where $ m \geq 7 $ is an odd integer. By exploring cyclotomic cosets modulo $ n $, we determine the dimension of LCD BCH codes for designed distance $ \delta $ in the range $ 2 \le \delta \le{2^{\frac{{m + 1}}{2}}} $. Furthermore, we compute the first five largest coset leaders modulo $ n $ and construct some binary LCD BCH codes. We also present two families of optimal binary linear codes from LCD BCH codes. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
42. Linear complementary dual codes and double circulant codes over a semi-local ring.
- Author
-
Cheng, Xiangdong, Cao, Xiwang, and Qian, Liqin
- Subjects
LINEAR codes ,CIRCULANT matrices ,FINITE fields ,CYCLIC codes - Abstract
Let $ q $ be an odd prime power and $ \mathbb{F}_q $ be the finite field with $ q $ elements. In this paper, suppose ring $ R = \mathbb{F}_{q}+ \mu \mathbb{F}_{q}+ \nu \mathbb{F}_{q}+ \mu \nu \mathbb{F}_{q} $, where $ \mu \nu = \nu \mu, \mu^{2} = \mu, \nu^{2} = \nu. $ We first give a Gray map from $ R $ onto $ \mathbb{F}_q^{4} $ and consider a decomposition of the ring $ R $. Additionally, we investigate linear complementary dual (LCD) codes over the ring $ R $. Some conditions for such linear codes over $ R $ to be linear complementary dual are given. Furthermore, based on the Artin conjecture, we get a class of good codes by calculating the total number of LCD double circulant codes over $ R $. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
43. Cyclic codes over rings of matrices.
- Author
-
Dinh, Hai Quang, Gaur, Atul, Kumar, Pratyush, Singh, Manoj Kumar, and Singh, Abhay Kumar
- Subjects
CYCLIC codes ,MATRIX rings ,LINEAR codes ,NONCOMMUTATIVE rings - Abstract
In this paper, we consider the ring of matrices $ \mathcal{A} $ of order $ 2 $ over the ring $ \mathbb{F}_2 [u] / \langle u^k \rangle $, where $ u $ is an indeterminate with $ u^k = 0 $, i.e. $ \mathcal{A} = M_2 (\mathbb{F}_2 [u] / \langle u^k \rangle) $. We derive the structure theorem for cyclic codes of odd length $ n $ over the ring $ \mathcal{A} $ with the help of isometry map from $ \mathcal{A} $ to $ \mathbb{F}_4 [u, v] / \langle u^k, v^2, u v - v u \rangle $, where $ v $ is an indeterminate satisfying $ v^2 = 0 $ and $ u v = v u $. We define a map $ \theta $ which takes the linear codes of odd length $ n $ over $ \mathcal{A} $ to linear codes of even length $ 2 k n $ over $ \mathbb{F}_4 $. We also define a weight on the ring $ \mathcal{A} $ which is an extension of the weight defined over the ring $ M_2 (\mathbb{F}_2) $. An example is also given as applications to construct the linear codes of odd length $ n $ over $ \mathcal{A} $. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
44. Constructions for several classes of few-weight linear codes and their applications.
- Author
-
Zhu, Canze and Liao, Qunying
- Subjects
GAUSSIAN sums ,LINEAR codes ,INTEGERS - Abstract
In this paper, for any odd prime $ p $ and an integer $ m\ge 3 $, several classes of linear codes with $ t $-weight $ (t = 3,5,7) $ are obtained based on some defining sets, and then their complete weight enumerators are determined explicitly by employing Gauss sums and quadratic character sums. Especially for $ m = 3 $, a class of MDS codes with parameters $ [p,3,p-2] $ are obtained. Furthermore, some of these codes can be suitable for applications in secret sharing schemes and $ s $-sum sets for any odd $ s>1 $. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
45. An Improvement for Error-Correcting Pairs of Some Special MDS Codes.
- Author
-
Xiao, Rui and Liao, Qunying
- Subjects
- *
ERROR-correcting codes , *REED-Solomon codes , *LINEAR codes - Abstract
The error-correcting pair is a general algebraic decoding method for linear codes. Since every linear code is contained in an MDS linear code with the same minimum distance over some finite field extensions, we focus on MDS linear codes. Recently, He and Liao showed that for an MDS linear code 풞 with minimum distance 2ℓ + 2, if it has an ℓ-error-correcting pair, then the parameters of the pair have three possibilities. Moreover, for the first case, they gave a necessary condition for an MDS linear code 풞 with minimum distance 2ℓ + 2 to have an ℓ-error-correcting pair, and for the other two cases, they only gave some counterexamples. For the second case, in this paper, we give a necessary condition for an MDS linear code 풞 with minimum distance 2ℓ + 2 to have an ℓ-error-correcting pair, and then basing on the Product Singleton Bound, we prove that there are two cases for such pairs, and then give some counterexamples basing on twisted generalized Reed–Solomon codes for these cases. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
46. Quantum and LCD codes from skew constacyclic codes over a general class of non-chain rings.
- Author
-
Rai, Pradeep, Singh, Bhupendra, and Gupta, Ashok Ji
- Subjects
- *
LINEAR codes , *POLYNOMIALS , *INTEGERS - Abstract
In this paper, we study skew constacyclic codes over a class of non-chain rings T = F q [ u 1 , u 2 , ... , u r ] / ⟨ f i (u i) , u i u j - u j u i ⟩ i , j = 1 r , where q = p m , p is some odd prime, m is a positive integer, and f i (u i) are non-constant, monic polynomials that split into distinct linear factors. We discuss the structural properties of skew constacyclic codes over T and their dual. We characterize Euclidean and Hermitian dual-containing skew constacyclic codes. These characterizations serve as a foundational framework for the development of techniques to construct quantum codes. Consequently, we derive plenty of new quantum codes including many maximum distance separable (MDS) quantum codes, and many quantum codes with better parameters than existing ones. Our work further extends to the characterization of skew constacyclic Euclidean and Hermitian linear complementary dual (LCD) codes over T , and we establish that their Gray images also preserve the LCD property. From this analysis, we derive numerous MDS codes and best known linear codes over F q . [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
47. Crossed product codes.
- Author
-
Duarte, A., Pereira, A., and Polcino Milies, C.
- Subjects
- *
PRODUCT coding , *GROUP algebras , *LINEAR codes , *FINITE groups , *CODING theory - Abstract
Bernal et al. provided a necessary and sufficient condition for a linear code to be realized as an ideal in a finite group algebra and De La Cruz and Willems proved a similar result for ideals in twisted group algebras. In this paper, we extend this characterization to crossed products. Furthermore, we determine conditions for some crossed product codes to be self-dual. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
48. Characterization of some specific lee distance codes over finite rings.
- Author
-
Gupta, Shalini, Bamta, Ashish, and Kumar, Ashwini
- Subjects
- *
FINITE rings , *RINGS of integers , *RESEARCH personnel , *LINEAR codes - Abstract
Codes over integer rings equipped with the Lee metric are gaining attention among researchers recently. In this paper, we investigate some specific linear codes over integer rings and characterize their dimensions and Lee weights using greatest common divisors (GCD). Furthermore, we construct equidistant Lee codes over ℤ2b, ℤ2pandℤp which have applications in error detection and error correction. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
49. An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance.
- Author
-
Camps-Moreno, Eduardo, López, Hiram H., Matthews, Gretchen L., Ruano, Diego, San-José, Rodrigo, and Soprunov, Ivan
- Subjects
- *
CYCLIC codes , *BINARY codes , *FAULT tolerance (Engineering) , *ERROR-correcting codes , *LINEAR codes , *FAULT-tolerant computing - Abstract
CSS-T codes were recently introduced as quantum error-correcting codes that respect a transversal gate. A CSS-T code depends on a CSS-T pair, which is a pair of binary codes (C 1 , C 2) such that C 1 contains C 2 , C 2 is even, and the shortening of the dual of C 1 with respect to the support of each codeword of C 2 is self-dual. In this paper, we give new conditions to guarantee that a pair of binary codes (C 1 , C 2) is a CSS-T pair. We define the poset of CSS-T pairs and determine the minimal and maximal elements of the poset. We provide a propagation rule for nondegenerate CSS-T codes. We apply some main results to Reed–Muller, cyclic and extended cyclic codes. We characterize CSS-T pairs of cyclic codes in terms of the defining cyclotomic cosets. We find cyclic and extended cyclic codes to obtain quantum codes with better parameters than those in the literature. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
50. Self-orthogonal codes over a non-unital ring from two class association schemes.
- Author
-
Alahmadi, Adel, Melaibari, Asmaa, and Solé, Patrick
- Subjects
- *
REGULAR graphs , *LINEAR codes , *MULTIPLE access protocols (Computer network protocols) , *TOURNAMENTS - Abstract
There is a non-unital ring I of order 4 defined by generators and relations as I = 〈 a , b | 2 a = 2 b = 0 , a 2 = b , a b = 0 〉. In this paper, we present special constructions of linear codes over I from the adjacency matrices of two class association schemes. These consist of either Strongly Regular Graphs (SRGs) or Doubly Regular Tournaments (DRTs). We investigate the conditions under which these codes are self-orthogonal, quasi self-dual, or Type IV. As a byproduct of this study, some diophantine relations on the weight of sum of vectors with coefficients in I are derived. Some examples of codes with minimum distance better than that of Type IV codes over unital rings of the same order in modest lengths are given. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.