The Experts below are selected from a list of 19797 Experts worldwide ranked by ideXlab platform
Andrzej Dziech - One of the best experts on this subject based on the ideXlab platform.
-
multidimensional enhanced hadamard error Correcting Code in comparison with reed solomon Code in video watermarking applications
WSEAS Transactions on Signal Processing archive, 2017Co-Authors: Jakob Wassermann, Andrzej DziechAbstract:Watermarking technology.play a central role in the digital right management for multimedia data. Especially a video watermarking is a real challenge, because of very high compression ratio (about 1:200). Normally the watermarks can barely survive such massive attacks, despite very sophisticated embedding strategies. It can only work with a sufficient error Correcting Code method. In this paper, the authors introduce a new developed Enhanced Multidimensional Hadamard Error Correcting Code (EMHC), which is based on well known Hadamard Code, and compare his performance with Reed-Solomon Code regarding its ability to preserve watermarks in the embedded video. The main idea of this new developed multidimensional Enhanced Hadamard Error Correcting Code is to map the 2D basis images into a collection of one-dimensional rows and to apply a 1D Hadamard decoding procedure on them. After this, the image is reassembled, and the 2D decoding procedure can be applied more efficiently. With this approach, it is possible to overcome the theoretical limit of error Correcting capability of (d-1)/2 bits, where d is a minimum Hamming distance. Even better results could be achieved by expanding the 2D to 3D EMHC. A full description is given of encoding and decoding procedure of such Hadamard Cubes and their implementation into video watermarking procedure.To prove the efficiency and practicability of this new Enhanced Hadamard Code, the method was applied to a video Watermarking Coding Scheme. The Video Watermarking Embedding procedure decomposes the initial video through Multi-Level Interframe Wavelet Transform. The low pass filtered part of the video stream is used for embedding the watermarks, which are protected respectively by Enhanced Hadamard or Reed-Solomon Correcting Code. The experimental results show that EHC performs much better than RS Code and seems to be very robust against strong MPEG compression.
-
application of enhanced hadamard error Correcting Code in video watermarking and his comparison to reed solomon Code
MATEC Web of Conferences, 2017Co-Authors: Andrzej Dziech, Jakob WassermannAbstract:Error Correcting Codes are playing a very important role in Video Watermarking technology. Because of very high compression rate (about 1:200) normally the watermarks can barely survive such massive attacks, despite very sophisticated embedding strategies. It can only work with a sufficient error Correcting Code method. In this paper, the authors compare the new developed Enhanced Hadamard Error Correcting Code (EHC) with well known Reed-Solomon Code regarding its ability to preserve watermarks in the embedded video. The main idea of this new developed multidimensional Enhanced Hadamard Error Correcting Code is to map the 2D basis images into a collection of one-dimensional rows and to apply a 1D Hadamard decoding procedure on them. After this, the image is reassembled, and the 2D decoding procedure can be applied more efficiently. With this approach, it is possible to overcome the theoretical limit of error Correcting capability of ( d -1)/2 bits, where d is a Hamming distance. Even better results could be achieved by expanding the 2D EHC to 3D. To prove the efficiency and practicability of this new Enhanced Hadamard Code, the method was applied to a video Watermarking Coding Scheme. The Video Watermarking Embedding procedure decomposes the initial video trough multi-Level Interframe Wavelet Transform. The low pass filtered part of the video stream is used for embedding the watermarks, which are protected respectively by Enhanced Hadamard or Reed-Solomon Correcting Code. The experimental results show that EHC performs much better than RS Code and seems to be very robust against strong MPEG compression.
Raymond Laflamme - One of the best experts on this subject based on the ideXlab platform.
-
Experimental implementation of enCoded logical qubit operations in a perfect quantum error Correcting Code.
Physical review letters, 2012Co-Authors: Jingfu Zhang, Raymond Laflamme, Dieter SuterAbstract:Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the enCoded qubits. Here, we present examples of such operations by implementing, in addition to the identity operation, the NOT and the Hadamard gate to a logical qubit enCoded in a five qubit system that allows correction of arbitrary single-qubit errors. We perform quantum process tomography of the enCoded gate operations, demonstrate the successful correction of all possible single-qubit errors, and measure the fidelity of the enCoded logical gate operations.
-
benchmarking quantum computers the five qubit error Correcting Code
Physical Review Letters, 2001Co-Authors: E Knill, Raymond Laflamme, Rodolfo A Martinez, C NegrevergneAbstract:The smallest quantum Code that can correct all one-qubit errors is based on five qubits. We experimentally implemented the encoding, decoding, and error-correction quantum networks using nuclear magnetic resonance on a five spin subsystem of labeled crotonic acid. The ability to correct each error was verified by tomography of the process. The use of error correction for benchmarking quantum networks is discussed, and we infer that the fidelity achieved in our experiment is sufficient for preserving entanglement.
-
theory of quantum error correction for general noise
Physical Review Letters, 2000Co-Authors: Emanuel Knill, Raymond Laflamme, Lorenza ViolaAbstract:A measure of quality of an error-Correcting Code is the maximum number of errors that it is able to correct. We show that a suitable notion of ''number of errors'' e makes sense for any quantum or classical system in the presence of arbitrary interactions. Thus, e -error-Correcting Codes protect information without requiring the usual assumptions of independence. We prove the existence of large Codes for both quantum and classical information. By viewing error-Correcting Codes as subsystems, we relate Codes to irreducible representations of operator algebras and show that noiseless subsystems are infinite-distance error-Correcting Codes. (c) 2000 The American Physical Society.
-
perfect quantum error Correcting Code
Physical Review Letters, 1996Co-Authors: Raymond Laflamme, Cesar Miquel, Juan Pablo Paz, Wojciech H. ZurekAbstract:We present a quantum error correction Code which protects a qubit of information against general one qubit errors. To accomplish this, we enCode the original state by distributing quantum information over five qubits, the minimal number required for this task. We describe a circuit which takes the initial state with four extra qubits in the state {vert_bar}0{r_angle} to the enCoded state. It can also be converted into a deCoder by running it backward. The original state of the enCoded qubit can then be restored by a simple unitary transformation. {copyright} {ital 1996 The American Physical Society.}
-
perfect quantum error Correcting Code
Physical Review Letters, 1996Co-Authors: Raymond Laflamme, Cesar Miquel, Juan Pablo Paz, Wojciech H. ZurekAbstract:We present a quantum error correction Code which protects a qubit of information against general one qubit errors. To accomplish this, we enCode the original state by distributing quantum information over five qubits, the minimal number required for this task. We describe a circuit which takes the initial state with four extra qubits in the state $|0〉$ to the enCoded state. It can also be converted into a deCoder by running it backward. The original state of the enCoded qubit can then be restored by a simple unitary transformation.
Jakob Wassermann - One of the best experts on this subject based on the ideXlab platform.
-
multidimensional enhanced hadamard error Correcting Code in comparison with reed solomon Code in video watermarking applications
WSEAS Transactions on Signal Processing archive, 2017Co-Authors: Jakob Wassermann, Andrzej DziechAbstract:Watermarking technology.play a central role in the digital right management for multimedia data. Especially a video watermarking is a real challenge, because of very high compression ratio (about 1:200). Normally the watermarks can barely survive such massive attacks, despite very sophisticated embedding strategies. It can only work with a sufficient error Correcting Code method. In this paper, the authors introduce a new developed Enhanced Multidimensional Hadamard Error Correcting Code (EMHC), which is based on well known Hadamard Code, and compare his performance with Reed-Solomon Code regarding its ability to preserve watermarks in the embedded video. The main idea of this new developed multidimensional Enhanced Hadamard Error Correcting Code is to map the 2D basis images into a collection of one-dimensional rows and to apply a 1D Hadamard decoding procedure on them. After this, the image is reassembled, and the 2D decoding procedure can be applied more efficiently. With this approach, it is possible to overcome the theoretical limit of error Correcting capability of (d-1)/2 bits, where d is a minimum Hamming distance. Even better results could be achieved by expanding the 2D to 3D EMHC. A full description is given of encoding and decoding procedure of such Hadamard Cubes and their implementation into video watermarking procedure.To prove the efficiency and practicability of this new Enhanced Hadamard Code, the method was applied to a video Watermarking Coding Scheme. The Video Watermarking Embedding procedure decomposes the initial video through Multi-Level Interframe Wavelet Transform. The low pass filtered part of the video stream is used for embedding the watermarks, which are protected respectively by Enhanced Hadamard or Reed-Solomon Correcting Code. The experimental results show that EHC performs much better than RS Code and seems to be very robust against strong MPEG compression.
-
application of enhanced hadamard error Correcting Code in video watermarking and his comparison to reed solomon Code
MATEC Web of Conferences, 2017Co-Authors: Andrzej Dziech, Jakob WassermannAbstract:Error Correcting Codes are playing a very important role in Video Watermarking technology. Because of very high compression rate (about 1:200) normally the watermarks can barely survive such massive attacks, despite very sophisticated embedding strategies. It can only work with a sufficient error Correcting Code method. In this paper, the authors compare the new developed Enhanced Hadamard Error Correcting Code (EHC) with well known Reed-Solomon Code regarding its ability to preserve watermarks in the embedded video. The main idea of this new developed multidimensional Enhanced Hadamard Error Correcting Code is to map the 2D basis images into a collection of one-dimensional rows and to apply a 1D Hadamard decoding procedure on them. After this, the image is reassembled, and the 2D decoding procedure can be applied more efficiently. With this approach, it is possible to overcome the theoretical limit of error Correcting capability of ( d -1)/2 bits, where d is a Hamming distance. Even better results could be achieved by expanding the 2D EHC to 3D. To prove the efficiency and practicability of this new Enhanced Hadamard Code, the method was applied to a video Watermarking Coding Scheme. The Video Watermarking Embedding procedure decomposes the initial video trough multi-Level Interframe Wavelet Transform. The low pass filtered part of the video stream is used for embedding the watermarks, which are protected respectively by Enhanced Hadamard or Reed-Solomon Correcting Code. The experimental results show that EHC performs much better than RS Code and seems to be very robust against strong MPEG compression.
Sergio Verdu - One of the best experts on this subject based on the ideXlab platform.
-
a new data compression algorithm for sources with memory based on error Correcting Codes
Information Theory Workshop, 2003Co-Authors: Giuseppe Caire, Shlomo Shamai, Sergio VerduAbstract:A new fixed-length asymptotically optimal scheme for lossless compression of stationary ergodic tree sources with memory is proposed. Our scheme is based on the concatenation of the Burrows-Wheeler block sorting transform with the syndrome former of a linear error Correcting Code. Low-density parity-check (LDPC) Codes together with belief propagation decoding lead to linear compression and decompression times, and to natural universal implementation of the algorithm.
Wojciech H. Zurek - One of the best experts on this subject based on the ideXlab platform.
-
perfect quantum error Correcting Code
Physical Review Letters, 1996Co-Authors: Raymond Laflamme, Cesar Miquel, Juan Pablo Paz, Wojciech H. ZurekAbstract:We present a quantum error correction Code which protects a qubit of information against general one qubit errors. To accomplish this, we enCode the original state by distributing quantum information over five qubits, the minimal number required for this task. We describe a circuit which takes the initial state with four extra qubits in the state {vert_bar}0{r_angle} to the enCoded state. It can also be converted into a deCoder by running it backward. The original state of the enCoded qubit can then be restored by a simple unitary transformation. {copyright} {ital 1996 The American Physical Society.}
-
perfect quantum error Correcting Code
Physical Review Letters, 1996Co-Authors: Raymond Laflamme, Cesar Miquel, Juan Pablo Paz, Wojciech H. ZurekAbstract:We present a quantum error correction Code which protects a qubit of information against general one qubit errors. To accomplish this, we enCode the original state by distributing quantum information over five qubits, the minimal number required for this task. We describe a circuit which takes the initial state with four extra qubits in the state $|0〉$ to the enCoded state. It can also be converted into a deCoder by running it backward. The original state of the enCoded qubit can then be restored by a simple unitary transformation.
