About permutations on the sets of tuples from elements of the finite field
The following problem was considered: let S = S1× S2×…× Sm be the Cartesian product of subsets Si that are subgroups of the multiplicative group of a finite field Fq of q elements or their extensions by adding a zero element; a map f: S→ S of S into itself can be specified by a system of polynomials...
Saved in:
Main Authors: | V.S. Kugurakov, A.F. Gainutdinova, V.T. Dubrovin |
---|---|
Format: | Article |
Language: | English |
Published: |
Kazan Federal University
2019-06-01
|
Series: | Учёные записки Казанского университета: Серия Физико-математические науки |
Subjects: | |
Online Access: | https://kpfu.ru/uz-eng-phm-2019-2-9.html |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Permutation binomials
by: Charles Small
Published: (1990-01-01) -
A method for shorting of the system Polar code based on bit-reverse permutation
by: Shunlan LIU, et al.
Published: (2019-10-01) -
Probability problems on random permutation
by: ZHANG Zhi-qiang, et al.
Published: (2006-01-01) -
Survey of digital signature technology based on error correcting codes
by: Fang REN, et al.
Published: (2016-11-01) -
Permutations from APN power functions over <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"> <msub> <mi>F</mi> <mrow> <msup> <mn>2</mn> <mrow> <mn>2</mn><mi>n</mi></mrow> </msup> </mrow> </msub> </math></inline-formula>
by: Shi-zhu TIAN
Published: (2017-10-01)