Switching codes and designs
From MaRDI portal
Publication:658111
DOI10.1016/j.disc.2011.05.016zbMath1243.94040OpenAlexW2161224948MaRDI QIDQ658111
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.016
Related Items (14)
Switching 3-edge-colorings of cubic graphs ⋮ Switching for 2-designs ⋮ The minimum volume of subspace trades ⋮ Enumerating cube tilings ⋮ Switching in one-factorisations of complete graphs ⋮ On the cardinality spectrum and the number of Latin bitrades of order 3 ⋮ To the theory of \(q\)-ary Steiner and other-type trades ⋮ On triple systems and strongly regular graphs ⋮ New Steiner 2-designs from old ones by paramodifications ⋮ On the maximum length of coil-in-the-box codes in dimension 8 ⋮ Minimum supports of functions on the Hamming graphs with spectral constraints ⋮ Switching of covering codes ⋮ On existence of perfect bitrades in Hamming graphs ⋮ The extended 1-perfect trades in small hypercubes
Cites Work
- Constructing cospectral graphs
- Hadamard matrices and their applications: progress 2007--2010
- Cycle switches in Latin squares
- Classification algorithms for codes and designs
- The number of transversals in a Latin square
- The Steiner quadruple systems of order 16
- Eine Klasse spezieller gemischter Ovale in STS(v). (On a class of special mixed ovals in STS(v))
- On deciding switching equivalence of graphs
- Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
- On symmetric and quasi-symmetric designs with the symmetric difference property and their codes
- Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components
- Switching equivalence classes of perfect codes
- On trades: An update
- Twin Steiner triple systems
- Overlarge sets and partial geometries
- Unitals and codes
- On the bi-embeddability of certain Steiner triple systems of order 15
- Sets of three pairwise orthogonal Steiner triple systems
- Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices
- On one transformation of Steiner quadruple systems \(S(\upsilon , 4, 3)\)
- Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components
- On components of preparata codes
- Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
- Monogamous latin squares
- On the enumeration of some D-optimal designs
- Construction of perfect \(q\)-ary codes by switchings of simple components
- The construction of translation planes from projective spaces
- Modifications of the ``central-method to construct Steiner triple systems
- A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares
- Some rigid Steiner 5-designs
- On enumeration of nonequivalent perfect binary codes of length 15 and rank 15
- On enumeration of the perfect binary codes of length 15
- Combinatorial Properties of Matrices of Zeros and Ones
- Towards a characterization of bipartite switching classes by means of forbidden subgraphs
- Rank and Kernel of Binary Hadamard Codes
- The cycle structure of two rows in a random Latin square
- Switching Operations for Hadamard Matrices
- Enumeration of Symmetric Designs (25,9,3)
- Generating uniformly distributed random latin squares
- On orthogonal double covers of kn and a conjecture of chung and west
- Bath-generated work extraction and inversion-free gain in two-level systems
- On the size of optimal binary codes of length 9 and covering radius 1
- There exist non‐isomorphic STS(19) with equivalent point codes
- Optimal binary one-error-correcting codes of length 10 have 72 codewords
- The use of hill‐climbing to construct orthogonal steiner triple systems
- The Steiner triple systems of order 19
- Perfect binary codes: constructions, properties, and enumeration
- New binary covering codes obtained by simulated annealing
- The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
- On Optimal Binary One-Error-Correcting Codes of Lengths $2^{m}-4$ and $2^{m}-3$
- Classification of Binary Constant Weight Codes
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
- Some Properties of Graphs with Multiple Edges
- Hill‐climbing to Pasch valleys
- Nonisomorphic Solutions of pseudo‐(3.5,2) and pseudo‐(3,6,3) graphs
- THE 7 × 7 SQUARES
- A survey of perfect codes
- On perfect binary codes
- Random strongly regular graphs?
- Structure of \(i\)-components of perfect binary codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Switching codes and designs
