Nam Yul Yu

Orcid: 0000-0001-9265-712X

According to our database1, Nam Yul Yu authored at least 71 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Joint Activity and Data Detection for Massive Grant-Free Access Using Deterministic Non-Orthogonal Signatures.
IEEE Trans. Wirel. Commun., August, 2024

Joint Activity and Data Detection for Massive Grant-Free Access Using Deterministic Non-Orthogonal Signatures.
CoRR, 2024

2023
End-to-End Learning-Based Wireless Image Recognition Using the PyramidNet in Edge Intelligence.
Proceedings of the 34th IEEE Annual International Symposium on Personal, 2023

2022
Kronecker-Based Non-Orthogonal Sequences of Small Phases for Uplink Grant-Free Access Using the Genetic Algorithm.
IEEE Commun. Lett., 2022

Performance Analysis of Signature-Based Grant-Free Random Access Under Impersonation Attacks.
IEEE Access, 2022

Design Framework of Fourier-Based Non-Orthogonal Sequences for Sparse Activity Detection in Multicell Massive Connectivity.
IEEE Access, 2022

Secure Image Encryption Based on Compressed Sensing and Scrambling for Internet-of-Multimedia Things.
IEEE Access, 2022

Privacy-Preserving Federated Learning Using Homomorphic Encryption With Different Encryption Keys.
Proceedings of the 13th International Conference on Information and Communication Technology Convergence, 2022

2021
Binary Golay Spreading Sequences and Reed-Muller Codes for Uplink Grant-Free NOMA.
IEEE Trans. Commun., 2021

Design of Non-Orthogonal Sequences Using a Two-Stage Genetic Algorithm for Grant-Free Massive Connectivity.
CoRR, 2021

2020
Secure and Efficient Compressed Sensing-Based Encryption With Sparse Matrices.
IEEE Trans. Inf. Forensics Secur., 2020

Non-Orthogonal Golay-Based Spreading Sequences for Uplink Grant-Free Access.
IEEE Commun. Lett., 2020

Exploiting prior information for greedy compressed sensing based detection in machine-type communications.
Digit. Signal Process., 2020

2019
Online Learning-Based Downlink Transmission Coordination in Ultra-Dense Millimeter Wave Heterogeneous Networks.
IEEE Trans. Wirel. Commun., 2019

Multiuser Activity and Data Detection via Sparsity-Blind Greedy Recovery for Uplink Grant-Free NOMA.
IEEE Commun. Lett., 2019

A Fast and Noise-Robust Algorithm for Joint Sparse Recovery Through Information Transfer.
IEEE Access, 2019

Optimum Modulation Orders for 1-bit Compressively Sampled Signals in Multicarrier Transmission.
Proceedings of the 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2019

Security Analysis of Compressed Encryption With Sparse Matrices Against Chosen Plaintext Attacks.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Indistinguishability and Energy Sensitivity of Gaussian and Bernoulli Compressed Encryption.
IEEE Trans. Inf. Forensics Secur., 2018

Secure Communications With Asymptotically Gaussian Compressed Encryption.
IEEE Signal Process. Lett., 2018

Improvement of Greedy Algorithms With Prior Information for Sparse Signal Recovery.
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018

A Novel Greedy Algorithm for Joint Sparse Recovery Through Information Transfer.
Proceedings of the 2018 IEEE Global Conference on Signal and Information Processing, 2018

2017
An Information-Theoretic Study for Joint Sparsity Pattern Recovery With Different Sensing Matrices.
IEEE Trans. Inf. Theory, 2017

Compressive Channel Division Multiple Access for MTC Under Frequency-Selective Fading.
IEEE Trans. Commun., 2017

Correction to "Indistinguishability of Compressed Encryption With Circulant Matrices for Wireless Security".
IEEE Signal Process. Lett., 2017

Indistinguishability of Compressed Encryption With Circulant Matrices for Wireless Security.
IEEE Signal Process. Lett., 2017

On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream.
EURASIP J. Adv. Signal Process., 2017

Indistinguishability and Energy Sensitivity of Asymptotically Gaussian Compressed Encryption.
CoRR, 2017

Pilot Signal Design for Compressive Sensing Based Random Access in Machine-Type Communications.
Proceedings of the 2017 IEEE Wireless Communications and Networking Conference, 2017

Channel division multiple access for MTC under frequency-selective fading.
Proceedings of the IEEE International Conference on Communications, 2017

On the indistinguishability of compressed encryption with partial unitary sensing matrices.
Proceedings of the 2017 IEEE Global Conference on Signal and Information Processing, 2017

2016
An Information Theoretic Study for Noisy Compressed Sensing With Joint Sparsity Model-2.
CoRR, 2016

Secure compressive random access for meter reading in smart grid using multi-antenna access point.
Proceedings of the 2016 IEEE International Conference on Smart Grid Communications, 2016

On the correctness of coherence in the determination of preambles for compressive random access.
Proceedings of the International Conference on Information and Communication Technology Convergence, 2016

