Sciweavers

500 search results - page 54 / 100
» codes 1998
Sort
View
ECOOPW
1998
Springer
14 years 29 days ago
MOPping up Exceptions
: This paper describes the development of a model for the reflective treatment of both application and environmentally sourced exceptions. We show how a variety of exception models...
Stuart E. Mitchell, Alan Burns, Andy J. Wellings
ISSAC
1998
Springer
88views Mathematics» more  ISSAC 1998»
14 years 29 days ago
Multidimensional Chains of Recurrences
A technique to expedite iterative computations which is based on multidimensional chains of recurrences MCR is presented. Algorithms for MCR construction, interpretation and MCR-b...
V. Kislenkov, V. Mitrofanov, Eugene V. Zima
SACRYPT
1998
Springer
129views Cryptology» more  SACRYPT 1998»
14 years 28 days ago
An Accurate Evaluation of Maurer's Universal Test
Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (...
Jean-Sébastien Coron, David Naccache
APAL
1998
121views more  APAL 1998»
13 years 8 months ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...
JSAC
1998
136views more  JSAC 1998»
13 years 8 months ago
Concatenated Decoding with a Reduced-Search BCJR Algorithm
—We apply two reduced-computation variants of the BCJR algorithm to the decoding of serial and parallel concatenated convolutional codes. One computes its recursions at only M st...
Volker Franz, John B. Anderson