Results 21 to 30 of about 246,403 (284)

Elementary gates for quantum computation [PDF]

, 1995
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many bits $n$ (U ...
A. C. C. Yao, A. Peres, Adriano Barenco, B. Schumacher, C. H. Bennett, C. H. Bennett, Charles H. Bennett, D. Coppersmith, D. Deutsch, D. Deutsch, D. Deutsch, D. P. DiVincenzo, D. P. DiVincenzo, David P. DiVincenzo, E. Fredkin, G. Brassard, G. J. Milburn, Harald Weinfurter, John A. Smolin, M. Reck, Michael Ben Or, N. Margolus, Norman Margolus, P. Benioff, P. W. Shor, Peter Shor, R. Jozsa, R. Landauer, R. P. Feynman, Richard Cleve, S. Lloyd, S. Lloyd, Tycho Sleator, W. G. Unruh   +33 more
core   +10 more sources

Extended Code Index Modulation Scheme Based on Reversible Elementary Cellular Automata Encryption [PDF]

Jisuanji kexue
In order to address the problems of limited pseudo noise(PN)code resources in direct sequence spread spectrum system and degraded bit error rate(BER)performance of code index mo-dulation system,this paper proposes an extended code index modulation(E-CIM ...
ZHAO Geng, HUANG Sijie, MA Yingjie, DONG Youheng, WU Rui
doaj   +1 more source

Decoding Cyclic Codes up to a New Bound on the Minimum Distance [PDF]

, 2012
A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special cases of our bound.
Bezzateev, Sergey, Wachter, Antonia, Zeh, Alexander   +2 more
core   +2 more sources

Reverse–Complement Similarity Codes

Electronic Notes in Discrete Mathematics, 2005
Abstract We discuss a general notion of similarity function between two sequences which is based on their common subsequences. This notion arises in some applications of molecular biology [A.G. D'yachkov, P.L. Erdos, A.J. Macula, V.V. Rykov, D.C. Torney, C.-S. Tung, P.A. Vilenkin, and P.S.
A. D’yachkov, D. Torney, P. Vilenkin, S. White   +3 more
openaire   +1 more source

Efficient Reversible Data Hiding Scheme for AMBTC-Compressed Images

Applied Sciences, 2021
Reversible data hiding has attracted significant attention from researchers because it can extract an embedded secret message correctly and recover a cover image without distortion.
Chia-Chen Lin, Thai-Son Nguyen, Chin-Chen Chang, Wen-Chi Chang   +3 more
doaj   +1 more source

Indeterminate-length quantum coding [PDF]

, 2000
The quantum analogues of classical variable-length codes are indeterminate-length quantum codes, in which codewords may exist in superpositions of different lengths. This paper explores some of their properties.
A. R. Calderbank, A. Steane, B. Schumacher, B. Schumacher, Benjamin Schumacher, C. H. Bennett, C. H. Bennett, C. H. Bennett, C. H. Bennett, H. Barnum, H. Barnum, I. L. Chuang, M. A. Nielsen, Michael D. Westmoreland, P. W. Shor, R. Jozsa, R. Laflamme, T. M. Cover, T. Toffoli   +18 more
core   +2 more sources

Reversible Data Hiding in Encrypted DICOM Images Using Cyclic Binary Golay (23, 12) Code

IEEE Access, 2021
In this paper, a novel reversible data hiding method for encrypted images (RDHEI) is proposed. An efficient coding scheme based on cyclic binary Golay (23, 12) code is designed to embed additional data into the least significant bits (LSBs) of the ...
Mariusz Dzwonkowski, Roman Rykaczewski
doaj   +1 more source

Self dual, reversible and complementary duals constacyclic codes over finite local Frobenius non-chain rings of length 5 and nilpotency index 4.

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021
Over finite local Frobenius non-chain rings of length 5 and nilpotency index 4 and when the length of the code is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of γ-constacyclic codes is established ...
Castillo-Guillén C. A., Álvarez-García C.   +1 more
doaj   +1 more source

Reversible Self-Dual Codes over Finite Field

Cauchy: Jurnal Matematika Murni dan Aplikasi
Reversible self-dual code is a linear code which combine the properties from self-dual code and reversible code. Previous research shows that reversible self-dual codes have only been developed over field of order 2 and order 4.
Ardi Nur Hidayat, Vira Hari Krisnawati, Abdul Rouf Alghofari   +2 more
doaj   +1 more source

Generating reversible circuits from higher-order functional programs

, 2016
Boolean reversible circuits are boolean circuits made of reversible elementary gates. Despite their constrained form, they can simulate any boolean function.
A Ambainis, AS Green, AW Harrow, CH Bennett, F Magniez, J-Y Girard, M Saeedi, M Soeken, MA Nielsen, P Gupta, R Laundauer, RP Feynman, RS Nikhil, S Abramsky, T Braibant, W Kluge   +15 more
core   +3 more sources