World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
36
Citations
6286
World Ranking
11163
National Ranking
134

Research.com Recognitions

  • 2012 - IEEE Fellow For contributions to sequences and cyclic difference sets for communications algorithms

Overview

Jong-Seon No is affiliated with Seoul National University in South Korea and focuses on research within the domain of computer science. Their scholarly work spans a range of interrelated subfields and topics, grounded predominantly in artificial intelligence, computer networks and communications, and electrical and electronic engineering.

The scientist's research prominently covers areas such as:

  • Cryptography and Data Security
  • Error Correcting Code Techniques
  • Advanced Wireless Communication Techniques
  • Coding Theory and Cryptography
  • Cooperative Communication and Network Coding
  • DNA and Biological Computing
  • Cryptography and Residue Arithmetic

Jong-Seon No has a significant body of published work, contributing to scholarly discourse in these fields through various venues. Frequent publication venues include:

  • IEEE Access
  • arXiv (Cornell University)
  • IEEE Communications Letters
  • The Journal of Korean Institute of Communications and Information Sciences
  • Bioinformatics

Examples of recent papers by Jong-Seon No illustrate the scientist's engagement with emerging topics involving homomorphic encryption, DNA storage, and performance optimization in communication systems:

  • Privacy-Preserving Machine Learning With Fully Homomorphic Encryption for Deep Neural Network, 2022, IEEE Access
  • Cooperative Sequence Clustering and Decoding for DNA Storage System with Fountain Codes, 2021, Bioinformatics
  • Precise Approximation of Convolutional Neural Networks for Homomorphically Encrypted Data, 2023, IEEE Access
  • Optimization of Homomorphic Comparison Algorithm on RNS-CKKS Scheme, 2022, IEEE Access
  • Iterative Coding Scheme Satisfying GC Balance and Run-Length Constraints for DNA Storage with Robustness to Error Propagation, 2022, Journal of Communications and Networks

The scientist frequently collaborates with peers, with prominent coauthors including:

  • Young Sik Kim
  • Hee-Youl Kwak
  • Joon-Woo Lee
  • Yongjune Kim
  • Jae-Won Kim

Jong-Seon No's work has been recognized within the professional community, exemplified by the award of IEEE Fellow in 2012 for contributions to sequences and cyclic difference sets for communications algorithms.

Best Publications

  • A Modified SLM Scheme With Low Complexity for PAPR Reduction of OFDM Systems

    Seok-Joong Heo;Hyung-Suk Noh;Jong-Seon No;Dong-Joon Shin

  • Privacy-Preserving Machine Learning with Fully Homomorphic Encryption for Deep Neural Network.

    Joon-Woo Lee;HyungChul Kang;Yongwoo Lee;Woosuk Choi

  • A new SLM OFDM scheme with low complexity for PAPR reduction

    Dae-Woon Lim;Jong-Seon No;Chi-Woo Lim;Habong Chung

  • A new PTS OFDM scheme with low complexity for PAPR reduction

    Dae-Woon Lim;Seok-Joong Heo;Jong-Seon No;Habong Chung

  • The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem

    Gerhard Wunder;Robert F. H. Fischer;Holger Boche;Simon Litsyn

  • A new family of binary pseudorandom sequences having optimal periodic correlation properties and larger linear span

    J.-S. No;P.V. Kumar

  • An overview of peak-to-average power ratio reduction schemes for OFDM signals

    Dae-Woon Lim;Seok-Joong Heo;Jong-Seon No

  • Binary pseudorandom sequences of period 2/sup n/-1 with ideal autocorrelation

    Jong-Seon No;S.W. Golomb;Guang Gong;Hwan-Keun Lee

  • A Low-Complexity SLM Scheme Using Additive Mapping Sequences for PAPR Reduction of OFDM Signals

    Hyun-Bae Jeon;Jong-Seon No;Dong-Joon Shin

  • Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$

    Sunghwan Kim;Jong-Seon No;Habong Chung;Dong-Joon Shin

  • Trace representation of Legendre sequences of Mersenne prime period

    Jong-Seon No;Hwan-Keun Lee;Habong Chung;Hong-Yeop Song

  • Binary pseudorandom sequences of period 2/sup m/-1 with ideal autocorrelation generated by the polynomial z/sup d/+(z+1)/sup d/

    Jong-Seon No;Habong Chung;Min-Seon Yun

  • High-Precision Bootstrapping of RNS-CKKS Homomorphic Encryption Using Optimal Minimax Polynomial Approximation and Inverse Sine Function.

    Joon-Woo Lee;Eunsang Lee;Yongwoo Lee;Young-Sik Kim

  • On the phase sequence set of SLM OFDM scheme for a crest factor reduction

    Dae-Woon Lim;Seok-Joong Heo;Jong-Seon No;Habong Chung

  • New families of binary sequences with low correlation

    Sang-Hyo Kim;Jong-Seon No

  • New constructions of quaternary low correlation zone sequences

    Sang-Hyo Kim;J.-W. Jang;Jong-Seon No;Habong Chung

  • New PTS Schemes for PAPR Reduction of OFDM Signals Without Side Information

    Hyun-Seung Joo;Kee-Hoon Kim;Jong-Seon No;Dong-Joon Shin

  • Generalization of GMW sequences and No sequences

    Jong-Seon No

  • New Sets of Optimal $p$ -ary Low-Correlation Zone Sequences

    J.-W. Jang;Jong-Seon No;Habong Chung;Xiaohu Tang

  • A New Blind SLM Scheme With Low Decoding Complexity for OFDM Systems

    Hyun-Seung Joo;Seok-Joong Heo;Hyun-Bae Jeon;Jong-Seon No

Frequent Co-Authors

Tor Helleseth
Tor Helleseth University of Bergen
Soon-Young Yoon
Soon-Young Yoon Samsung (South Korea)
Jae-Yoel Kim
Jae-Yoel Kim Samsung (South Korea)
Simon Litsyn
Simon Litsyn Tel Aviv University
Dong Hoon Lee
Dong Hoon Lee Korea University
Holger Boche
Holger Boche Technical University of Munich
P.V. Kumar
P.V. Kumar Indian Institute of Science
P. Vijay Kumar
P. Vijay Kumar Indian Institute of Science
Sangwook Nam
Sangwook Nam Seoul National University
Youngwoo Kwon
Youngwoo Kwon Seoul National University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science studies in the USA opens doors to a range of related fields. Many students consider a data science degree for careers in analytics, machine learning, or big data. Data science combines core computing skills with real-world problem solving, and affordable online programs can make this pathway accessible for more students.

For those drawn to hardware, systems design, and innovation, the best online electrical engineering programs USA provide a technical route that complements computer science expertise. These flexible online degrees can lead to roles in cutting-edge industries like renewable energy, robotics, or telecommunications.

Students looking for quick entry into the tech workforce may also benefit from easy certifications that pay well. Earning targeted credentials in areas like cybersecurity or cloud computing can greatly accelerate career growth and boost salaries, sometimes in just a few months.

If time is a concern, there are shortest master degree programs available online. These accelerated options help students gain advanced qualifications—and improve their career prospects—while balancing other commitments.

Best Scientists Citing Jong-Seon No

Trending Scientists

Recently Published Articles