Pages that link to "Item:Q4324108"
From MaRDI portal
The following pages link to A new procedure for decoding cyclic and BCH codes up to actual minimum distance (Q4324108):
Displaying 9 items.
- Algebraic decoding of the \((41, 21, 9)\) quadratic residue code (Q730938) (← links)
- A symmetric Roos bound for linear codes (Q855868) (← links)
- Decoding the ternary \((23, 11, 9)\) quadratic residue code (Q983400) (← links)
- A non-cyclic triple-error-correcting BCH-like code and some minimum distance results (Q2248644) (← links)
- Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations (Q3987474) (← links)
- (Q4032412) (← 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)
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance (Q5271924) (← links)