#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1983

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Paul Camion, Claude Carlet, Pascale Charpin, Nicolas Sendrier
- CRYPTO
- 1991

- Paul Camion, Jacques Patarin
- EUROCRYPT
- 1991

- Paul Camion, Bernard Courteau, Philippe Delsarte
- Applicable Algebra in Engineering, Communication…
- 1991

The concept of the combinatorial matrix of an unrestricted code and the notion of anr-partition design admitted by a code are introduced and discussed in detail. The theory includes a characterization of completely regular codes, and a combinatorial interpretation of the fact that the distinct rows of the distance distribution matrix of a code are linearly… (More)

- Paul Camion
- IEEE Trans. Information Theory
- 1983

- DANIEL AUGOT, PAUL CAMION
- 1997

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

- Philippe Godlewski, Paul Camion
- EUROCRYPT
- 1988

- Paul Camion
- AAECC
- 1984

- Paul Camion, Anne Canteaut
- Des. Codes Cryptography
- 1999

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)

- Paul Camion, Anne Canteaut
- EUROCRYPT
- 1996

Wr rxttnd the notions of correlation-immune functions and resilient functions to functions over any finite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Slinsori as wc givc an orthogonal array characterizat,ion and a Fourier transform characterization for resilient functions over any finite… (More)

- Paul Camion, Miodrag J. Mihaljevic, Hideki Imai
- Selected Areas in Cryptography
- 2002