Skip to main navigation
Skip to search
Skip to main content
Korea University Pure Home
Home
Profiles
Research units
Equipment
Research output
Press/Media
Search by expertise, name or affiliation
Performance and bounds for repeat tree codes
Jun Heo
*
, Kyuhyuk Chung
*
Corresponding author for this work
Research output
:
Contribution to journal
›
Conference article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Performance and bounds for repeat tree codes'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Information Bits
100%
Tree Codes
100%
Repeat-accumulate Codes
75%
Non-recursive
50%
Low Complexity Compression
50%
Concatenated Gene Tree
50%
Tree Structure
25%
Performance Enhancement
25%
Low Signal-to-noise Ratio
25%
Putting
25%
Sampling Methods
25%
Low-complexity Decoding
25%
Maximum Likelihood Estimator
25%
High-frequency Noise
25%
Waterfall
25%
Repetition Code
25%
Interleaver
25%
Density Evolution
25%
Asymptotic Performance
25%
New Codes
25%
Constituent Code
25%
Tight Bounds
25%
Serial Concatenated Codes
25%
Parallel Concatenated Code
25%
Input-output Weight Distribution
25%
Engineering
Code Tree
100%
Information Bit
100%
Good Performance
50%
Recursive
50%
Encoding Complexity
50%
Signal-to-Noise Ratio
25%
Maximum Likelihood
25%
Decoding Complexity
25%
Noise Level
25%
Repetition Code
25%
Interleaver
25%
Parallel Concatenated Code
25%
Computer Science
Information Bit
100%
Good Performance
50%
Encoding Complexity
50%
Concatenated Code
50%
Noise-to-Signal Ratio
25%
maximum-likelihood
25%
Input/Output
25%
Decoding Complexity
25%
Repetition Code
25%
Computational Simulation
25%