The following pages link to (Q4709560):
Displaying 19 items.
- Optimal \(p\)-ary cyclic codes with minimum distance four from monomials (Q301634) (← links)
- Cyclic and BCH codes whose minimum distance equals their maximum BCH bound (Q326325) (← links)
- Constacyclic codes as invariant subspaces (Q959893) (← links)
- On binary cyclic codes with minimum distance \(d=3\). (Q1130096) (← links)
- A note on binary cyclic codes of blocklength 63 (Q1199578) (← links)
- On minimum distance bounds for abelian codes (Q1205130) (← links)
- Minimum distance and the minimum weight codewords of Schubert codes (Q1679693) (← links)
- A method to enlarge the design distance of BCH codes and some classes of infinite optimal cyclic codes (Q1745072) (← links)
- On the minimum distance of Castle codes (Q1943464) (← links)
- On the minimum distances of non-binary cyclic codes (Q1963168) (← links)
- New bounds on the minimum distance of cyclic codes (Q2025340) (← links)
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes (Q2448068) (← links)
- Distance distributions of cyclic orbit codes (Q2657131) (← links)
- (Q3340770) (← links)
- A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set (Q3547985) (← links)
- A Bound on the Minimum Distance of Quasi-cyclic Codes (Q4915199) (← links)
- On the Minimal Distance of Binary Self-Dual Cyclic Codes (Q4974043) (← links)
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance (Q5271924) (← links)
- Several classes of optimal \(p\)-ary cyclic codes with minimum distance four (Q6063232) (← links)
