Zobrazeno 1 - 10
of 270
pro vyhledávání: '"Lee, Nari"'
Autor:
Kang, Sohi1,2 (AUTHOR) anakang@gnu.ac.kr, Lee, Nari3 (AUTHOR) nr4163@jikom.or.kr, Jung, Bokyung1 (AUTHOR) bkjung@jnu.ac.kr, Jeong, Huiyeong1 (AUTHOR) hyyy0e@jnu.ac.kr, Moon, Changjong1 (AUTHOR) moonc@jnu.ac.kr, Park, Sang-Ik1 (AUTHOR) sipark@jnu.ac.kr, Yun, Seungpil4 (AUTHOR) spyun@gnu.ac.kr, Yim, Teresa5 (AUTHOR) 96trs@hanmail.net, Oh, Jung Min3 (AUTHOR) ojm4554@jikom.or.kr, Kim, Jae-Won3 (AUTHOR) kjw8839@jikom.or.kr, Song, Ji Hoon3,6 (AUTHOR) jhsong@vtl.co.kr, Chae, Sungwook7,8 (AUTHOR) sunguk.chae@kitox.re.kr, Kim, Joong Sun1 (AUTHOR) sunguk.chae@kitox.re.kr
Publikováno v:
Pharmaceuticals (14248247). Sep2024, Vol. 17 Issue 9, p1173. 13p.
Publikováno v:
In LWT 1 November 2024 211
Autor:
Jung, Young Sung, Kim, Hyoung-Geun, Cho, Chi Heung, Lee, Sang-Hoon, Lee, Nari, Yang, Jaekyung, Nam, Tae Gyu, Yoo, Miyoung
Publikováno v:
In Carbohydrate Research June 2024 540
Publikováno v:
In Heliyon 15 April 2024 10(7)
We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouyukliev et al. (2006). As an application, we give an algorithmic method
Externí odkaz:
http://arxiv.org/abs/2002.01643
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.
In this paper, we suggest a code-based public key encryption scheme, called McNie. McNie is a hybrid version of the McEliece and Niederreiter cryptosystems and its security is reduced to the hard problem of syndrome decoding. The public key involves
Externí odkaz:
http://arxiv.org/abs/1812.05008
Autor:
Kim, Jon-Lark, Lee, Nari
A secret sharing scheme (SSS) was introduced by Shamir in 1979 using polynomial interpolation. Later it turned out that it is equivalent to an SSS based on a Reed-Solomon code. SSSs based on linear codes have been studied by many researchers. However
Externí odkaz:
http://arxiv.org/abs/1701.04183
Autor:
Kim, Jon-Lark, Lee, Nari
As far as we know, there is no decoding algorithm of any binary self-dual $[40, 20, 8]$ code except for the syndrome decoding applied to the code directly. This syndrome decoding for a binary self-dual $[40,20,8]$ code is not efficient in the sense t
Externí odkaz:
http://arxiv.org/abs/1701.04180
A linear code with a complementary dual (or LCD code) is defined to be a linear code $C$ whose dual code $C^{\perp}$ satisfies $C \cap C^{\perp}$= $\left\{ \mathbf{0}\right\} $. Let $LCD{[}n,k{]}$ denote the maximum of possible values of $d$ among $[
Externí odkaz:
http://arxiv.org/abs/1701.04165