Pages that link to "Item:Q1061095"
From MaRDI portal
The following pages link to Minimum block length of a linear q-ary code with specified dimension and code distance (Q1061095):
Displaying 13 items.
- Minimum possible block length of a linear binary code for some distances (Q798611) (← links)
- Some optimal codes from algebraic geometry and their covering radii (Q918506) (← links)
- Classification of Griesmer codes and dual transform (Q1043574) (← links)
- Optimal ternary linear codes (Q1200308) (← links)
- Divisibility of codes meeting the Griesmer bound (Q1268604) (← links)
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound (Q1802135) (← links)
- New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4) (Q1827695) (← links)
- The nonexistence of ternary \([105,6,68]\) and \([230,6,152]\) codes (Q1887641) (← links)
- Codes that attain minimum distance in every possible direction (Q2425557) (← links)
- (Q3609494) (← links)
- (Q4315798) (← links)
- Three best binary linear block codes of minimum distance fifteen (Q4838653) (← links)
- Nonexistence of some four dimensional linear codes attaining the Griesmer bound (Q6548434) (← links)
