Pages that link to "Item:Q2448068"
From MaRDI portal
The following pages link to A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes (Q2448068):
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)
- New bounds on the minimum distance of cyclic codes (Q2025340) (← links)
- (Q3340770) (← 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)
- (Q4495302) (← links)
- Nonbinary double-error-correcting codes designed by means of algebraic varieties (Q4880288) (← links)
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance (Q5271924) (← links)