Pages that link to "Item:Q5271924"

The following pages link to Decoding Cyclic Codes up to a New Bound on the Minimum Distance (Q5271924):

Displaying 10 items.

• Decoding of repeated-root cyclic codes up to new bounds on their minimum distance (Q259877) (← links)
• On some bounds on the minimum distance of cyclic codes over finite fields (Q498967) (← links)
• The new minimum distance bounds of Goppa codes and their decoding (Q679428) (← links)
• A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes (Q2448068) (← links)
• The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs (Q2976543) (← links)
• Cyclic Generalized Separable (L, G) Codes (Q3460448) (← links)
• A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set (Q3547985) (← links)
• A new procedure for decoding cyclic and BCH codes up to actual minimum distance (Q4324108) (← links)
• Use of Grobner bases to decode binary cyclic codes up to the true minimum distance (Q4324145) (← links)
• The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance (Q4682939) (← links)