Pages that link to "Item:Q326325"
From MaRDI portal
The following pages link to Cyclic and BCH codes whose minimum distance equals their maximum BCH bound (Q326325):
Displaying 6 items.
- Constructions of abelian codes multiplying dimension of cyclic codes (Q782693) (← links)
- A method to enlarge the design distance of BCH codes and some classes of infinite optimal cyclic codes (Q1745072) (← links)
- A non-cyclic triple-error-correcting BCH-like code and some minimum distance results (Q2248644) (← links)
- A new procedure for decoding cyclic and BCH codes up to actual minimum distance (Q4324108) (← links)
- (Q5284066) (← links)
- On a class of wide-sense binary BCH codes whose minimum distances exceed the BCH bound (Corresp.) (Q5550274) (← links)