Published March 2001
| Published
Journal Article
Open
Permutations preserving divisibility
Abstract
We give a proof of a theorem on the common divisibility of polynomials and permuted polynomials (over GF(2)) by a polynomial g(x).
Additional Information
© 2001 IEEE. Reprinted with permission. Manuscript received July 31, 2000; revised September 1, 2000. McEliece's contribution to this correspondence was performed at the Sony Corporation in Tokyo, Japan, while he was a holder of a Sony Sabbatical Chair. Thanks are due to the referees for their useful comments, and the suggestion to include Corollary 6 in the correspondence.Attached Files
Published - MCEieeetit01.pdf
Files
MCEieeetit01.pdf
Files
(81.0 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:14f631c6583d4f78a5714452aacf3be1
|
81.0 kB | Preview Download |
Additional details
- Eprint ID
- 1284
- Resolver ID
- CaltechAUTHORS:MCEieeetit01
- Created
-
2006-01-08Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field