Pages that link to "Item:Q3705350"
From MaRDI portal
The following pages link to On the covering radius of binary, linear codes meeting the Griesmer bound (Q3705350):
Displaying 9 items.
- Some optimal codes from algebraic geometry and their covering radii (Q918506) (← links)
- A class of optimal linear codes of length one above the Griesmer bound (Q1009128) (← links)
- A note on the covering radius of optimum codes (Q1180145) (← links)
- Critical problem for codes over finite chain rings (Q2238910) (← links)
- The index calculus method using non-smooth polynomials (Q2719078) (← links)
- (Q3418342) (← links)
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.) (Q3752296) (← links)
- Some new upper bounds on the covering radius of binary linear codes (Q3824229) (← links)
- (Q4352824) (← links)