Results 221 to 230 of about 258,202 (236)
Some of the next articles are maybe not open access.
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 generalizations of repeated-root cyclic codes
IEEE Transactions on Information Theory, 1996The author first considers repeated-root cyclic codes, i.e. cyclic codes whose block length is divisible by the characteristic of the underlying field. The error-correction capabilities of repeated-root cyclic codes are studied. Also some properties and their generalization of the repeated-root cyclic codes are determined.
openaire +1 more source
Construction of Asymmetric Quantum Product Codes Based Repeated-Root Cyclic Codes
Applied Mechanics and Materials, 2014A kind of classical product codes based on repeated-root cyclic codes are considered in this paper, and the classical product codes are applied to construct the asymmetric quantum product codes. The novel asymmetric quantum product codes have great asymmetry for correcting Z errors and X errors, and the parameters of asymmetric quantum product codes ...
Pan Yue Fu, Wei Liu
openaire +1 more source
Repeated-Root Constacyclic Codes of Length $$k\ell p^s$$
Bulletin of the Malaysian Mathematical Sciences Society, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Yan, Shi, Minjia
openaire +2 more sources
Repeated-Root Isodual Cyclic Codes over Finite Fields
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.
Aicha Batoul +2 more
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
Frequency domain description of repeated-root (cyclic) codes
Proceedings of 1994 IEEE International Symposium on Information Theory, 2002Repeated-root cyclic codes have been investigated. A "frequency" domain description for such codes is introduced which leads to a generalization of repeated-root codes which are quasi-cyclic instead of cyclic, but have better code parameters. The "frequency" domain description cannot be done in terms of generalized Fourier transforms, but it is ...
openaire +1 more source
On LCD repeated-root cyclic codes over finite fields
Journal of Applied Mathematics and Computing, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pang, Binbin, Zhu, Shixin, Li, Jin
openaire +2 more sources
ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4ps
Asian-European Journal of Mathematics, 2013For any odd prime p, a classification of all constacyclic codes of length 4ps over š¯”½pm is obtained, which establishes the algebraic structure in term of specified polynomial generators of such codes. Among other results, all self-dual and LCD cyclic and negacylic codes of length 4ps are obtained. As an example, all constacyclic codes of length 36 over
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.
Yang, Jin +2 more
openaire +1 more source