Permutations preserving divisibility

We give a proof of a theorem on the common divisibility of polynomials and permuted polynomials (over GF(2)) by a polynomial g(x).

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2001-03, Vol.47 (3), p.1206-1207
Main Authors: McEliece, R.J., Le Dantec, C., Piret, P.M.
Format: Article
Language:English
Subjects:
Cryptography
Geometry
Information theory
Permutations
Polynomials
Preserving
Proving
Theorems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We give a proof of a theorem on the common divisibility of polynomials and permuted polynomials (over GF(2)) by a polynomial g(x).
ISSN:0018-9448
1557-9654
DOI:10.1109/18.915685