Pages that link to "Item:Q3987474"

The following pages link to Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations (Q3987474):

Displaying 9 items.

• New developments in \(q\)-polynomial codes (Q267804) (← links)
• A symmetric Roos bound for linear codes (Q855868) (← links)
• On decoding by error location and dependent sets of error positions (Q1199627) (← links)
• A non-cyclic triple-error-correcting BCH-like code and some minimum distance results (Q2248644) (← links)
• A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes (Q2448068) (← links)
• On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding (Q4298539) (← 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)