An Upper and a Lower Bound on the Probability of Undetected Error for Binary Expansions of Generalized Reed-Solomon Codes - I-Scover metadata
ARTICLE

An Upper and a Lower Bound on the Probability of Undetected Error for Binary Expansions of Generalized Reed-Solomon Codes

Metadata details

now loading...

Related ARTICLE(s)

now loading...

Related metadata

now loading...

Search by external websites

now loading...

Login 日本語