Results 1  10
of
11,463
ShortLength Menger Theorems
 SRC TECHNICAL NOTE 1997  022, DEC, SYSTEMS RESEARCH
, 1997
"... We give short and simple proofs of the following two theorems by Galil and Yu [3]. Let s and t be two vertices in an nnode graph G. (1) There exist k edgedisjoint st paths of total length O(n # k). (2) If we additionally assume that the minimum degree of G is at least k, then there exist k edge ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We give short and simple proofs of the following two theorems by Galil and Yu [3]. Let s and t be two vertices in an nnode graph G. (1) There exist k edgedisjoint st paths of total length O(n # k). (2) If we additionally assume that the minimum degree of G is at least k, then there exist k
Short signatures from the Weil pairing
, 2001
"... We introduce a short signature scheme based on the Computational DiffieHellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signatures ar ..."
Abstract

Cited by 755 (25 self)
 Add to MetaCart
We introduce a short signature scheme based on the Computational DiffieHellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signatures
RateCompatible ShortLength Protograph LDPC Codes
"... Abstract—This paper produces a ratecompatible protograph LDPC code at 1k information blocklength with superior performance in both waterfall and error floor regions. The design of such codes has proved difficult in the past because the constraints imposed by structured design (protographs), ratec ..."
Abstract
 Add to MetaCart
1/3 to 4/5 and show no error floor down to 10−6 FER. Index Terms—LDPC codes, protograph, ratecompatible, shortlength.
Rate of Temperature Change in ShortLength Round Timbers
"... This paper discusses factors affecting the rate of temperature change in wood and includes timetemperature curves for use in determining the temperature obtained at different points in shortlength log sections when heated in steam or hot water. One group of curves shows the temperature distributio ..."
Abstract
 Add to MetaCart
This paper discusses factors affecting the rate of temperature change in wood and includes timetemperature curves for use in determining the temperature obtained at different points in shortlength log sections when heated in steam or hot water. One group of curves shows the temperature
Separating Bounded Arithmetic Theories With Short Length Induction
"... . We define a hierarchy of bounded arithmetic L i 2 for i 1 which are modifications of TAC of Clote and Takeuti. Provably total functions of L i 2 are characterized in terms of circuit complexity. As a consequence nonconservation results are obtained for L i 2 and L i+2 2 by applying a low ..."
Abstract
 Add to MetaCart
. We define a hierarchy of bounded arithmetic L i 2 for i 1 which are modifications of TAC of Clote and Takeuti. Provably total functions of L i 2 are characterized in terms of circuit complexity. As a consequence nonconservation results are obtained for L i 2 and L i+2 2 by applying a lower bound for stconnectivity. A weaker nonconservation result is also obtained between AC 0 CA and L i 2 using the KPT witnessing theorem. 1 Introduction Theories of bounded arithmetic are, in general, axiomatized by defining axioms for symbols in the language together with restricted forms of wellknown axiom schemata. S. Buss introduced the theory S 1 2 which has a weak induction scheme called polynomial induction (PIND) restricted to NP formulae. Much weaker induction was used to define theories for boolean circuit classes. B. Allen [1] and P. Clote and G. Takeuti [5] independently defined theories whose provably total functions correspond to the class NC. Both of them used essenti...
Fabrication of Extremely Short Length Fiber Bragg Gratings for Sensor Applications
"... A new technique and a physical model for writing extremely short length Bragg gratings in optical fibers have been developed. The model describes the effects of diffraction on the spatial spectra and therefore, the wavelength spectra of the Bragg gratings. Using an interferometric technique and a va ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A new technique and a physical model for writing extremely short length Bragg gratings in optical fibers have been developed. The model describes the effects of diffraction on the spatial spectra and therefore, the wavelength spectra of the Bragg gratings. Using an interferometric technique and a
Adaptive Least Squares Image Restoration Using Whitening Filters of Short Length
"... . This paper presents a regularized least squares algorithm for the restoration and reconstruction of images. A whitening filter of short length provides the regularization function. An adaptive version of the algorithm is developed by matching a weighting function to the regularization function. Th ..."
Abstract
 Add to MetaCart
. This paper presents a regularized least squares algorithm for the restoration and reconstruction of images. A whitening filter of short length provides the regularization function. An adaptive version of the algorithm is developed by matching a weighting function to the regularization function
Shortlength raptor codes for mobile freespace optical channels
 in Communications, 2009. ICC’09. IEEE International Conference on. IEEE, 2009
"... Abstract—Freespace optical (FSO) links are competitive wireless links offering high data rate, security and low system complexity. For mobile applications, e.g., from a ground base station to an unmanned aerial vehicle (UAV), the FSO channel can suffer from severe instantaneous misalignment. This ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to the high data rates required, shortlength (16−1024) Raptor codes are designed and simulated on a severe jitter FSO channel. A key advantage of Raptor codes is their independence on channel state, no matter how large the misalignment. With a 1 Gbps transmitter, the designed Raptor code with k = 64 message
Results 1  10
of
11,463