- Full text PDF available (29)
- This year (0)
- Last 5 years (13)
- Last 10 years (34)
Journals and Conferences
Many research groups have described genetic networks as networks of Boolean variables. We will show that these Boolean network models are examples of Finite Dy-namical Systems (FDS), and we will generalize Boolean networks to finite fields, which we call finite field genetic network models. We also show two different methods to construct these FDS models… (More)
Optical orthogonal codes (OOC) are used as spreading sequences for optical CDMA networks. An OOC is a family of constant weight binary codes with a pre-specified maximum correlation parameter (MCP). Johnson in his 1962 paper introduced three bounds for constant weight codes, that we call bounds A, B, and hybrid. Subsequently Chung et al. adapted Johnson… (More)
For any 4-regular graph G (possibly with multiple edges), we prove that, if the number N of distinct Euler orientations of G is such that N ≡ 1 (mod 3), then G has a 3-regular subgraph. It gives the new 4-regular graphs with multiple edges which have no 3-regular subgraphs, for which we know the number of Euler orientations.