Research
Preprints:
C. Monico, M. Elia.
An additive characterization of Fibers of characters on F_p^*, submitted.
A. Farooqi, R. Gale, S. Reddy, B. Nutter, C. Monico.
Markov source based test length optimized SCAN-BIST architecture, submitted.
Papers:
C.Monico, M. Peterson.
F_2 Lanczos revisited.
Linear Algebra and Its Applications, 428:4 (2008), 1135--1150.
M. Elia, C. Monico.
On the representation of primes in Q(\sqrt{2}) as sums of squares.
JP Journal of Algebra, Number
Theory and Applications, vol.8 (2007), 121--133.
G. Maze, C. Monico, J. Rosenthal.
Public key cryptography based on semigroup actions.
Advances in Mathematics of Communications, vol. 1 (2007), 489--507.
C.Monico, M. Elia.
A note on an additive characterization of quadratic residues.
Journal of Combinatorics, Information & System Sciences,
vol. 31 (2006), 209--215.
B. Miller, C. Monico.
A construction of arithmetic progression-free
sequences and its analysis. Sonoran Journal of Graduate Mathematics,
Issue 1, Spring 2005.
C. Monico. On finite congruence-simple semirings.
J. of Algebra vol. 271 (2004), 846--854.
(Preprint at:
http://front.math.ucdavis.edu/math.RA/0205083)
E. Byrne, C. Kelley, C. Monico, and Rosenthal J.
Non-linear codes for belief propagation.
In Proceedings of the 2003 IEEE International Symposium on Information Theory
C. Monico. Computing the primary decomposition of zero-dimensional
ideals. J. of Symbolic Computation, vol. 34 (2002) 451--459.
(The algorithm from this paper has been
implemented in the ``primdec.lib'' library of the computer algebra
package Singular.)
G. Maze, C. Monico, J. Climent and J. Rosenthal.
Public-key cryptography
based on simple modules over simple rings.
Proceedings of MTNS 2002.
G. Maze, C. Monico, J. Rosenthal. A public-key cryptosystem
based on actions by semigroups. In Proceedings of the 2002 IEEE
International Symposium on Information Theory, page 266, Lausanne, Switzerland, 2002.
C. Monico, J. Rosenthal and A. Shokrollahi. Using low density parity check
codes in the McEliece cryptosystem.
Proceedings 2000 IEEE International Symposium on Information
Theory.
Students directed:
Aftab Farooqi, Ph.D. EE, ``Markov source based test length optimized SCAN-BIST architecture.'' 2008.
Steven Lawless, M.S., ``Super-resolution by local function approximation.'' 2007.
Anton Badev, M.S. 2007.
Michael Peterson, M.S., ``Parallel block Lanczos for solving large binary systems.'' 2006.
Memet Bulut, M.S. 2006.
Brian Miller, M.S., ``A construction of arithmetic progression-free sequences.'' 2004.
|