Open Access System for Information Sharing

OASIS Repository @POSTECH Browse by Researchers

YANG, KYEONG CHEOL (양경철)

Dept of Electrical Engineering(전자전기공학과)

Field(s)

Show more items...

H-INDEX

Chart.

Keyword

PARITYCHECK CODES:14||lowdensity paritycheck (LDPC) codes:9||linear codes over Z(4):7||CROSSCORRELATION:6||BOUNDS:6||SETS:6||DESIGN:6||PERFORMANCE:6||SYSTEMS:5||generalized Hamming weights:4||CAPACITY:4||frequencyshift keying:4||GOETHALS:4||FAMILIES:4||LDPC CODES:4||nikov sequences:4||Hamming correlation:4||weight hierarchy:4||KERDOCK:4||density evolution:4||frequencyhopping sequences:4||Sidel&apos:4||Polar codes:3||DESIGNS:3||LOWER BOUNDS:3||CYCLOTOMY:3||SIDELNIKOV SEQUENCES:3||Turbo codes:3||tdesigns:3||Lowdensity paritycheck (LDPC) codes:3||LARGE LINEAR SPAN:3||SPACE:3||Orthogonal frequencydivision multiplexing (OFDM) system:3||MATRICES:3||OPTIMIZATION:3||linear complexity:3||minimum support size:3||CODES:3||TIME:3||circulant permutation matrix:3||Preparata codes:3||Goethals codes:3||Lowcomplexity decoding:3||power residue sequences:3||Codes (symbols):3||subblock processing:3||powerresidue sequences:2||iterative decoding:2||Kasami sequences:2||quasiorthogonal sequences (QOSs):2||cyclotomic numbers:2||LempelGreenberger bound:2||OPTIMAL CONSTRUCTIONS:2||repeataccumulate (RA) codes:2||Channel capacity:2||noncoherent demodulation:2||MODULATION:2||Sumproduct algorithm:2||TRANSMISSION:2||orthogonal modulation:2||multiple antennas:2||quasicyclic codes:2||error propagation:2||Legendre sequences:2||nonlinear code:2||Computational complexity:2||CONVOLUTIONALCODES:2||Bitinterleaved coded modulation:2||Decoding:2||Numerical results:2||OFDM:2||frozen bit:2||quadrature amplitude modulation:2||layered architecture:2||BINARY SEQUENCES:2||quasicyclic:2||iterative receivers:2||CONSTRUCTIONS:2||Kerdock codes:2||CONSTRUCTION:2||frequencyhopping sequences (FHSs):2||phase noise:2||coded modulation:2||frequency and quadratureamplitude modulation:2||GF(Q):2||modulation:2||Satellite communication systems:2||FREQUENCY OFFSET:1||selective mapping (SLM):1||RATIO:1||quasiorthogonal sequences:1||Walsh sequences:1||Preparata code:1||BICM:1||XWLI algorithm:1||COMBINING FUNCTIONS:1||GLOBAL AVALANCHE CHARACTERISTICS:1||BALANCED BOOLEAN FUNCTIONS:1||Adaptive modulation and coding (AMC):1||SPATIAL MULTIPLEXING SYSTEMS:1||INFORMATION:1||Forward error correction:1||Multiplexing:1||Parity check matrix:1||Successive interference cancellation(SIC):1||Iterative methods:1||Signal receivers:1||eneralized chirplike sequence:1||zerocorrelation zone sequence:1||induced correlation:1||ZERO CORRELATION ZONE:1||PARAMETERS:1||Cycle:1||Edge effect:1||PAPR:1||PAPR REDUCTION:1||matrix reduction:1||MULTIPLEACCESS TECHNIQUES:1||finite fields:1||PERIODIC CORRELATIONPROPERTIES:1||Cartesian product:1||frequencyhopping multipleaccess (FHMA):1||successive cancellation:1||block cycle:1||optimal bittosymbol mapping:1||message passing algorithm:1||multiple transmit antennas:1||period:1||statistical properties:1||peaktoaverage:1||REDUCTION:1||SCHEMES:1||gold sequences:1||3design:1||3LEVEL AUTOCORRELATION:1||UNIFIED SEQUENCES:1||periodic sequences:1||nonlinear codes:1||Weil&apos:1||POWERRESIDUE SEQUENCES:1||GENERALIZED HAMMING WEIGHTS:1||Interference suppression:1||Channel coding:1||signature sequences:1||PSEUDORANDOM:1||balancedness:1||selfshrinking generator:1||power ratio (PAPR):1||standard array:1||II CODES:1||optimal autocorrelation:1||GMW SEQUENCES:1||Kerdock code:1||Z(4):1||RAYLEIGHFADING CHANNELS:1||Gray map:1||bitinterleaved codedmodulation (BICM):1||1error linear complexity:1||Mary sequences:1||lifting:1||Chinese Remainder Theorem:1||irregular modulation:1||FEEDBACK:1||lowdensity paritycheck (LDPC) code:1||low correlation:1||PRIME:1||Table lookup:1||Integer operations:1||Partialperiod correlation:1||Cyclotomic numbers:1||ring of integers modulo n:1||periodic correlation:1||FREQUENCYHOPPING SEQUENCES:1||quasisynchronous systems:1||spatial multiplexing:1||CHANNELS:1||QAM:1||RECEIVER:1||Gallager&apos:1||LDPCcoded modulation:1||preparata codes:1||shrinking generator:1||pseudorandom sequences:1||bent functions:1||CDMA:1||CORRELATIONIMMUNITY:1||extrinsic information transfer (EXIT) chart:1||outage capacity:1||power allocation:1||Frequencyhopping multipleaccess (FHMA):1||Hamming autocorrelation:1||Frequencyhopping multiple access (FHMA):1||Cyclotomy:1||LINEAR CODES:1||s theorem:1||Cross correlation:1||Signal to noise ratio:1||Decoding algorithm:1||Frequencyhopping spread spectrum:1||PengFan bound:1||Correlation:1||optical orthogonal codes (OOCs):1||WEIGHT 5:1||nonlinear mappings:1||multipleaccess channel:1||POWER:1||blind algorithm:1||sumproduct algorithm:1||blind SLM:1||polarizing matrix:1||trapping set:1||Balancedness:1||ARY SEQUENCES:1||Diversitymultiplexing tradeoff (DMT):1||phase noise compensation:1||phaseshift keying (PSK):1||efficient encoding:1||msequences:1||codedivision multipleaccess systems:1||Kerdoek codes:1||lowdensity paritycheck code:1||quasisynchronous codedivision multiple access (QSCDMA):1||complex Hadamard matrices:1||TRANSFORM:1||PARTIALRESPONSE CHANNELS:1||Ergodic capacity:1||DECISIONFEEDBACK DETECTION:1||Linear complexity:1||multiplicative character:1||Matrix algebra:1||Adaptive decoding algorithms:1||Block Turbo codes:1||Extrinsic information:1||GCLDFT sequences:1||generalized cyclotomy:1||Polarization rate:1||girth:1||Rayleigh fading channels:1||LOW BER:1||optical fiber networks:1||quadratureamplitude modulation (QAM):1||INTERFERENCE CANCELLATION:1||optimal correlation property:1||PREPARATA CODES:1||IDEAL AUTOCORRELATION:1||COVERING RADIUS:1||lowcorrelation zone (LCZ) sequences:1||quaternary sequences:1||DIFFERENCE SETS:1||stream ciphers:1||Turbo equalizer (TE):1||FADING CHANNELS:1||HOP SIGNALS:1||polyphase sequences:1||Multiplexing equipment:1||Conventional schemes:1||Successive interference cancellations:1||Chase algorithm:1||Iterative decoding:1||ZadoffChu sequence:1||ZadoffChu sequences:1||length compatibility:1||factor graph:1||frequencydomain equalizer (FDE):1||residual intersymbol interference cancellation (RISIC):1||puncturing:1||frequencyhopping sequences (FHS):1||PERFORMANCE ANALYSIS:1||constant modulus modulation:1||WIRELESS COMMUNICATION:1||s decoding algorithm A:1||degree distributions:1||Partial distances:1||Polarizing matrix:1||side information:1||SIGNALS:1||low errorrate performance:1||Error floor:1||importance sampling:1||FIBER NETWORKS:1||ARCHITECTURES:1||Decisionfeedback detection (DFD):1||MARY PSK:1||Density evolution:1||No sequences:1||WEIGHT HIERARCHY:1||spacetime codes:1||PSEUDORANDOM SEQUENCES:1||split weight enumerator:1||HIERARCHY:1||COMMUNICATION:1||cryptography:1||kerror linear complexity:1||FAST ALGORITHM:1||blockcycle:1||INTERSYMBOL INTERFERENCE:1||EQUALIZATION:1||rate allocation:1||CONGRUENCES:1||interleaved sequences:1||LINEAR COMPLEXITY:1||multiplicative characters:1||Decoding complexity:1||Linear block code:1||Radio frequency channels:1||POLYPHASE SEQUENCES:1||linear phaseshifting sequences:1||progressive edgegrowth (PEG) algorithm:1||Exponent:1||Kronecker product:1||low complexity decoding:1||COMBINATORIAL CONSTRUCTIONS:1||lowhitzone frequencyhopping sequences (LHZFHSs):1||diversity:1||multipleinput multipleoutput (MIMO):1||pulseamplitude modulation (PAM):1||multiple inputmultiple output (MIMO):1||VBLAST:1||COMPUTATION:1||twolevel autocorrelation property:1||array codes:1||minimum distance:1||linear block code:1||randomness properties:1||PREPARATA:1||PERIOD:1||Tanner graphs:1||lowdensity paritycheck (LDPQ codes:1||NONLINEARITY:1||intersymbol interference (ISI) channel:1||DECOMPOSITION:1||Jacobi sum:1||Layereddivision multiplexing (LDM):1||Commercial communication:1||MULTIPLEACCESS COMMUNICATION:1||

Open Access System for Information Sharing

H-INDEX

Keyword

Publication & Time Cited Count(For the Last 5 years)

Browse

Publication & Time Cited Count
(For the Last 5 years)