Pages that link to "Item:Q3671045"
From MaRDI portal
The following pages link to A new lower bound for the minimum distance of a cyclic code (Q3671045):
Displaying 14 items.
- On some bounds on the minimum distance of cyclic codes over finite fields (Q498967) (← links)
- Power error locating pairs (Q782853) (← links)
- A symmetric Roos bound for linear codes (Q855868) (← links)
- Constacyclic codes as invariant subspaces (Q959893) (← links)
- A commutative algebra approach to linear codes (Q1024390) (← links)
- Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\) (Q1842608) (← links)
- Roos bound for skew cyclic codes in Hamming and rank metric (Q1995207) (← links)
- New bounds on the minimum distance of cyclic codes (Q2025340) (← links)
- Sum-rank product codes and bounds on the minimum distance (Q2123308) (← links)
- Rank error-correcting pairs (Q2364642) (← links)
- Monomial codes seen as invariant subspaces (Q2406589) (← links)
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes (Q2448068) (← links)
- On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1} (Q3104686) (← links)
- Four infinite families of ternary cyclic codes with a square-root-like lower bound (Q6063263) (← links)