Algorithmic criteria for permutation orthogonal systems over finite fields.

DOI10.1007/BF02883675MaRDI QIDQ5955919zbMATH OpenOpenAlexFDO

Authors Peizhong Lu

Publication date 18 February 2002

Published in Chinese Science Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02883675

zbMATH Keywords

permutation polynomialspolynomial maps between two algebraic varieties

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Polynomials and finite commutative rings (13M10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Recommendations

• scientific article; zbMATH DE number 6263421
• Subfield permutation polynomials and orthogonal subfield systems in finite fields
• scientific article; zbMATH DE number 1091031
• Judging of the orthogonal system over rings \(\mathbb{Z}_ N\)
• Enumeration of generalized linear orthomorphism in the vector space F q n

This page was built for publication: Algorithmic criteria for permutation orthogonal systems over finite fields.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955919)