Pages that link to "Item:Q1963168"
From MaRDI portal
The following pages link to On the minimum distances of non-binary cyclic codes (Q1963168):
Displaying 16 items.
- On binary cyclic codes with minimum distance \(d=3\). (Q1130096) (← links)
- On the minimum distance of negacyclic codes with two zeros (Q1633288) (← links)
- Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\) (Q1906643) (← links)
- On bases of BCH codes with designed distance 3 and their extensions (Q2229574) (← links)
- A non-cyclic triple-error-correcting BCH-like code and some minimum distance results (Q2248644) (← links)
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes (Q2448068) (← links)
- A new class of distance-optimal binary cyclic codes and their duals (Q2682397) (← links)
- Optimal \(p\)-ary cyclic codes with two zeros (Q2682399) (← links)
- More on the minimum distance of cyclic codes (Q3197759) (← links)
- Irreducible trinomials over finite fields (Q4417173) (← links)
- (Q4495302) (← links)
- (Q4709560) (← links)
- (Q4886134) (← links)
- On the Minimal Distance of Binary Self-Dual Cyclic Codes (Q4974043) (← links)
- Counting irreducible polynomials over <i>GF(3)</i> with first and third coefficients given (Q5247080) (← links)
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance (Q5271924) (← links)
