Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Van-Trung Tran"'
Publikováno v:
Política e Gestão Educacional, Vol 26, Iss 00 (2022)
Action research becomes an appropriate and effective professional development method and strategy to promote inquiry knowledge and solve the problem that leads to action or change. Teachers participating in action research could gain a better insight
Externí odkaz:
https://doaj.org/article/3d7bde77994e4f34ace2c8b98e5bffcd
Autor:
Hien Thi Nguyen1 hiennt@tdmu.edu.vn, Van-Trung Tran2 trungtv@tdmu.edu.vn
Publikováno v:
GeSec: Revista de Gestao e Secretariado. 2023, Vol. 14 Issue 11, p19392-19413. 22p.
Autor:
van Trung, Tran
This work presents a recursive construction for simple $t$-designs using resolutions of the ingredient designs. The result extends a construction of $t$-designs in our recent paper [39]. Essentially, the method in [39] describes the blocks of a const
Externí odkaz:
http://arxiv.org/abs/1612.01978
Autor:
van Trung, Tran
The aim of this paper is to present a recursive construction of simple t-designs for arbitrary t. The construction is of purely combinatorial nature and it requires finding solutions for the indices of the ingredient designs that satisfy a certain se
Externí odkaz:
http://arxiv.org/abs/1602.06751
In this paper, we study $w$-frameproof codes, which are equivalent to $\{1,w\}$-separating hash families. Our main results concern binary codes, which are defined over an alphabet of two symbols. For all $w \geq 3$, and for $w+1 \leq N \leq 3w$, we s
Externí odkaz:
http://arxiv.org/abs/1406.6920
In 1963, Shrikhande and Raghavarao published a recursive construction for designs that starts with a resolvable design (the "master design") and then uses a second design (the "indexing design") to take certain unions of blocks in each parallel class
Externí odkaz:
http://arxiv.org/abs/1310.0992
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:
van Trung Tran
Publikováno v:
Journal of Mathematical Cryptology, Vol 12, Iss 1, Pp 23-35 (2018)
The aim of the paper is to present a general construction of strongly aperiodic logarithmic signatures (SALS) for elementary abelian p-groups. Their existence significantly extends the classes of tame logarithmic signatures which are used for the cry
Externí odkaz:
https://doaj.org/article/6a8d17f864a14e1f8956192d1bcae8eb
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:
van Trung, Tran
Publikováno v:
Designs, Codes and Cryptography. 90:1567-1583
The paper introduces a method for constructing 2-resolvable t-designs for $$t=3,4$$ t = 3 , 4 . The main idea is based on the assumption that there exists a partition of a t-design into Steiner 2-designs. A remarkable property of the method is that i