Results 1  10
of
1,601
The True Minimum Distance of Some NarrowSense BCHCodes of Length 255
, 1993
"... Using equivalent codes it is shown that the BCHbound for the following narrowsense BCHcodes already yields the true minimum distance: [255,87,53], [255,107,45], [255,115,43], [255,123,39], [255,131,37], [255,147,29], [255,163,25], [255,179,21]. For the remaining two narrowsense BCHcodes of lengt ..."
Abstract
 Add to MetaCart
Using equivalent codes it is shown that the BCHbound for the following narrowsense BCHcodes already yields the true minimum distance: [255,87,53], [255,107,45], [255,115,43], [255,123,39], [255,131,37], [255,147,29], [255,163,25], [255,179,21]. For the remaining two narrowsense BCH
The True Minimum Distance of Some NarrowSense BCHCodes of Length 255
"... Using equivalent codes it is shown that the BCHbound for the following narrowsense BCHcodes already yields the true minimum distance: [255,87,53], [255,107,45], [255,115,43], [255,123,39], [255,131,37], [255,147,29], [255,163,25], [255,179,21]. For the remaining two narrowsense BCHcodes of lengt ..."
Abstract
 Add to MetaCart
Using equivalent codes it is shown that the BCHbound for the following narrowsense BCHcodes already yields the true minimum distance: [255,87,53], [255,107,45], [255,115,43], [255,123,39], [255,131,37], [255,147,29], [255,163,25], [255,179,21]. For the remaining two narrowsense BCH
True Minimum Energy Design Using Dual BelowThreshold Supply Voltages
 INTERNATIONAL CONFERENCE ON VLSI DESIGN
, 2011
"... This paper investigates subthreshold voltage operation of digital circuits. The minimum energy per cycle operating point with a single voltage for this mode is known. We further lower the energy per cycle below that point by using dual subthreshold supplies. We call this the true minimum. Special co ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
This paper investigates subthreshold voltage operation of digital circuits. The minimum energy per cycle operating point with a single voltage for this mode is known. We further lower the energy per cycle below that point by using dual subthreshold supplies. We call this the true minimum. Special
Decode Binary Cyclic Codes up to the True Minimum Distance, IEEE
"... come strumendo per dedurre l ’ error locator polynomial dei codici ciclici. Segeuendo la idea, Chen et al. [4, 5, 6] proposero un algoritmo generale per instanziare l’approccio di Cooper. Si seguirà, sulla base di un esempio istruttivo, gli argomenti che, attraverso una serie di approssimazioni [9, ..."
Abstract
 Add to MetaCart
come strumendo per dedurre l ’ error locator polynomial dei codici ciclici. Segeuendo la idea, Chen et al. [4, 5, 6] proposero un algoritmo generale per instanziare l’approccio di Cooper. Si seguirà, sulla base di un esempio istruttivo, gli argomenti che, attraverso una serie di approssimazioni [9, 3, 10], hanno portato al seguento risultato Teorema 1. Per ogni [n, k, d]codice ciclico binario C con n dispari, denotando F lo splitting field di xn − 1 su Z2, il calcolo di un‘opportuna base di Gröbner permette di ottenere un polinomio L ∈ Z2[X, z], con X = (x1,..., xn−k) che soddisfa le sequenti proprietà 1. L(X, z) = zt+at−1(X)zt−1+ · · ·+a0(X), con aj ∈ Z2[X], 0 ≤ j ≤ t−1; 2. dato un vettore di sindromi s = (s1,..., sn−k) ∈ (F)n−k corriospondente ad un errore di pese µ ≤ t, se valutiamo le variabili X in s, allora le t radici di L(s, z) sono, a parte 0 con molteplicita ̀ t − µ, le µ locazioni dell’errore. Si illustera ̀ anche l’approccio alternativo proposto in [5, 1, 2].
Hidden Markov models for detecting remote protein homologies
 Bioinformatics
, 1998
"... A new hidden Markov model method (SAMT98) for nding remote homologs of protein sequences is described and evaluated. The method begins with a single target sequence and iteratively builds a hidden Markov model (hmm) from the sequence and homologs found using the hmm for database search. SAMT98 is ..."
Abstract

Cited by 462 (15 self)
 Add to MetaCart
. The method is compared against wublastp and against doubleblast, a twostep method similar to ISS, but using blast instead of fasta. Results SAMT98 had the fewest errors in all tests dramatically so for the foldrecognition tests. At the minimumerror point on the SCOPdomains test, SAMT98 got 880 true
Applying parallel computation algorithms in the design of serial algorithms
 J. ACM
, 1983
"... The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even when multiprocessor machines are not available. This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for designing an eff ..."
Abstract

Cited by 243 (7 self)
 Add to MetaCart
The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even when multiprocessor machines are not available. This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for designing
Parallel Preconditioning with Sparse Approximate Inverses
 SIAM J. Sci. Comput
, 1996
"... A parallel preconditioner is presented for the solution of general sparse linear systems of equations. A sparse approximate inverse is computed explicitly, and then applied as a preconditioner to an iterative method. The computation of the preconditioner is inherently parallel, and its application o ..."
Abstract

Cited by 226 (10 self)
 Add to MetaCart
only requires a matrixvector product. The sparsity pattern of the approximate inverse is not imposed a priori but captured automatically. This keeps the amount of work and the number of nonzero entries in the preconditioner to a minimum. Rigorous bounds on the clustering of the eigenvalues
Entanglement of Formation of an Arbitrary State of Two Qubits
, 1998
"... The entanglement of a pure state of a pair of quantum systems is defined as the entropy of either member of the pair. The entanglement of formation of a mixed state ρ is defined as the minimum average entanglement of a set of pure states constituting a decomposition of ρ. An earlier paper [Phys. Rev ..."
Abstract

Cited by 200 (0 self)
 Add to MetaCart
The entanglement of a pure state of a pair of quantum systems is defined as the entropy of either member of the pair. The entanglement of formation of a mixed state ρ is defined as the minimum average entanglement of a set of pure states constituting a decomposition of ρ. An earlier paper [Phys
Minimum Satisfying Assignments for SMT ⋆
"... Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum satisfying assignments have applications in software and hardware verification, electronic design automation, and diagnost ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum satisfying assignments have applications in software and hardware verification, electronic design automation
True Spreads and Equilibrium Prices
 THE JOURNAL OF FINANCE • VOL. LVI, NO. 5 • OCT. 2001
, 2001
"... Stocks and other financial assets are traded at prices that lie on a fixed grid determined by the minimum tick size. Observed prices and quoted spreads do not correspond to the equilibrium prices and true spreads that would exist in a market with no minimum tick size. Using Monte Carlo Markov Chain ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
Stocks and other financial assets are traded at prices that lie on a fixed grid determined by the minimum tick size. Observed prices and quoted spreads do not correspond to the equilibrium prices and true spreads that would exist in a market with no minimum tick size. Using Monte Carlo Markov Chain
Results 1  10
of
1,601