Old Web
English
Sign In
Acemap
>
Paper
>
A Dynamic Programming Algorithm to Construct Optimal Code Trees of Binary AIFV-m Codes
A Dynamic Programming Algorithm to Construct Optimal Code Trees of Binary AIFV-m Codes
2017
Kawai Takaya
Iwata Ken-ichi
Yamamoto Hirosuke
Keywords:
Low-density parity-check code
Concatenated error correction code
Online codes
Block code
Expander code
Serial concatenated convolutional codes
Linear code
Discrete mathematics
Mathematics
Tornado code
Reed–Solomon error correction
Reed–Muller code
Raptor code
Algorithm
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]