Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,197,627
Tolhuizen, “On q-ary codes correcting all unidirectional errors of a limited magnitude
- in Proceedings of the International Workshop on Algebraic and Combinatorial Coding Theory (ACCT
, 2004
"... Dedicated to the memory of Rom Varshamov We consider codes over the alphabet Q = {0,1,...,q − 1} intended for the control of unidirectional errors of level ℓ. That is, the transmission channel is such that the received word cannot contain both a component larger than the transmitted one and a compon ..."
Abstract
-
Cited by 11 (2 self)
- Add to MetaCart
component smaller than the transmitted one. Moreover, the absolute value of the difference between a transmitted component and its received version is at most ℓ. We introduce and study q-ary codes capable of correcting all unidirectional errors of level ℓ. Lower and upper bounds for the maximal size
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 741 (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
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 730 (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
Space/Time Trade-offs in Hash Coding with Allowable Errors
- Communications of the ACM
, 1970
"... this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash- coding methods are examined and compared with a particular conventional h ..."
Abstract
-
Cited by 2067 (0 self)
- Add to MetaCart
hash-coding method. The computational factors considered are the size of the hash area (space), the time required to identify a message as a nonmember of the given set (reject time), and an allowable error frequency
Iterative decoding of binary block and convolutional codes
- IEEE Trans. Inform. Theory
, 1996
"... Abstract- Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the ..."
Abstract
-
Cited by 600 (43 self)
- Add to MetaCart
and convolutional codes for lower rates less than 213. Any combination of block and convolutional component codes is possible. Several interleaving techniques are described. At a bit error rate (BER) of lo- * the performance is slightly above or around the bounds given by the cutoff rate for reasonably simple block
Bandera: Extracting Finite-state Models from Java Source Code
- IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finite-state verification techniques, such as model checking, have shown promise as a cost-effective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract
-
Cited by 653 (35 self)
- Add to MetaCart
finite-state model that approximates the executable behavior of the software system of interest. Current best-practice involves handconstruction of models which is expensive (prohibitive for all but the smallest systems), prone to errors (which can result in misleading verification results
A Limited Memory Algorithm for Bound Constrained Optimization
- SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract
-
Cited by 557 (9 self)
- Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
Effective Erasure Codes for Reliable Computer Communication Protocols
, 1997
"... Reliable communication protocols require that all the intended recipients of a message receive the message intact. Automatic Repeat reQuest (ARQ) techniques are used in unicast protocols, but they do not scale well to multicast protocols with large groups of receivers, since segment losses tend to b ..."
Abstract
-
Cited by 473 (14 self)
- Add to MetaCart
. Despite the widespread use of error correcting codes in many fields of information processing, and a general consensus on the usefulness of FEC techniques within some of the Internet protocols, very few actual implementations exist of the latter. This probably derives from the different types
Results 1 - 10
of
1,197,627
