Pages that link to "Item:Q375966"

The following pages link to Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966):

Displaying 2 items.

• Vectorizing computations at decoding of nonbinary codes with small density of checks (Q507108) (← links)
• Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes (Q522923) (← links)