
Previous Article
A generalized construction of OFDM $M$QAM sequences with low peaktoaverage power ratio
 AMC Home
 This Issue

Next Article
Castle curves and codes
On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings
1.  Department of Mathematics, Ohio University, Athens, Ohio45701, United States, United States 
[1] 
San Ling, Buket Özkaya. New bounds on the minimum distance of cyclic codes. Advances in Mathematics of Communications, 2021, 15 (1) : 18. doi: 10.3934/amc.2020038 
[2] 
Saadoun Mahmoudi, Karim Samei. Codes over $ \frak m $adic completion rings. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020122 
[3] 
Yuan Cao, Yonglin Cao, Hai Q. Dinh, Ramakrishna Bandi, FangWei Fu. An explicit representation and enumeration for negacyclic codes of length $ 2^kn $ over $ \mathbb{Z}_4+u\mathbb{Z}_4 $. Advances in Mathematics of Communications, 2021, 15 (2) : 291309. doi: 10.3934/amc.2020067 
[4] 
Xiangrui Meng, Jian Gao. Complete weight enumerator of torsion codes. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020124 
[5] 
Agnaldo José Ferrari, Tatiana Miguel Rodrigues de Souza. Rotated $ A_n $lattice codes of full diversity. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020118 
[6] 
Vito Napolitano, Ferdinando Zullo. Codes with few weights arising from linear sets. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020129 
[7] 
Dandan Wang, Xiwang Cao, Gaojun Luo. A class of linear codes and their complete weight enumerators. Advances in Mathematics of Communications, 2021, 15 (1) : 7397. doi: 10.3934/amc.2020044 
[8] 
Shudi Yang, Xiangli Kong, Xueying Shi. Complete weight enumerators of a class of linear codes over finite fields. Advances in Mathematics of Communications, 2021, 15 (1) : 99112. doi: 10.3934/amc.2020045 
[9] 
Karan Khathuria, Joachim Rosenthal, Violetta Weger. Encryption scheme based on expanded ReedSolomon codes. Advances in Mathematics of Communications, 2021, 15 (2) : 207218. doi: 10.3934/amc.2020053 
[10] 
Nicola Pace, Angelo Sonnino. On the existence of PDsets: Algorithms arising from automorphism groups of codes. Advances in Mathematics of Communications, 2021, 15 (2) : 267277. doi: 10.3934/amc.2020065 
[11] 
Jong Yoon Hyun, Boran Kim, Minwon Na. Construction of minimal linear codes from multivariable functions. Advances in Mathematics of Communications, 2021, 15 (2) : 227240. doi: 10.3934/amc.2020055 
[12] 
Sabira El Khalfaoui, Gábor P. Nagy. On the dimension of the subfield subcodes of 1point Hermitian codes. Advances in Mathematics of Communications, 2021, 15 (2) : 219226. doi: 10.3934/amc.2020054 
[13] 
Shanding Xu, Longjiang Qu, Xiwang Cao. Three classes of partitioned difference families and their optimal constant composition codes. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020120 
[14] 
Fengwei Li, Qin Yue, Xiaoming Sun. The values of two classes of Gaussian periods in index 2 case and weight distributions of linear codes. Advances in Mathematics of Communications, 2021, 15 (1) : 131153. doi: 10.3934/amc.2020049 
[15] 
Hongming Ru, Chunming Tang, Yanfeng Qi, Yuxiao Deng. A construction of $ p $ary linear codes with two or three weights. Advances in Mathematics of Communications, 2021, 15 (1) : 922. doi: 10.3934/amc.2020039 
[16] 
Tingting Wu, Li Liu, Lanqiang Li, Shixin Zhu. Repeatedroot constacyclic codes of length $ 6lp^s $. Advances in Mathematics of Communications, 2021, 15 (1) : 167189. doi: 10.3934/amc.2020051 
[17] 
Hongwei Liu, Jingge Liu. On $ \sigma $selforthogonal constacyclic codes over $ \mathbb F_{p^m}+u\mathbb F_{p^m} $. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020127 
[18] 
Ivan Bailera, Joaquim Borges, Josep Rifà. On Hadamard full propelinear codes with associated group $ C_{2t}\times C_2 $. Advances in Mathematics of Communications, 2021, 15 (1) : 3554. doi: 10.3934/amc.2020041 
[19] 
Akbar Mahmoodi Rishakani, Seyed Mojtaba Dehnavi, Mohmmadreza Mirzaee Shamsabad, Nasour Bagheri. Cryptographic properties of cyclic binary matrices. Advances in Mathematics of Communications, 2021, 15 (2) : 311327. doi: 10.3934/amc.2020068 
[20] 
Hai Q. Dinh, Bac T. Nguyen, Paravee Maneejuk. Constacyclic codes of length $ 8p^s $ over $ \mathbb F_{p^m} + u\mathbb F_{p^m} $. Advances in Mathematics of Communications, 2020 doi: 10.3934/amc.2020123 
2019 Impact Factor: 0.734
Tools
Metrics
Other articles
by authors
[Back to Top]