Filters








1,882 Hits in 4.0 sec

Optimal constant weight codes over Zk and generalized designs

Tuvi Etzion
1997 Discrete Mathematics  
We consider optimal constant weight codes over arbitrary alphabets. Some of these codes are derived from good codes over the same alphabet, and some of these codes are derived from block design.  ...  Finally, we consider classes of codes which are MDS constant weight codes.  ...  Acknowledgements The author is indebted to Noga Alon, Ed Assmus, Alan Hartman, Vera Pless, and Ronny Roth, for their helpful comments and observations.  ... 
doi:10.1016/0012-365x(95)00333-r fatcat:wfapzy3gdvdd5akjs4r7mfdh6e

Sequential Monte-Carlo Approximation to the ML Time-Delay Estimator in a Multipath Channel

Pau Closas, Carles Fernandez-Prades, Juan A. Fernandez-Rubio
2006 2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications  
In direct-sequence spread-spectrum (DS-SS) based navigation systems, multipath can seriously degrade synchronization performance causing time delay and code phase estimates to deviate from the actual value  ...  These algorithms are based on different combinations of Early and Late samples of the correlation function and consider different chip-spacings (y) between these samples [3] .  ...  This states that variance of importance weights can only increase over time. After a certain number of recursive steps, all but one particle will have negligible normalized weights.  ... 
doi:10.1109/spawc.2006.346463 fatcat:zxtquxm4frbv3oojyus23pa2fe

A pruning heuristic for use with multisource product design

Peter Tarasewich, Patrick R. McMullen
2001 European Journal of Operational Research  
A model has been developed that uses conjoint data from consumers and designers and optimizes a product design based on the total shareof-choices.  ...  Products can be improved by integrating multiple viewpoints during the design process.  ...  designers (weighted by a 1 and a 2 , if necessary) who prefer a particular product design over the status-quo design.  ... 
doi:10.1016/s0377-2217(99)00350-1 fatcat:b7fnudq56zdanmbu2jsnfc65gi

Parameter Filter-based Event-triggered Learning [article]

Sebastian Schlor, Friedrich Solowjow, Sebastian Trimpe
2022 arXiv   pre-print
Even precisely tuned estimates of unknown parameters will deteriorate over time. Therefore, it is essential to detect the change to avoid suboptimal or even dangerous behavior of a control system.  ...  These filters yield point estimates of the unknown parameters and, further, an inherent notion of uncertainty.  ...  While this is desirable for constant model parameters, there will be issues if the system changes over time.  ... 
arXiv:2204.02059v1 fatcat:sztqabv645fyvbogwq6kpbixs4

BER analysis of convolution coded QDPSK, in digital mobile radio

