Institute for Mathematical Sciences                                                         Publications

 

IMS Preprint Series - 2002

2002-01

Normal Approximation under Local Dependence
Louis H.Y. Chen, Qi-Man Shao

2002-02

Nonrandom Clusters of Palindromes in Herpesvirus Genomes
Ming-Ying Leung, Kwok Pui Choi, Aihua Xia, Louis H.Y. Chen

2002-03

Stein’s Method, Palm Theory and Poisson Process Approximation
Louis H.Y. Chen, Aihua Xia

2002-04

Algebraic Function Fields over Finite Fields
Harald Niederreiter

2002-05

Periodic Sequences with Large k-error Linear Complexity
Harald Niederreiter

2002-06

Constructions of Digital Nets
Harald Niederreiter, Chaoping Xing

2002-07

Asymptotic Normality of Scaling Functions
Louis H.Y. Chen, T.N.T. Goodman, S.L. Lee

2002-08

A Class of Good Codes and Their Duals
San Ling, Ferruh Özbudak, Chaoping Xing

2002-09

Computational Methods in Public Key Cryptology
Arjen K. Lenstra

2002-10

Sensitivity Analysis and Efficient Method for Identifying Optimal Spaced Seeds
Kwok Pui Choi, Louxin Zhang

2002-11

Regression-Based QTL Mapping in the 21st Century
Eleanor Feingold

2002-12

Optimality, Variability, Power: A Template for Evaluating Response-Adaptive Randomization Procedures
Feifang Hu, William F. Rosenberger

2002-13

Extremal Problems of Coding Theory
Alexander Barg

2002-14

Quadratic Iterations to p Associated with Elliptic Functions to the Cubic and Septic Base
Heng Huat Chan, Kok Seng Chua, Patrick Solé

2002-15

Exact Arbitrage, Well-Diversified Portfolios and Asset Pricing in Large Markets
M. Ali Khan, Yeneng Sun

2002-16

Monte Carlo Simulation of Macroeconomic Risk with a Continuum of Agents: The Symmetric Case
Peter J. Hammond, Yeneng Sun

2002-17

Quantum Error-Correcting Codes
Keqin Feng

2002-18

On Kummer Covers with Many Rational Points over Finite Fields
Arnaldo Garcia, Alvaro Garzon

2002-19

Zpk+1-Linear Codes
San Ling, Thomas Blackford

2002-20

Smooth Models Associated to Concave Functions in Bruhat-Tits Theory
Jiu-Kang Yu
Abstract: PDF      Preprint: PDF

2002-21

7-Modular Lattices and Septic Base Jacobi Identity
Heng Huat Chan, Kok Seng Chua, Patrick Solé

2002-22

Computing Zeta Functions of Artin-Schreier Curves over Finite Fields
Alan G.B. Lauder, Daqing Wan

2002-23

Uniform and Non-uniform Bounds in Normal Approximation for Nonlinear Statistics
Louis H.Y. Chen, Qi-Man Shao
Abstract: PDF      Preprint: PDF

2002-24

A Novel Packet-Loss Resilient Coding Scheme with Only XOR Operations
Gui-Liang Feng, Robert H. Deng, Feng Bao

2002-25

A Metric on Probabilities, and Products of Loeb Spaces
H. Jerome Keisler, Yeneng Sun

2002-26

An Entropy-Based Uncertainty Principle for a Locally Compact Abelian Group
Murad Özaydin, Tomasz Przebinda

2002-27

Dual Pairs and Kostant-Sekiguchi Correspondence. II. Classification of Nilpotent Elements
Andrzej Daszkiewicz, Witold Kraśkiewicz, Tomasz Przebinda

2002-28

The Donoho-Stark Uncertainty Principle for a Finite Abelian Group
Ewa Matusiak, Murad Özaydin, Tomasz Przebinda

2002-29

Three Uncertainty Principles for an Abelian Locally Compact Group
Tomasz Przebinda

2002-30

Non-Cooperative Games with Many Players
M. Ali Khan, Yeneng Sun

2002-31

Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
Markus Maurer, Alfred Menezes, Edlyn Teske

2002-32

Asymptotic Bounds on Frameproof Codes
Chaoping Xing

2002-33

Authentication Schemes
Dingyi Pei

2002-34

Type II Codes over F2m + uF2m
Koichi Betsumiya, San Ling, Fidel R. Nemenzo

2002-35

Dynamic-Programming Strategies for Analyzing Biomolecular Sequences
Kun-Mao Chao

2002-36

Greedy Method for Inferring Tandem Duplication History
Louzin Zhang, Bin Ma, Lusheng Wang, Ying Xu

2002-37

A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition
Guohui Lin, Tao Jiang

2002-38

Point Matching Under Non-Uniform Distortion and Protein Side Chain Packing Based on Efficient Maximum Clique Algorithms
Dukka Bahadur K.C., Tatsuya Akutsu, Tomakazu Seki, Etsuji Tomita, Asao Fujiyama

2002-39

Sample Size for Response-Adaptive Randomization Procedures
Feifang Hu
Abstract: PDF      Preprint: PDF

2002-40

When can the Haseman-Elston Procedure for Quantitative Trait Loci be Improved? Insights from Optimal Design Theory
Zhaohai Li, Minyu Xie, Joseph L. Gastwirth

2002-41

On the Average Distribution of Inversive Pseudorandom Numbers
Harald Niederreiter, Igor Shparlinski

2002-42

On the Linear and Nonlinear Complexity Profile of Nonlinear Pseudorandom Numbers Generators
Jaime Gutierrez, Igor Shparlinski, Arne Winterhof

2002-43

On the Linear Complexity Profile of Explicit Nonlinear Pseudorandom Numbers
Wilfried Miedl, Arne Winterhof

2002-44

Optimized Baby Step-Giant Step Methods and Applications to Hyperelliptic Function Fields
Andreas Stein, Edlyn Teske

2002-45

Practical Construction for Multicast Re-Keying Schemes Using Reed-Solomon Codes
Chun-yan Bai, Roberta Houston, Gui-Liang Feng

2002-46

Public-Key Infrastructures
Dieter Gollmann

2002-47

Selective Forgery of RSA Signatures with Fixed-Pattern Padding
Arjen K. Lenstra, Igor E. Shparlinski

2002-48

The Expected Value of the Joint Linear Complexity of Periodic Multisequences
Wilfried Meidl, Harald Niederreiter

2002-49

The Minimum Distance of the Duals of Binary Irreducible Cyclic Codes
Cunsheng Ding, Tor Helleseth, Harald Niederreiter, Chaoping Xing

2002-50

Fast Algorithms for Determining the Linear Complexity of Period Sequences
Guozhen Xiao, Shimin Wei

2002-51

Constructions of Digital Nets Using Global Function Fields
Harald Niederreiter, Ferruh Özbudak

2002-52

CTRU, a Coding Analogue of NTRU
Patrick Solé
Abstract: PDF      Preprint: PDF

2002-53

Exponential Sums in Coding Theory and Cryptology
Igor E. Shparlinski

2002-54

Introduction to Algebraic Geometry Codes
Chaoping Xing

2002-55

Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
Harald Neiderreiter, Arne Winterhof

2002-56

Some Recent Advances on Response-Adaptive Randomized Designs
Feifang Hu

 

top
Best viewed with IE 7 and above