Compressive Random Access Using Multiple Resource Blocks for MTC.
Proceedings of the 2016 IEEE Globecom Workshops, Washington, DC, USA, December 4-8, 2016, 2016

A study on mixing sequences in modulated wideband converters.
Proceedings of the 2016 IEEE Global Conference on Signal and Information Processing, 2016

2015
Design of new fingerprinting codes using optical orthogonal codes.
Proceedings of the 21st Asia-Pacific Conference on Communications, 2015

2014
Convolutional Compressed Sensing Using Decimated Sidelnikov Sequences.
IEEE Signal Process. Lett., 2014

A new class of near-optimal partial Fourier codebooks from an almost difference set.
Des. Codes Cryptogr., 2014

A Fourier transform approach for improving the Levenshtein's lower bound on aperiodic correlation of binary sequences.
Adv. Math. Commun., 2014

2013
New Polyphase Sequence Families With Low Correlation Derived From the Weil Bound of Exponential Sums.
IEEE Trans. Inf. Theory, 2013

Deterministic Construction of Real-Valued Ternary Sensing Matrices Using Optical Orthogonal Codes.
IEEE Signal Process. Lett., 2013

Deterministic construction of Fourier-based compressed sensing matrices using an almost difference set.
EURASIP J. Adv. Signal Process., 2013

2012
A Construction of Codebooks Associated With Binary Sequences.
IEEE Trans. Inf. Theory, 2012

Partial Fourier Codebooks Associated with Multiplied Golay Complementary Sequences for Compressed Sensing.
Proceedings of the Sequences and Their Applications - SETA 2012, 2012

On statistical restricted isometry property of a new class of deterministic partial Fourier compressed sensing matrices.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

New construction of a near-optimal partial Fourier codebook using the structure of binary m-sequences.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

New near-optimal codebooks associated with binary Sidelnikov sequences.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Modeling papr of MC-CDMA by generalized extreme value distribution.
Proceedings of the 25th IEEE Canadian Conference on Electrical and Computer Engineering, 2012

2011
Near-Complementary Sequences With Low PMEPR for Peak Power Control in Multicarrier Communications.
IEEE Trans. Inf. Theory, 2011

Additive character sequences with small alphabets for compressed sensing matrices.
Proceedings of the IEEE International Conference on Acoustics, 2011

Deterministic compressed sensing matrices from multiplicative character sequences.
Proceedings of the 45st Annual Conference on Information Sciences and Systems, 2011

2010
Multiplicative Characters, the Weil Bound, and Polyphase Sequence Families With Low Correlation.
IEEE Trans. Inf. Theory, 2010

New construction of M -ary sequence families with low correlation from the structure of Sidelnikov sequences.
IEEE Trans. Inf. Theory, 2010

Reed-Muller Codes for Peak Power Control in Multicarrier CDMA
CoRR, 2010

Deterministic Compressed Sensing Matrices from Additive Character Sequences
CoRR, 2010

Generalized constructions of polyphase sequence families using shift and addition of multiplicative character sequences.
Proceedings of the IEEE International Symposium on Information Theory, 2010

On the structure of M-ary Sidelnikov sequences of period p<sup>2m</sup> - 1.
Proceedings of the IEEE International Symposium on Information Theory, 2010

A Theoretical study of peak-to-average power ratio in Reed-Muller coded multicarrier CDMA.
Proceedings of the 44th Annual Conference on Information Sciences and Systems, 2010

Peak power control of MC-CDMA with special classes of binary sequences.
Proceedings of the 23rd Canadian Conference on Electrical and Computer Engineering, 2010

2009
Near-Complementary Sequences of Various Lengths and Low PMEPR for Multicarrier Communications.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

Multiplexing Realizations of the Decimation-Hadamard Transform of Two-Level Autocorrelation Sequences.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009

2008
New Binary Sequences With Optimal Autocorrelation Magnitude.
IEEE Trans. Inf. Theory, 2008

Performances of Punctured Tail-Biting Convolutional Codes Using Initial State Estimation.
Proceedings of the 68th IEEE Vehicular Technology Conference, 2008

2007
The Perfect Binary Sequence of Period 4 for Low Periodic and Aperiodic Autocorrelations.
Proceedings of the Sequences, Subsequences, and Consequences, International Workshop, 2007

2006
Constructions of Quadratic Bent Functions in Polynomial Forms.
IEEE Trans. Inf. Theory, 2006

A new binary sequence family with low correlation and large size.
IEEE Trans. Inf. Theory, 2006

Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation.
Proceedings of the Sequences and Their Applications, 2006

2005
Realizations from Decimation Hadamard Transform for Special Classes of Binary Sequences with Two-Level Autocorrelation.
Proceedings of the Coding and Cryptography, International Workshop, 2005

Maximum correlation of binary signals over fading channels.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2000
Iterative Decoding of Product Codes Composed of Extended Hamming Codes.
Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000), 2000


  Loading...