Pages that link to "Item:Q1276778"
From MaRDI portal
The following pages link to On linear programming bounds for codes in polynomial metric spaces (Q1276778):
Displaying 10 items.
- Energy bounds for codes and designs in Hamming spaces (Q510492) (← links)
- An extremum problem for polynomials and bounds for codes with given distance and diameter (Q596963) (← links)
- Hexagonal metric for linear codes over a finite field (Q646745) (← links)
- Linear programming bounds for codes of small size (Q1367593) (← links)
- Linear programming bounds for codes in infinite projective spaces (Q1818899) (← links)
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces (Q2278701) (← links)
- Energy bounds for codes in polynomial metric spaces (Q2318064) (← links)
- A direct approach to linear programming bounds for codes and tms-nets (Q2383988) (← links)
- (Q3347325) (← links)
- Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography (Q3548016) (← links)