Classification algorithms for codes and designs

DOI10.1007/3-540-28991-7zbMath1089.05001OpenAlexW1602929565MaRDI QIDQ819932

Petteri Kaski, Patric R. J. Östergård

Publication date: 3 April 2006

Published in: Algorithms and Computation in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-28991-7

zbMATH Keywords

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of error-correcting codes and error-detecting codes (94Bxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx) Designs and configurations (05Bxx) Finite geometry and special incidence structures (51Exx)

Related Items (only showing first 100 items - show all)

On the number of frequency hypercubes $F^n(4;2,2) $ ⋮ On the classification of linear complementary dual codes ⋮ Isomorphism and Invariants of Parallelisms of Projective Spaces ⋮ Classification of Linear Codes by Extending Their Residuals ⋮ The Program Generation in the Software Package QextNewEdition ⋮ New lower bounds for the Shannon capacity of odd cycles ⋮ Nonexistence Certificates for Ovals in a Projective Plane of Order Ten ⋮ New parallelisms of $\operatorname{PG}(3,5)$ with automorphisms of order 8 ⋮ Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters ⋮ Comments on 3-blocked designs ⋮ The number of Latin squares of order 11 ⋮ Switching 3-edge-colorings of cubic graphs ⋮ Further results on the classification of MDS codes ⋮ The Steiner quadruple systems of order 16 ⋮ On the classification of quaternary optimal Hermitian LCD codes ⋮ On Binary Linear Codes Whose Automorphism Group is Trivial ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ On transitive parallelisms of $\mathrm{PG}(3,4)$ ⋮ Optimal $(v,5,2,1)$ optical orthogonal codes of small $v$ ⋮ On optimal binary codes with unbalanced coordinates ⋮ One-factorisations of complete graphs arising from ovals in finite planes ⋮ Classification of triangle-free $22_3$ configurations ⋮ Constructing error-correcting binary codes using transitive permutation groups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Construction of self-orthogonal codes from combinatorial designs ⋮ The unimodality of pure $O$-sequences of type three in three variables ⋮ Enumerating cube tilings ⋮ There is no $[21,5,14$ code over $\mathbb F_5$] ⋮ Classification of Cyclic Steiner Quadruple Systems ⋮ Enumeration of Seidel matrices ⋮ Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I ⋮ Classification of difference matrices over cyclic groups ⋮ There is no McLaughlin geometry ⋮ On the cardinality spectrum and the number of Latin bitrades of order 3 ⋮ The semigroup of combinatorial configurations ⋮ Some sequences of optimal constant weight codes ⋮ Unital designs with blocking sets ⋮ On the minimum size of 4-uniform hypergraphs without property $B$ ⋮ EXISTENCE OF -ANALOGS OF STEINER SYSTEMS ⋮ On triple systems and strongly regular graphs ⋮ On independent star sets in finite graphs ⋮ New Steiner 2-designs from old ones by paramodifications ⋮ Russian doll search for the Steiner triple covering problem ⋮ New results on tripod packings ⋮ Switching codes and designs ⋮ The sextuply shortened binary Golay code is optimal ⋮ The cycle switching graph of the Steiner triple systems of order 19 is connected ⋮ On the maximum length of coil-in-the-box codes in dimension 8 ⋮ On hypercube packings, blocking sets and a covering problem ⋮ QPlus: computer package for coding theory research and education ⋮ Steiner triple systems satisfying the 4-vertex condition ⋮ Biangular lines revisited ⋮ Optimal binary LCD codes ⋮ The chromatic number of the square of the $8$-cube ⋮ Covering arrays via set covers ⋮ On the shape of a pure 𝑂-sequence ⋮ Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19 ⋮ A full classification of the complete k‐arcs of PG(2,23) and PG(2,25) ⋮ A tournament of order 14 with disjoint Banks and Slater sets ⋮ Hadamard Matrices of Order 32 ⋮ The extended 1-perfect trades in small hypercubes ⋮ Indivisible partitions of Latin squares ⋮ Integer Programming for Classifying Orthogonal Arrays ⋮ On the $\mathrm{OA}(1536,13,2,7)$ and related orthogonal arrays ⋮ Enumeration of MOLS of small order ⋮ Mappings of Butson-type Hadamard matrices ⋮ Further results on existentially closed graphs arising from block designs ⋮ On automorphism groups of a biplane $(121,16,2)$ ⋮ Constructions of maximum few-distance sets in Euclidean spaces ⋮ On the volumes and affine types of trades ⋮ There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄ ⋮ New quasi-symmetric designs by the Kramer-Mesner method ⋮ On the minimum size of binary codes with length $2R+4$ and covering radius $R$ ⋮ Edge local complementation and equivalence of binary linear codes ⋮ Strong difference families of special types ⋮ Classification of simple 2-(11,3,3) designs ⋮ Classification of the (0, 2)-graphs of valency 8 ⋮ New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces ⋮ On triangular matroids induced by $n_3$-configurations ⋮ The Kramer-Mesner method with tactical decompositions: some new unitals on 65 points ⋮ On unbalanced Boolean functions with best correlation immunity ⋮ New Regular Parallelisms of PG(3, 5) ⋮ Classification of optimal $(v, 4, 1)$ binary cyclically permutable constant-weight codes and cyclic $2$-$(v, 4, 1)$ designs with $v \leq 76$. ⋮ Orderly generation of Butson Hadamard matrices ⋮ Kirkman triple systems with subsystems ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ Designs, Groups and Computing ⋮ Unnamed Item ⋮ New lower bounds on $q$-ary error-correcting codes ⋮ Exploiting Symmetries in Polyhedral Computations ⋮ Problems and algorithms for covering arrays via set covers ⋮ A survey on the problems and algorithms for covering arrays via set covers ⋮ On point-transitive and transitive deficiency one parallelisms of $\mathrm{PG}(3,4)$ ⋮ Parallelisms of $\mathrm{PG}(3,4)$ invariant under an elementary abelian group of order 4 ⋮ Counting Hamiltonian cycles in bipartite graphs ⋮ Exhaustive search for snake-in-the-box codes ⋮ Search for combinatorial objects using lattice algorithms -- revisited ⋮ Backtrack search for parallelisms of projective spaces ⋮ The unimodality of pure $O$-sequences of type two in four variables

Uses Software

This page was built for publication: Classification algorithms for codes and designs