Pages that link to "Item:Q259877"
From MaRDI portal
The following pages link to Decoding of repeated-root cyclic codes up to new bounds on their minimum distance (Q259877):
Displaying 7 items.
- Matrix-product structure of repeated-root cyclic codes over finite fields (Q268495) (← links)
- On LCD repeated-root cyclic codes over finite fields (Q1743389) (← links)
- Two new families of quantum synchronizable codes (Q2110957) (← 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)
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance (Q5271924) (← links)