3 citations · 4 across the 8 of their papers we have counts for
9 papers
Swan-like reducibility for Type I pentanomials over a binary field
Ryul Kim, Su-Yong Pak, Myong-Son Sin
Swan (Pacific J. Math. 12(3) (1962), 1099-1106) characterized the parity of the number of irreducible factors of trinomials over . Many researchers have recently obtained Swan…
On the Divisibility of Trinomials by Maximum Weight Polynomials over F2
Ryul Kim, Ok-Hyon Song, Myong-Hui Ri
Divisibility of trinomials by given polynomials over finite fields has been studied and used to construct orthogonal arrays in recent literature. Dewar et al.\ (Des.\ Codes Cryptog…
Some New Results on Equivalency of Collusion-Secure Properties for Reed-Solomon Codes
Myong-Son Sin, Ryul Kim
A. Silverberg (IEEE Trans. Inform. Theory 49, 2003) proposed a question on the equivalence of identifiable parent property and traceability property for Reed-Solomon code family. E…
Divisibility of Trinomials by Irreducible Polynomials over F2
Ryul Kim, Wolfram Koepf
Irreducible trinomials of given degree n over do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials wi…
On the number of permutation polynomials over a finite field
Kwang-Yon Kim, Ryul Kim
We find a formula for the number of permutation polynomials of degree q-2 over a finite field Fq, which has q elements, in terms of the permanent of a matrix. We write down an expr…
Separation Properties and Related Bounds of Collusion-secure Fingerprinting Codes
Myong-Son Sihn, Ryul Kim
In this paper we investigate the separation properties and related bounds of some codes. We tried to obtain a new existence result for -separating codes and discuss the…