Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Rola Hijazi"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no. 1, Iss Graph Theory (2015)
Graph Theory
Externí odkaz:
https://doaj.org/article/aff3f38c797c4330b49bc48bf79033d2
Publikováno v:
European Journal of Pure and Applied Mathematics. 14:1002-1014
Let G be a finite group. A subgroup H of G is called SS-quasinormal in G if there is a supplement B of H to G such that H permutes with every Sylow subgroup of B. A subgroup H of G is called CSS-subgroup in G if there exists a normal subgroup K of G
Autor:
Fatme M. Charaf, Rola Hijazi
Publikováno v:
European Journal of Pure and Applied Mathematics. 12:571-576
Let G be a finite group. A subgroup H of G is said to be S-permutable in G if itpermutes with all Sylow subgroups of G. In this note we prove that if P, the Sylowp-subgroup of G (p > 2), has a subgroup D such that 1
Publikováno v:
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, Springer, In press, ⟨10.1007/s12095-021-00499-7⟩
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, In press, ⟨10.1007/s12095-021-00499-7⟩
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, Springer, In press, ⟨10.1007/s12095-021-00499-7⟩
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, In press, ⟨10.1007/s12095-021-00499-7⟩
International audience; We present two new constructions of entanglement-assisted quantum error-correcting codes using some fundamental properties of (classical) linear codes in an effective way. The main ideas include linear complementary dual codes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4508ff2c681007928f5514d865d0e7e1
https://hal.archives-ouvertes.fr/hal-03339152
https://hal.archives-ouvertes.fr/hal-03339152
Publikováno v:
Cryptography and Communications. 14:39-39
Publikováno v:
Communications in Algebra. 46:1110-1115
Let ℨ be a complete set of Sylow subgroups of a finite group G, that is, a set composed of a Sylow p-subgroup of G for each p dividing the order of G. A subgroup H of G is called ℨ-S-semipermutable if H permutes with every Sylow p-subgroup of G i
Autor:
Shakir Ali, Hussain Alhazmi, Tor Helleseth, Rola Hijazi, Patrick Solé, Adel Alahmadi, Chunlei Li
Publikováno v:
Journal of Systems Science and Complexity. 30:950-966
This paper constructs a cyclic ℤ4-code with a parity-check matrix similar to that of Goethals code but in length 2m + 1, for all m ≥ 4. This code is a subcode of the lifted Zetterberg code for m even. Its minimum Lee weight is shown to be at leas
Publikováno v:
Publicationes Mathematicae Debrecen. 88:345-355
Publikováno v:
Discrete Mathematics. 339:344-353
Cyclic isodual codes over F q are constructed in length ? 2 ( mod 4 ) , for odd q , and in length ? 4 ( mod 8 ) , for q ? 1 ( mod 4 ) . Their minimum distance is computed in short lengths.
Publikováno v:
Designs, Codes and Cryptography. 80:561-576
The even-weight subcode of a binary Zetterberg code is a cyclic code with generator polynomial $$g(x)=(x+1)p(x)$$g(x)=(x+1)p(x), where p(x) is the minimum polynomial over GF(2) of an element of order $$2^m+1$$2m+1 in $$GF(2^{2m})$$GF(22m) and m is ev