The following pages link to (Q3340770):
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)
- On minimum distance bounds for abelian codes (Q1205130) (← links)
- Decomposition of the complete hypergraph into hyperclaws (Q1812635) (← links)
- More on the minimum distance of cyclic codes (Q3197759) (← 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)
- The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance (Q4682939) (← links)
- (Q4709560) (← links)
- A Bound on the Minimum Distance of Quasi-cyclic Codes (Q4915199) (← links)
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance (Q5271924) (← links)
