Classification algorithms for codes and designs

DOI10.1007/3-540-28991-7MaRDI QIDQ819932zbMATH OpenOpenAlexFDO

Authors 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

surveydesignenumerationexistence\(t\)-designautomorphismcountinggenerationorthogonal arraypermutation groupDiophantine equationinvariantisomorphismLatin squarebacktrackingcomputer searchprojective planeexact covertriple systemcanonicaltactical decompositionorderly generation

Mathematics Subject Classification ID

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

Recommendations

• Classification of some large sets and designs
• scientific article; zbMATH DE number 53917
• Authentication codes and combinatorial designs.
• scientific article; zbMATH DE number 1265079
• Algebraic combinatorics. Translated from the Japanese

Cited in

(only showing first 100 items - show all)

• Switching codes and designs
• The cycle switching graph of the Steiner triple systems of order 19 is connected
• New results on tripod packings
• On the classification of linear complementary dual codes
• Problems and algorithms for covering arrays via set covers
• Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\)
• Classification of Graeco-Latin Cubes
• A full classification of the complete \(k\)-arcs of \(\mathrm{PG}(2,23)\) and \(\mathrm{PG}(2,25)\).
• There are exactly five biplanes with k = 11
• Integer programming for classifying orthogonal arrays
• Enumerating cube tilings
• There is no \([21,5,14]\) code over \(\mathbb F_5\)
• The unimodality of pure \(O\)-sequences of type three in three variables
• New parallelisms of \(\operatorname{PG}(3,5)\) with automorphisms of order 8
• On triangular matroids induced by \(n_3\)-configurations
• Kirkman triple systems with subsystems
• Classification of difference matrices over cyclic groups
• Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\).
• The number of Latin squares of order 11
• An adaptive prefix-assignment technique for symmetry reduction
• On the number of frequency hypercubes \(F^n(4;2,2) \)
• A tournament of order 14 with disjoint Banks and Slater sets
• Binary Covering Arrays and Existentially Closed Graphs
• Further results on existentially closed graphs arising from block designs
• On automorphism groups of a biplane \((121,16,2)\)
• On the cardinality spectrum and the number of Latin bitrades of order 3
• Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
• The Steiner quadruple systems of order 16
• Enumeration of MOLS of small order
• New quasi-symmetric designs by the Kramer-Mesner method
• On the shape of a pure \(O\)-sequence
• The semigroup of combinatorial configurations
• On optimal binary codes with unbalanced coordinates
• On transitive parallelisms of \(\mathrm{PG}(3,4)\)
• Russian doll search for the Steiner triple covering problem
• Steiner triple systems satisfying the 4-vertex condition
• Designs, groups and computing
• scientific article; zbMATH DE number 7008235 (Why is no real title available?)
• Indivisible partitions of Latin squares
• New regular parallelisms of \(\mathrm{PG}(3,5)\)
• Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I
• Optimal \((v, 4, 2, 1)\) optical orthogonal codes with small parameters
• Covering arrays via set covers
• On triple systems and strongly regular graphs
• A survey on the problems and algorithms for covering arrays via set covers
• Isomorphism and invariants of parallelisms of projective spaces
• Mappings of Butson-type Hadamard matrices
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• Edge local complementation and equivalence of binary linear codes
• Hadamard matrices of order 32
• The Kramer-Mesner method with tactical decompositions: some new unitals on 65 points
• Further results on the classification of MDS codes
• On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
• Classification of simple 2-(11,3,3) designs
• Classification of the (0, 2)-graphs of valency 8
• The unimodality of pure \(O\)-sequences of type two in four variables
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• Existence of \(q\)-analogs of Steiner systems
• Switching 3-edge-colorings of cubic graphs
• Counting Hamiltonian cycles in bipartite graphs
• Enumerating Steiner triple systems
• On independent star sets in finite graphs
• Unital designs with blocking sets
• One-factorisations of complete graphs arising from ovals in finite planes
• New lower bounds for the Shannon capacity of odd cycles
• On the maximum length of coil-in-the-box codes in dimension 8
• On hypercube packings, blocking sets and a covering problem
• Classification of triangle-free \(22_3\) configurations
• On finite models of Hilbert's incidence geometry
• Backtrack search for parallelisms of projective spaces
• Search for combinatorial objects using lattice algorithms -- revisited
• Steiner triple systems of order 21 with subsystems
• Exhaustive search for snake-in-the-box codes
• Computing Autotopism Groups of Partial Latin Rectangles
• Classification of linear codes by extending their residuals
• On binary linear codes whose automorphism group is trivial
• On unbalanced Boolean functions with best correlation immunity
• On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
• Optimal binary LCD codes
• There are 3155 nonisomorphic perfect one‐factorizations of K₁₆
• Enumeration of symmetric \((45,12,3)\) designs with nontrivial automorphisms
• Constructing random Steiner triple systems: an experimental study
• Construction of self-orthogonal codes from combinatorial designs
• QPlus: computer package for coding theory research and education
• The extended 1-perfect trades in small hypercubes
• Quaternary complex Hadamard matrices of order 18
• The chromatic number of the square of the 8-cube
• Orderly generation of Butson Hadamard matrices
• Strong difference families of special types
• Exploiting symmetries in polyhedral computations
• Constructing error-correcting binary codes using transitive permutation groups
• Switching for small strongly regular graphs
• Enumeration of Seidel matrices
• There is no McLaughlin geometry
• Enumeration of Steiner triple systems with subsystems
• The Mendelsohn triple systems of order 13
• The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes
• On point-transitive and transitive deficiency one parallelisms of \(\mathrm{PG}(3,4)\)
• The sextuply shortened binary Golay code is optimal
• Algorithms and complexity for counting configurations in Steiner triple systems

Describes a project that uses

Uses Software

• nauty
• ZRAM
• Cliquer
• 01poly

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819932)