Old Web
English
Sign In
Acemap
>
Paper
>
Constructing Algorithms of Large-Girth LDPC Codes Based on the Shortest Paths in Tanner Graphs
Constructing Algorithms of Large-Girth LDPC Codes Based on the Shortest Paths in Tanner Graphs
2011
Sugihara Kenya
Yoshida Hideo
Keywords:
Combinatorics
Low-density parity-check code
Parity-check matrix
Discrete mathematics
Shortest path problem
Mathematics
Graph
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]