#### Filter Results:

#### Publication Year

1983

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- PAUL CAMION
- 2010

In this paper A will always denote a matrix with entries equal to 1, — 1 or 0. A is totally unimodular if every square submatrix has a determinant equal to 1, —1 or 0. A submatrix A] of A is said to be Eulerian [l] if (V/í) : Y, A)-0 mod 2 and (V-tf) : Y,a) = 0 mod 2. »67 We published in [2] and also in [6] a proof of: Theorem 1. A is totally unimodular if… (More)

We extend the notions of correlation-immune functions and resilient functions to functions over any nite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Stinson as we give an orthogonal array characterization and a Fourier transform characterization for resilient functions over any nite alphabet.… (More)

We extend the notions of correlation-immune functions and resilient functions to functions over any finite alphabet. A previous result due to Gopalakrishnan and Stinson is generalized as we give an orthogonal array characterization, a Fourier transform and a matrix characterization for correlation-immune and resilient functions over any finite alphabet… (More)

- Daniel Augot, Paul Camion
- 1997

Various algorithms connected with the computation of the minimal polynomial of a square n n matrix over a eld K are presented here. The complexity of the rst algorithm, where the complete factorization of the characteristic polynomial is needed, is O(p nn 3). It produces the minimal polynomial and all characteristic subspaces of a matrix of size n.… (More)