Results 241 to 250 of about 520,695 (298)
Some of the next articles are maybe not open access.

Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes

IEEE Transactions on Information Theory, 2018
In this paper, we construct a new family of quantum synchronizable codes from repeated-root cyclic codes of lengths $p^{s}$ and $lp^{s}$ over $\mathbb {F}_{q}$ , where $s\geq 1~and l\geq 2$ are integers, and $p\geq 3$ is the odd characteristic.
Lan Luo, Zhi Ma
semanticscholar   +2 more sources

On generalizations of repeated-root cyclic codes

IEEE Transactions on Information Theory, 1996
The 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.
K. Zimmermann
semanticscholar   +2 more sources

Repeated-Root Isodual Cyclic Codes over Finite Fields

International Conference on Codes, Cryptology, and Information Security, 2015
In 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.
A. Batoul, K. Guenda, T. Gulliver
semanticscholar   +2 more sources

On LCD repeated-root cyclic codes over finite fields

Journal of Applied Mathematics and Computing, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Binbin Pang, Shixin Zhu, Jin Li
semanticscholar   +4 more sources

Quantum synchronizable codes from repeated-root quasi-cyclic codes

Computational and Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chao Du, Zhi Ma, Yiting Liu
openaire   +2 more sources

AMDS symbol-pair codes from repeated-root cyclic codes

Discrete Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Junru Ma, Jinquan Luo
openaire   +1 more source

On non-binary quantum repeated-root cyclic codes

International Journal of Quantum Information, 2014
In 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.
Liqi Wang, Shixin Zhu
semanticscholar   +2 more sources

Frequency domain description of repeated-root (cyclic) codes

Proceedings of 1994 IEEE International Symposium on Information Theory, 1994
Repeated-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 ...
P. Mathys
semanticscholar   +2 more sources

Programmer Cognition Failures as the Root Cause of Software Vulnerabilities: A Preliminary Review

2023 Intermountain Engineering, Technology and Computing (IETC), 2023
The causal analysis of software vulnerabilities can be an effective way for building and evolving a dependable and reliable software system. Vulnerable source code can be leveraged by the attackers to break the system.
Darsh Patel   +3 more
semanticscholar   +1 more source

NONBINARY QUANTUM CODES DERIVED FROM REPEATED-ROOT CYCLIC CODES

Modern Physics Letters B, 2013
Many 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

Home - About - Disclaimer - Privacy