Results 1 - 10
of
30,480
Near Shannon limit error-correcting coding and decoding
, 1993
"... Abstract- This paper deals with a new class of convolutional codes called Turbo-codes, whose performances in terms of Bit Error Rate (BER) are close to the SHANNON limit. The Turbo-Code encoder is built using a parallel concatenation of two Recursive Systematic Convolutional codes and the associated ..."
Abstract
-
Cited by 1776 (6 self)
- Add to MetaCart
Abstract- This paper deals with a new class of convolutional codes called Turbo-codes, whose performances in terms of Bit Error Rate (BER) are close to the SHANNON limit. The Turbo-Code encoder is built using a parallel concatenation of two Recursive Systematic Convolutional codes
Solving multiclass learning problems via error-correcting output codes
- JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 1995
"... Multiclass learning problems involve nding a de nition for an unknown function f(x) whose range is a discrete set containing k>2values (i.e., k \classes"). The de nition is acquired by studying collections of training examples of the form hx i;f(x i)i. Existing approaches to multiclass l ..."
Abstract
-
Cited by 726 (8 self)
- Add to MetaCart
output representations. This paper compares these three approaches to a new technique in which error-correcting codes are employed as a distributed output representation. We show that these output representations improve the generalization performance of both C4.5 and backpropagation on a wide range
Good Error-Correcting Codes based on Very Sparse Matrices
, 1999
"... We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract
-
Cited by 750 (23 self)
- Add to MetaCart
We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties
Good quantum error correcting codes exist
- REV. A
, 1996
"... A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (2-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used ..."
Abstract
-
Cited by 349 (9 self)
- Add to MetaCart
A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (2-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can
Error Correction
- Attractors, and Cointegration: Substantive and Methodological Issues,” Political Analysis
, 1992
"... ..."
Introduction to quantum error correction
, 1998
"... An introduction to quantum error correction (QEC) is given, and some recent developments ..."
Abstract
-
Cited by 15 (0 self)
- Add to MetaCart
An introduction to quantum error correction (QEC) is given, and some recent developments
Operator quantum error correction
- Quantum Information & Computation
, 2005
"... Abstract. This paper is an expanded and more detailed version of the work [1] in which the Operator Quantum Error Correction protocol was introduced. This is a new scheme for the error correction of quantum operations that incorporates the known techniques — i.e. the standard error correction model, ..."
Abstract
-
Cited by 46 (3 self)
- Add to MetaCart
Abstract. This paper is an expanded and more detailed version of the work [1] in which the Operator Quantum Error Correction protocol was introduced. This is a new scheme for the error correction of quantum operations that incorporates the known techniques — i.e. the standard error correction model
An Introduction to Quantum Error Correction
- Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium, pages 221–235, Rhode Island, 2002. American Mathematical Society. eprint: quant-ph/0004072
, 2002
"... Abstract. Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some ..."
Abstract
-
Cited by 14 (0 self)
- Add to MetaCart
Abstract. Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some
Results 1 - 10
of
30,480