ScholarWorks@Korea University: HEO, JUN

Detailed Information

HEO, JUN (허준)

College of Engineering

Research Area

Tel 4824
Homepage

ResearcherID ORCiD Scopus Google Scholar ID ResearchGate

Keyword

Raptor codes:4||Rscc Serial Concatenated Code:3||LDPC codes:3||EXIT chart:3||Poisson network:3||IPTV:2||CDMA:2||Decoy state:2||Quantum resource analysis:2||Quantum algorithm:2||Lowdensity paritycheck codes:2||Interference:2||Infrared Channel:2||Quantum error correcting code:2||Finitesize effect:2||Quantum error correction:2||Bit error probability:2||outage probability:2||Relay:2||Outage probability:2||Turbo Coding:2||LDPC code:2||Quantum key distribution:2||Quantum errorcorrecting code:2||scheduling:1||mutual information:1||cointegration:1||rateless codes:1||secrecy capacity:1||Block Turbo Code:1||Unequal error protection:1||Systematic codes:1||BCH coding:1||steganography:1||multiple interferers:1||TV spectrum:1||simulation:1||Coded cooperation:1||puncturing:1||Network coding:1||Fountain codes:1||antijamming:1||Feedforward:1||Polar codes:1||Graph theory:1||Syndromebased decoding:1||Softinput softoutput decoding:1||shuffled decoding:1||interference cancellation:1||Pairs trading:1||Imperfect ebits:1||unequal error protection:1||Cooperative jamming:1||secure communications:1||optimal placement of nodes:1||Amplifyandforward (AF):1||syndrome coding:1||Lowdensity paritycheck (LDPC) codes:1||stopping sets:1||binary erasure channel:1||mixed scheduling:1||Path virtualization:1||twincell detection (TCD):1||Rectangular surface code:1||Twinfield QKD:1||MISO:1||decodeandforward (DF):1||Quantum gates:1||Image color analysis:1||Quantum linear system algorithm:1||MIMO communication:1||Linear systems:1||Linear MIMO detection:1||hardinput softoutput (HISO):1||extended Hamming code:1||error correction code:1||degree distribution optimization:1||multipleinput multipleoutput (MIMO):1||Throughputreliability tradeoff:1||Multiple interferences:1||Amplifyandforward (AF) relaying:1||Cooperative spectrum sensing:1||RSCC serial concatenated code:1||BernoulliGaussian noise:1||home appliances:1||density evolution (DE):1||belief propagation decoding:1||multiple input multiple output (MIMO):1||very large scale integration (VLSI):1||Cable television broadcasting:1||interference mitigation:1||maximum likelihood (ML) decoding:1||BCJR algorithm:1||Color:1||Quantum state:1||Quantum secure direct communication:1||Turbo product codes:1||polar codes:1||softinput softoutput (SISO):1||hard decision decoding (HDD):1||SVR:1||graph code:1||Distributed rateless codes:1||Degree distribution design:1||untrustworthy users:1||IEEE 802.16e:1||WiMAX:1||Decodeandforward (DF) relaying:1||data hiding:1||3D HD video:1||Heterogeneous wireless networks:1||MIMO:1||blocktype LDPC codes (BLDPC):1||sequential scheduling:1||spatial dernultiplexing.:1||Biased noise channel:1||Complexity reduction:1||Wiretap channel:1||quantum computing:1||Hardinput softoutput decoding:1||small block size:1||Quantum information:1||Codeword stabilized quantum codes:1||Entanglementassisted quantum errorcorrecting codes:1||multiuser relay networks:1||RateCompatible code:1||Rateless codes:1||Multihop relaying:1||IEEE 802.11n WLAN:1||power line communication system:1||maximum likelihood detection with QR decomposition and Malgorithm (QRMMLD):1||QR decomposition:1||OpenCable:1||HARQ:1||multipath mitigation:1||weight distributions:1||Protographbased extrinsic transfer chart:1||Normalized minsum algorithm:1||Physical layer security:1||Scrambling:1||dualhop relay:1||transmission capacity:1||Search problems:1||Dynamic spectrum management:1||Readout problem:1||Quantum architectures:1||Qubit:1||Early termination:1||Dirty paper coding:1||Entanglementassisted codewordstabilized code:1||Operator quantum errorcorrecting codes:1||graph state:1||symbol error probability:1||orthogonal spacetime block codes (OSTBCs):1||Maxmin selection:1||Multiinput multioutput (MIMO) detection:1||onthefly decoding:1||Video multicast:1||Raptor code:1||double binary turbo code:1||orthogonal frequency division multiplexing:1||Fountain code:1||Rician fading channel:1||Transmission Throughput:1||Code acquisition:1||fractional Doppler frequency offset (FDFO):1||cochannel interference:1||FEC:1||enhanceddecoding RS codes:1||turbolike codes:1||Security gap:1||PN sequence:1||interference:1||Softoutput decoding:1||quantum search algorithm:1||Lattice surgery:1||Logic gates:1||information reconciliation:1||successivecancellation list decoder:1||DTW:1||local complementation:1||stabilizer formalism:1||fountain codes:1||physical layer security:1||optimal number of hops:1||Random access transport capacity:1||error correcting code (ECC):1||Iterative decoding:1||opportunistic relaying:1||raptor codes:1||Cognitive radio:1||WiFi:1||Cooperative transmission:1||Transmission throughput:1||Advanced metering infrastructure:1||smart grid:1||trapping sets:1||Video streaming:1||lowdensity paritycheck code (LDPC) codes:1||spreadspectrum (SS):1||Maximum likelihood detection (MLD):1||UltraHigh Definition (UD):1||Super HiVision:1||Next generation broadcasting:1||fractional frequency reuse:1||BP decoding:1||lowdensity paritycheck (LDPC) codes:1||Carrier frequency offset estimation:1||amplifyandforward (AF):1||Parallelization:1||Quantum computation:1||graph coloring problem:1||quantum linear system algorithm:1||Block turbo code (BTC):1||ARIMA:1||erasure codes:1||amplifyandforward (AF) relaying:1||Linear mulithop relaying:1||paritycheck matrix extension:1||maximumlikelihood decoding:1||KoutofNrule:1||Link adaptation:1||Cooperative Transmission:1||maximal ratio combining:1||HybridARQ:1||GPS:1||Precode:1||Joint iterative decoding:1||TDSOFDM:1||Heuristic algorithms:1||Complexity theory:1||MIMO detection:1||Quantum circuit mapping:1||Quantum computing:1||Runtime:1||

RSS_1.0 RSS_2.0 ATOM_1.0

145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963

Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.

Detailed Information

Keyword

BROWSE