Constructing Algorithms of Large-Girth LDPC Codes Based on the Shortest Paths in Tanner Graphs - I-Scover metadata
ARTICLE

Constructing Algorithms of Large-Girth LDPC Codes Based on the Shortest Paths in Tanner Graphs

Metadata details

now loading...

Related ARTICLE(s)

now loading...

Related metadata

now loading...

Search by external websites

now loading...

Login 日本語