Results 21 to 30 of about 513,670 (123)
$\lambda$-CONSTACYCLIC CODES OVER FINITE KRASNER HYPERFIELDS
The class of constacyclic codes plays an important role in the theory or error-correcting codes. They are considered as a remarkable generalization of cyclic codes.
Davvaz, Bijan, Al Tahan, Madeleine
core +1 more source
The weight distributions of constacyclic codes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fengwei Li 0001 +2 more
openaire +3 more sources
A note on isodual constacyclic codes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Bocong, Dinh, Hai Q.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Constacyclic codes over general mixed alphabets and their applications [PDF]
Let q be a prime power and let fi(wi) be polynomials of degree ni, which are not linear but split into distinct linear factors over Fq, where 1≤i≤k and k≥1 is a positive integer. Define Rk to be the finite commutative non-chain ring Rk=Fq[w1,w2,…,wk]/⟨fi(
Sharma, Pushpendra +3 more
core +1 more source
In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal parameters.
openaire +3 more sources
An overview on skew constacyclic codes and their subclass of LCD codes
Linear complementary dual (LCD) codes were introduced by Massey in 1994 [\textit{X. Yang} and \textit{J. L. Massey}, Discrete Math. 126, No. 1--3, 391--393 (1994; Zbl 0790.94022)] and proved that asymptotically good LCD codes exists [\textit{J. L. Massey}, Discrete Math. 106/107, 337--342 (1992; Zbl 0754.94009)]. From 2016 to 2018, some authors studied
Boulanouar, Ranya +2 more
openaire +6 more sources
A class of constacyclic codes are generalized Reed–Solomon codes
Maximum distance separable (MDS) codes are optimal in the sense that the minimum distance cannot be improved for a given length and code size. The most prominent MDS codes are generalized Reed-Solomon (GRS) codes. The square $\mathcal{C}^{2}$ of a linear code $\mathcal{C}$ is the linear code spanned by the component-wise products of every pair of ...
Hongwei Liu 0003, Shengwei Liu
openaire +5 more sources
Properties of constacyclic codes under the Schur product [PDF]
24 pages, 2 figures, acknowledgements ...
Brett Hemenway Falk +2 more
openaire +4 more sources
Some constacyclic self-dual codes over the integers modulo 2m [PDF]
In this paper, we explore constacyclic self-dual codes over Z2m. We first characterize constacyclic self-dual codes over Zpm of any length. Then we determine the structure of η-constacyclic self-dual codes over Z2t, where η=−1 or −1+2t−1.
Kai, Xiaoshan +5 more
core +1 more source

