Pages that link to "Item:Q819932"
From MaRDI portal
The following pages link to Classification algorithms for codes and designs (Q819932):
Displaying 50 items.
- Biangular lines revisited (Q2230922) (← links)
- Optimal binary LCD codes (Q2234460) (← links)
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays (Q2279982) (← links)
- Further results on existentially closed graphs arising from block designs (Q2287728) (← links)
- Constructions of maximum few-distance sets in Euclidean spaces (Q2290349) (← links)
- On the volumes and affine types of trades (Q2290357) (← links)
- Strong difference families of special types (Q2297729) (← links)
- On unbalanced Boolean functions with best correlation immunity (Q2309213) (← links)
- New lower bounds on \(q\)-ary error-correcting codes (Q2325290) (← links)
- Problems and algorithms for covering arrays via set covers (Q2333828) (← links)
- A survey on the problems and algorithms for covering arrays via set covers (Q2333829) (← links)
- On point-transitive and transitive deficiency one parallelisms of \(\mathrm{PG}(3,4)\) (Q2339129) (← links)
- Exhaustive search for snake-in-the-box codes (Q2354613) (← links)
- New lower bounds for the Shannon capacity of odd cycles (Q2364621) (← links)
- Constructing error-correcting binary codes using transitive permutation groups (Q2410250) (← links)
- Unital designs with blocking sets (Q2434724) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
- On independent star sets in finite graphs (Q2437349) (← links)
- Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I (Q2677315) (← links)
- Enumeration of MOLS of small order (Q2792342) (← links)
- New Regular Parallelisms of PG(3, 5) (Q2831138) (← links)
- Designs, Groups and Computing (Q2841966) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- Counting Hamiltonian cycles in bipartite graphs (Q2871195) (← links)
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS (Q2971026) (← links)
- The Kramer-Mesner method with tactical decompositions: some new unitals on 65 points (Q3087611) (← links)
- Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters (Q3165564) (← links)
- Comments on 3-blocked designs (Q3167098) (← links)
- The number of Latin squares of order 11 (Q3168748) (← links)
- A full classification of the complete <i>k</i>‐arcs of PG(2,23) and PG(2,25) (Q3578143) (← links)
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of<i>K</i><sub>14</sub> (Q3619607) (← links)
- Some sequences of optimal constant weight codes (Q4602094) (← links)
- (Q4616114) (← links)
- The chromatic number of the square of the $8$-cube (Q4640334) (← links)
- Hadamard Matrices of Order 32 (Q4929251) (← links)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
- Isomorphism and Invariants of Parallelisms of Projective Spaces (Q5039568) (← links)
- Classification of Linear Codes by Extending Their Residuals (Q5039569) (← links)
- The Program Generation in the Software Package QextNewEdition (Q5039570) (← links)
- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten (Q5041183) (← links)
- On Binary Linear Codes Whose Automorphism Group is Trivial (Q5069726) (← links)
- New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces (Q5217056) (← links)
- Orderly generation of Butson Hadamard matrices (Q5235101) (← links)
- (Q5241122) (← links)
- (Q5241131) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- Classification of Cyclic Steiner Quadruple Systems (Q5346572) (← links)
- Integer Programming for Classifying Orthogonal Arrays (Q5374250) (← links)
- QPlus: computer package for coding theory research and education (Q5391498) (← links)
- On the shape of a pure 𝑂-sequence (Q5403719) (← links)