T. Matsumoto, F. Adachi
1991 IEEE Transactions on Vehicular Technology  
Rate 1/2 codes and their symbol punctured high-rate codes are considered, and the optimal symbol positions for deletion to minimize the BER after decoding are presented for the codes with constraint length  ...  The probability density functions of the path and branch metric values of Viterbi decoding are derived.  ...  zk}, of 2 : - with zk being given is given by [SI 1 TABLE I GENERATOR POLYNOMIALS IPOLYNOMIALS Generator Shortest error event K ( O W (information weight) polynomials path length  ... 
doi:10.1109/25.289425 fatcat:p3wr3zqjrjfhbfvbukhee3xbi4

Bounding the Advantage of Multicast Network Coding in General Network Models

Xunrui Yin, Yan Wang, Zongpeng Li, Xin Wang, Jin Zhao, Xiangyang Xue
2014 IEEE Transactions on Communications  
An interesting problem is to understand and quantify the coding advantage and cost advantage, i.e., the potential benefits of network coding, as compared to routing, in terms of increasing throughput and  ...  This work further focuses on two types of parameterized networks, including bidirected networks and hyper-networks, generalizing the directed and the undirected network models, respectively.  ...  Fig. 4 illustrates the ZK α (p = 2, N = 4) network. Theorem 3. The coding advantage in ZK α (p, N ) is of order Ω( √ α).  ... 
doi:10.1109/tcomm.2014.011614.130316 fatcat:azwz5ofnszezjn6qwnix7fdu4q

On the optimal block length for joint channel and network coding

Christian Koller, Martin Haenggi, Jorg Kliewer, Daniel J. Costello
2011 2011 IEEE Information Theory Workshop  
the advantage of employing network coding over many blocks and the optimal number of number of blocks tends to one, making RLNC equivalent to simple ARQ.  ...  Given a message of length K and network coding over a finite Galois field of size q, we obtain the optimal number of blocks for network coding that minimizes the expected number of transmissions.  ...  In [6] the joint design of network coding and MAC protocols was considered. In contrast to the above work, we consider the joint design of channel and network coding.  ... 
doi:10.1109/itw.2011.6089518 dblp:conf/itw/KollerHKC11 fatcat:wxsnsc3w5rgflavr4b2nevreue

Efficient m-ary balanced codes

L.G. Tallini, U. Vaccaro
1999 Discrete Applied Mathematics  
An m-ary balanced code with Y check digits and k information digits is a code over the alphabet Z, = (0, 1, , m -1 } of length n = k+r and cardinality mk such that each codeword is balanced; that is, the  ...  To design such codes, the information words which are close to be balanced are encoded using single maps obtained by a new generalization of Knuth's complementation method to the m-ary alphabet that we  ...  Tables 6 and 7 give the code designs for m = 2, 3, 4, 5, 6, 7, 8, 16, 32, 64, 128 and 256 obtained for some values of s and the values of CI given in Tables 3-5.  ... 
doi:10.1016/s0166-218x(98)00129-2 fatcat:flh2jupmtvhuvjbyfd5uh7cg2i

On benefits of network coding in bidirected networks and hyper-networks

Xunrui Yin, Xin Wang, Jin Zhao, Xiangyang Xue, Zongpeng Li
2012 2012 Proceedings IEEE INFOCOM  
The study of coding advantage in this work further focuses on two types of parameterized networks, including bidirected networks and hyper-networks, which generalizes the directed and the undirected network  ...  An important direction in network coding research is to understand and quantify the coding advantage and cost advantage, i.e., the potential benefits of network coding, as compared to routing, in terms  ...  with network coding over that with routing.  ... 
doi:10.1109/infcom.2012.6195769 dblp:conf/infocom/YinWZXL12 fatcat:xo37sf74drelladcgs3ciweiua

Acceleration Methods [article]

Alexandre d'Aspremont, Damien Scieur, Adrien Taylor
2021 arXiv   pre-print
We first use quadratic optimization problems to introduce two key families of methods, momentum and nested optimization schemes, which coincide in the quadratic case to form the Chebyshev method whose  ...  We discuss momentum methods in detail, starting with the seminal work of Nesterov (1983) and structure convergence proofs using a few master templates, such as that of optimized gradient methods which  ...  Problem constants, such as smoothness and strong convexity parameters, are generally unknown.  ... 
arXiv:2101.09545v2 fatcat:hnbguacpmjgzbdck55hrobcj4q

A Response Surface Modelling Approach for Resonance Driven Reliability Based Optimization of Composite Shells

Sudip Dey, Tanmoy Mukhopadhyay, H. Haddad Khodaparast, Sondipon Adhikari
2016 Periodica polytechnica. Civil engineering  
The present study utilizes genetic algorithm in conjunction to surrogate modelling with D-optimal design for this reliability based optimization problem.  ...  Laminated composite spherical shell is considered in this study to optimize width and thickness of the structure corresponding to different level of reliability of the system to avoid resonance.  ...  It is then encouraged to evolve over generations to produce new better or fitter generations using genetic operators until the problem is satisfactorily solved.  ... 
doi:10.3311/ppci.8073 fatcat:2gya74yae5fepgpvy4ddus434e

Spatio-temporal common pattern: A companion method for ERP analysis in the time domain

Marco Congedo, Louis Korczowski, Arnaud Delorme, Fernando Lopes da silva
2016 Journal of Neuroscience Methods  
Already used at the incept of research on event-related potentials (ERP) over half a century ago, the arithmetic mean is still the benchmark for ERP estimation.  ...  This approach integrates a number of relevant advances in ERP data analysis, such as single-sweep adaptive estimation of amplitude and latency and the use of multivariate regression to account for ERP  ...  Author MC in an investigator of the European project ERC-2012-AdG-320684-CHESS and for this research has been partially supported by it.  ... 
doi:10.1016/j.jneumeth.2016.04.008 pmid:27090947 fatcat:ixgu4qwzljafbfknngfr32oqwa

xJsnark: A Framework for Efficient Verifiable Computation

Ahmed Kosba, Charalampos Papamanthou, Elaine Shi
2018 2018 IEEE Symposium on Security and Privacy (SP)  
Specifically, we present new circuitfriendly algorithms for frequent operations that achieve constant to asymptotic savings over existing ones; various globally aware optimizations for short-and long-integer  ...  arithmetic; as well as circuit minimization techniques that allow us to reduce redundant computation over multiple expressions.  ...  ACKNOWLEDGMENTS The authors thank the anonymous reviewers for their comments and suggestions. This work was supported in part by NSF awards #1514261 and #1652259 and by a NIST award.  ... 
doi:10.1109/sp.2018.00018 dblp:conf/sp/KosbaPS18 fatcat:dbet2sbqb5e7xgfnluzmnuiymi

Anytime Proximity Moving Horizon Estimation: Stability and Regret [article]

Meriem Gharbi, Bahman Gharesifard, Christian Ebenbauer
2021 arXiv   pre-print
We propose a novel iteration scheme which employs a proximity-based formulation of the underlying optimization algorithm and reduces computational effort by performing only a limited number of optimization  ...  A combined result shows that both exponential stability and a sublinear regret which can be rendered smaller by increasing the number of optimization iterations can be guaranteed.  ...  In more details, at each time k, a suitable warm start ẑ0 k is generated from a stabilizing a priori estimate zk and an iterative optimization update is carried out, from which the sequence ẑi k with i  ... 
arXiv:2006.14303v2 fatcat:ne32lwtecvalzitz322gvni36y

Distributed Saddle-Point Problems Under Similarity [article]

Aleksandr Beznosikov, Gesualdo Scutari, Alexander Rogozin, Alexander Gasnikov
2021 arXiv   pre-print
their strong convexity constant, and Δ is the diameter of the network.  ...  We establish lower complexity bounds for a fairly general class of algorithms solving the SPP.  ...  Acknowledgments and Disclosure of Funding  ... 
arXiv:2107.10706v2 fatcat:wq3lsatyzvb3pmjsaomtebvs7a
« Previous Showing results 1 — 15 out of 1,882 results