Pages that link to "Item:Q1171042"
From MaRDI portal
The following pages link to A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound (Q1171042):
Displaying 11 items.
- On some bounds on the minimum distance of cyclic codes over finite fields (Q498967) (← links)
- A symmetric Roos bound for linear codes (Q855868) (← links)
- Constacyclic codes as invariant subspaces (Q959893) (← 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)
- Four infinite families of ternary cyclic codes with a square-root-like lower bound (Q6063263) (← links)
- On the algebraic structure of quasi-polycyclic codes and new quantum codes (Q6492480) (← links)
