Classification algorithms for codes and designs

DOI10.1007/3-540-28991-7zbMATH Open1089.05001OpenAlexW1602929565MaRDI QIDQ819932FDOQ819932

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

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

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)

Cited In (only showing first 100 items - show all)

• Computing Autotopism Groups of Partial Latin Rectangles
• QPlus: computer package for coding theory research and education
• Exploiting symmetries in polyhedral computations
• Parallelisms of \(\mathrm{PG}(3,4)\) invariant under an elementary abelian group of order 4
• Backtrack search for parallelisms of projective spaces
• Search for combinatorial objects using lattice algorithms -- revisited
• Strong difference families of special types
• The sextuply shortened binary Golay code is optimal
• Classification of linear codes by extending their residuals
• On the resolutions of cyclic Steiner triple systems with small parameters
• New lower bounds on \(q\)-ary error-correcting codes
• On binary linear codes whose automorphism group is trivial
• Algorithms and complexity for counting configurations in Steiner triple systems
• The chromatic number of the square of the 8-cube
• Steiner triple systems of order 21 with subsystems
• The extended 1-perfect trades in small hypercubes
• Biangular lines revisited
• On the volumes and affine types of trades
• Enumeration of symmetric \((45,12,3)\) designs with nontrivial automorphisms
• On point-transitive and transitive deficiency one parallelisms of \(\mathrm{PG}(3,4)\)
• On finite models of Hilbert's incidence geometry
• Some sequences of optimal constant weight codes
• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
• Exhaustive search for snake-in-the-box codes
• Quaternary complex Hadamard matrices of order 18
• Enumeration of Steiner triple systems with subsystems
• Graphs isomorphisms under edge-replacements and the family of amoebas
• On the classification of skew Hadamard matrices of order 36 and related structures
• There are 3155 nonisomorphic perfect one‐factorizations of K₁₆
• Optimal binary LCD codes
• Constructing random Steiner triple systems: an experimental study
• Constructing error-correcting binary codes using transitive permutation groups
• Preface
• Sparse Steiner triple systems of order 21
• Nonexistence Certificates for Ovals in a Projective Plane of Order Ten
• On the classification of quaternary optimal Hermitian LCD codes
• The maximum number of columns in E(s2) $\,E({s}^{2})$‐optimal supersaturated designs with 16 rows and smax=4 ${s}_{{\rm{\max }}}=4$ is 60
• Partitionable sets, almost partitionable sets, and their applications
• Switching for small strongly regular graphs
• The program \textsc{Generation} in the software package \textsc{QextNewEdition}
• On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
• Orderly generation of Butson Hadamard matrices
• The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes
• New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
• Computer classification of linear codes based on lattice point enumeration
• Software for proper vertex-colouring exploiting graph symmetry
• [[Publication:6643242|Equitable \([[2, 10], [6, 6]]\)-partitions of the 12-cube]]
• New Steiner 2-designs from old ones by paramodifications
• Comments on 3-blocked designs
• Constructions of maximum few-distance sets in Euclidean spaces
• Constructing a canonical form of a matrix in several problems about combinatorial designs
• Construction of self-orthogonal codes from combinatorial designs
• Enumeration of Seidel matrices
• There is no McLaughlin geometry
• On unbalanced Boolean functions with best correlation immunity
• Classification of cyclic Steiner quadruple systems
• The Mendelsohn triple systems of order 13
• Enumerating cube tilings
• There is no \([21,5,14]\) code over \(\mathbb F_5\)
• On the number of frequency hypercubes \(F^n(4;2,2) \)
• A full classification of the complete \(k\)-arcs of \(\mathrm{PG}(2,23)\) and \(\mathrm{PG}(2,25)\).
• On automorphism groups of a biplane \((121,16,2)\)
• The unimodality of pure \(O\)-sequences of type two in four variables
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• Switching codes and designs
• The cycle switching graph of the Steiner triple systems of order 19 is connected
• New parallelisms of \(\operatorname{PG}(3,5)\) with automorphisms of order 8
• Enumerating Steiner triple systems
• Binary Covering Arrays and Existentially Closed Graphs
• On triple systems and strongly regular graphs
• One-factorisations of complete graphs arising from ovals in finite planes
• On triangular matroids induced by \(n_3\)-configurations
• The number of Latin squares of order 11
• Indivisible partitions of Latin squares
• On independent star sets in finite graphs
• Unital designs with blocking sets
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• New lower bounds for the Shannon capacity of odd cycles
• On the classification of linear complementary dual codes
• The Kramer-Mesner method with tactical decompositions: some new unitals on 65 points
• The Steiner quadruple systems of order 16
• Designs, groups and computing
• Covering arrays via set covers
• Integer programming for classifying orthogonal arrays
• Isomorphism and invariants of parallelisms of projective spaces
• Mappings of Butson-type Hadamard matrices
• Edge local complementation and equivalence of binary linear codes
• There are exactly five biplanes with k = 11
• Title not available (Why is that?)
• On the shape of a pure \(O\)-sequence
• The semigroup of combinatorial configurations
• Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
• New quasi-symmetric designs by the Kramer-Mesner method
• 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
• Counting Hamiltonian cycles in bipartite graphs
• New regular parallelisms of \(\mathrm{PG}(3,5)\)
• Problems and algorithms for covering arrays via set covers
• The unimodality of pure \(O\)-sequences of type three in three variables

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)