Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Wu, Gaofei"'
Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $\alpha $ be a generator of $\mathbb{F}_{3^m}^
Externí odkaz:
http://arxiv.org/abs/2407.07332
The widespread adoption of third-party libraries (TPLs) in software development has accelerated the creation of modern software. However, this convenience comes with potential legal risks. Developers may inadvertently violate the licenses of TPLs, le
Externí odkaz:
http://arxiv.org/abs/2401.10636
Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $p\ge 5$ be an odd prime and $m$ be a positive
Externí odkaz:
http://arxiv.org/abs/2208.14404
Publikováno v:
In Finite Fields and Their Applications December 2023 92
Golay complementary sequences have been put a high value on the applications in orthogonal frequency-division multiplexing (OFDM) systems since its good peak-to-mean envelope power ratio(PMEPR) properties. However, with the increase of the code lengt
Externí odkaz:
http://arxiv.org/abs/1910.10302
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Wu, Gaofei, Li, Nian
The construction of permutation trinomials over finite fields attracts people's interest recently due to their simple form and some additional properties. Motivated by some results on the construction of permutation trinomials with Niho exponents, by
Externí odkaz:
http://arxiv.org/abs/1702.06446
Negabent functions as a class of generalized bent functions have attracted a lot of attention recently due to their applications in cryptography and coding theory. In this paper, we consider the constructions of negabent functions over finite fields.
Externí odkaz:
http://arxiv.org/abs/1606.08952
In this paper, by using a powerful criterion for permutation polynomials given by Zieve, we give several classes of complete permutation monomials over $\F_{q^r}$. In addition, we present a class of complete permutation multinomials, which is a gener
Externí odkaz:
http://arxiv.org/abs/1312.4716