• Publications
  • Influence
Euclidean and Hermitian self-dual MDS codes over large finite fields
  • J. Kim, Y. Lee
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. A
  • 2004
TLDR
We construct many Euclidean and Hermitian self-dual MDS (or near MDS) codes of length up to 12 over finite fields GF(q), where q = 8, 9, 16, 25, 32, 41, 49, 53, 64, 81, and 128. Expand
  • 70
  • 9
Families of elliptic curves over quartic number fields with prescribed torsion subgroups
TLDR
In this paper we construct infinite families of elliptic curves with given torsion group structures over cubic number fields. Expand
  • 29
  • 5
  • PDF
New MDS or Near-MDS Self-Dual Codes
TLDR
We construct new MDS or near-MDS self-dual codes over large finite fields using a Reed-Solomon code and its extension. Expand
  • 46
  • 4
  • PDF
Construction of MDS self-dual codes over Galois rings
  • J. Kim, Y. Lee
  • Mathematics, Computer Science
  • Des. Codes Cryptogr.
  • 1 November 2007
TLDR
We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-analogue of (Kim and Lee, J Combin Theory A, 105:79–95). Expand
  • 24
  • 3
  • PDF
MacWilliams duality and a Gleason-type theorem on self-dual bent functions
TLDR
We prove that the MacWilliams duality holds for bent functions. Expand
  • 11
  • 3
CONSTRUCTION OF SELF-DUAL CODES OVER F2 + uF2
Abstract. We present two kinds of construction methods for self-dualcodes over F 2 + u F 2 . Specially, the second construction (respectively,the rst one) preserves the types of codes, that is, theExpand
  • 16
  • 2
  • PDF
An Evaluation of Microbial and Chemical Contamination Sources Related to the Deterioration of Tap Water Quality in the Household Water Supply System
  • Y. Lee
  • Environmental Science, Medicine
  • International journal of environmental research…
  • 1 September 2013
The predominant microorganisms in samples taken from shower heads in residences in the Korean city “N” were Stenotrophomonas maltophilia, Sphingomonas paucimobilis, Acidovorax temperans, andExpand
  • 24
  • 2
  • PDF
Self-dual codes using the building-up construction
  • J. Kim, Y. Lee
  • Mathematics, Computer Science
  • IEEE International Symposium on Information…
  • 28 June 2009
TLDR
We complete the building-up construction for self-dual codes over GF(q) with q ≡ 3 (mod 4) with trivial automorphism groups. Expand
  • 2
  • 2
Construction of self-dual codes over finite rings Zpm
TLDR
We present an efficient method for constructing self-dual or self-orthogonal codes over finite rings Z"p"^"m (or Z"m) with p an odd prime and m a positive integer. Expand
  • 15
  • 1
An Efficient Construction of Self-Dual Codes
  • Y. Lee, J. Kim
  • Mathematics, Computer Science
  • ArXiv
  • 27 January 2012
TLDR
We complete the building-up construction for self-dual codes by resolving the open cases over $GF(q)$ with an odd prime $p$ satisfying $p \equiv 3 \pmod 4$ with $r$ odd. Expand
  • 13
  • 1
  • PDF