Gyarmati, Katalin (2014) On the complexity of a family based on irreducible polynomials. Finite Fields and Their Applications. (Submitted)
|
Text
firreduc2.pdf Download (156kB) | Preview |
Abstract
Ahlswede, Khachatrian, Mauduit and Sárközyy introduced the f-complexity measure ("f" for family) in order to study pseudorandom properties of large families of binary sequences. So far several families have been studied by this measure. In the present paper I considerably improve on my earlier result in [7], where the f-complexity measure of a family based on the Legendre symbol and polynomials over Fp is studied. This paper also extends the earlier results to a family restricted on irreducible polynomials.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA71 Number theory / számelmélet |
| Depositing User: | Katalin Gyarmati |
| Date Deposited: | 20 Sep 2014 14:03 |
| Last Modified: | 20 Sep 2014 14:03 |
| URI: | http://real.mtak.hu/id/eprint/15635 |
Actions (login required)
 |
Edit Item |
