Results 231 to 240 of about 2,012,640 (258)
Some of the next articles are maybe not open access.
Repeated-Root Isodual Cyclic Codes over Finite Fields
Lecture Notes in Computer Science, 2015In this paper we give several constructions of cyclic codes over finite fields that are monomially equivalent to their dual, where the characteristic of the field divides the length of the code. These are called repeated-root cyclic isodual codes over finite fields.
Thomas Aaron Gulliver +2 more
exaly +3 more sources
MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes
Finite Fields and Their Applications, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiuxin Tang, Rong Luo
openaire +3 more sources
On repeated-root multivariable codes over a finite chain ring
Designs, Codes and Cryptography, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edgar Martínez-Moro, Ignacio F. Rúa
openaire +1 more source
NONBINARY QUANTUM CODES DERIVED FROM REPEATED-ROOT CYCLIC CODES
Modern Physics Letters B, 2013Many good quantum error-correcting codes were constructed from cyclic codes. However, it is a difficult problem to determine the true minimum distance of quantum cyclic codes for large length n. In this work, we construct nonbinary quantum cyclic codes and asymmetric quantum cyclic codes that are derived from repeated-root cyclic codes for an arbitrary
JIANFA QIAN, LINA ZHANG
openaire +1 more source
The minimum Hamming distances of repeated-root cyclic codes of length $$6p^s$$ and their MDS codes
Journal of Applied Mathematics and Computing, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ying Gao, Qin Yue 0001, Fengwei Li 0001
openaire +2 more sources
A new class of AMDS symbol-pair codes from repeated-root codes
Advances in Mathematics of CommunicationszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin Yang, Xiaoshan Kai, Yongsheng Tang
openaire +2 more sources
Repeated Root Cyclic and Negacyclic Codes over Galois Rings
2009In this notice we describe the ideal structure of all cases of cyclic and negacyclic codes of length p s over a Galois ring alphabet that have not yet been discussed in the literature. Unlike in the cases reported earlier in the literature by various authors, the ambient spaces here are never chain rings.
Sergio R. López-Permouth, Steve Szabo
openaire +1 more source
On non-binary quantum repeated-root cyclic codes
International Journal of Quantum Information, 2014In this paper, based on the Steane's enlargement construction, three classes of non-binary quantum codes are constructed from classical repeated-root cyclic codes of length 2ps over 𝔽q with odd characteristic p. The exact minimum distances of these quantum codes are determined.
Wang, Liqi, Zhu, Shixin
openaire +1 more source
On repeated-root cyclic codes and its weight enumirator
2010 IEEE International Conference on Information Theory and Information Security, 2010The squaring and iterated squaring construction for cyclic codes, obtained from well known construction | u | u + v|, are widely in use because of their comparatively less complex nature. A large number of quality codes and lattices such as Reed-Mullar codes and Barnes-Wall lattices are generated by employing simple constructions.
Jaskaran S. Bhullar +2 more
openaire +1 more source
A class of 1-generator repeated root quasi-cyclic codes
Designs, Codes and Cryptography, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources