Sciweavers

314 search results - page 3 / 63
» Arithmetic Coding Revisited
Sort
View
ICASSP
2009
IEEE
14 years 29 days ago
DNA coding using finite-context models and arithmetic coding
The interest in DNA coding has been growing with the availability of extensive genomic databases. Although only two bits are sufficient to encode the four DNA bases, efficient l...
Armando J. Pinho, António J. R. Neves, Carl...
JSYML
2008
109views more  JSYML 2008»
13 years 6 months ago
Closed fragments of provability logics of constructive theories
In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the c...
Albert Visser
EUROCRYPT
2005
Springer
13 years 11 months ago
Floating-Point LLL Revisited
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
Phong Q. Nguyen, Damien Stehlé
AINA
2007
IEEE
13 years 10 months ago
Crick's Hypothesis Revisited: The Existence of a Universal Coding Frame
In 1957 Crick hypothesized that the genetic code was a comma free code. This property would imply the existence of a universal coding frame and make the set of coding sequences a ...
Jean-Louis Lassez, Ryan A. Rossi, Axel E. Bernal
METMBS
2003
128views Mathematics» more  METMBS 2003»
13 years 7 months ago
Genetic Code as a Gray Code Revisited
In this paper we revisit the idea of relating the genetic code to a Gray code. This idea was originally fostered by Rosemary Swanson as a “unifying concept for the amino acid co...
Dragan Bosnacki, Huub M. M. ten Eikelder, Peter A....