The following pages link to (Q4242009):
Displaying 20 items.
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search (Q265614) (← links)
- Optimal tristance anticodes in certain graphs (Q817597) (← links)
- Coding with variable block maps (Q861282) (← links)
- Quadratic double circulant codes over fields (Q1604572) (← links)
- Constructing permutation arrays from groups (Q1744019) (← links)
- Lights Out on graphs (Q2088176) (← links)
- Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless (Q2109380) (← links)
- Necklaces and slimes (Q2185900) (← links)
- Energy bounds for codes in polynomial metric spaces (Q2318064) (← links)
- New bounds for linear codes of covering radii 2 and 3 (Q2325293) (← links)
- New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane (Q2352466) (← links)
- Hyper-bent functions and cyclic codes (Q2368654) (← links)
- Computing the edit distance of a regular language (Q2381500) (← links)
- Antiblocking systems and PD-sets (Q2468024) (← links)
- Determination of weight enumerators of binary extremal self-dual \([42,21,8]\) codes (Q2469480) (← links)
- Linear transformations on codes (Q2501560) (← links)
- PD-sets for the codes related to some classical varieties (Q2569931) (← links)
- On the size of partial block designs with large blocks (Q2581419) (← links)
- (Q3341917) (← links)
- Quasi-Self-Dual Codes over a Non-Unital Ring of Order 4 (Q6162723) (← links)