Pages that link to "Item:Q920930"
From MaRDI portal
The following pages link to A new upper bound on nonbinary block codes (Q920930):
Displaying 15 items.
- Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes (Q522923) (← links)
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming (Q855871) (← links)
- A new upper bound on the rate of non-binary codes (Q874418) (← links)
- Dense packings from quadratic fields and codes (Q941315) (← links)
- On bounds for codes over Frobenius rings under homogeneous weights (Q1763332) (← links)
- Block transitive codes attaining the Tsfasman-Vladut-Zink bound (Q2182083) (← links)
- Improved upper bounds for parent-identifying set systems and separable codes (Q2220762) (← links)
- New upper bounds on Lee codes (Q2492226) (← links)
- Intersecting codes and partially identifying codes (Q2741412) (← links)
- A new non-asymptotic upper bound for snake-in-the-box codes (Q2768131) (← links)
- (Q3794079) (← links)
- A New Upper Bound for the Dimension of Trace Codes (Q3988559) (← links)
- (Q4664686) (← links)
- Upper bounds on weight hierarchies of extremal non-chain codes (Q5951954) (← links)
- Weakly resolvable block designs and nonbinary codes meeting the Johnson bound (Q6173444) (← links)
