Sciweavers

85 search results - page 1 / 17
» Code Roots
Sort
View
PDCN
2004
13 years 5 months ago
Implementing a secure setuid program
Setuid programs are often exploited by malicious attackers to obtain unauthorized access to local systems. Setuid programs, especially owned by the root user, are granted root pri...
Takahiro Shinagawa, Kenji Kono
ITA
2007
118views Communications» more  ITA 2007»
13 years 4 months ago
Uniformly bounded duplication codes
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing dupl...
Peter Leupold, Victor Mitrana
CORR
2006
Springer
163views Education» more  CORR 2006»
13 years 4 months ago
Finding roots of polynomials over finite fields
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
Sergei V. Fedorenko, Peter Vladimirovich Trifonov
EUROGP
2003
Springer
13 years 9 months ago
The Root Causes of Code Growth in Genetic Programming
This paper discusses the underlying pressures responsible for code growth in genetic programming, and shows how an understanding of these pressures can be used to use to eliminate...
Matthew J. Streeter
DM
2008
117views more  DM 2008»
13 years 4 months ago
Classes of optical orthogonal codes from arcs in root subspaces
We present new constructions for (n, w, ) optical orthogonal codes (OOC) using techniques from finite projective geometry. In one case codewords correspond to (q - 1)-arcs contain...
T. L. Alderson, Keith E. Mellinger