Switching codes and designs (Q658111): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2011.05.016 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.05.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2161224948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2908697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bi-embeddability of certain Steiner triple systems of order 15 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unitals and codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3155148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The construction of translation planes from projective spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random strongly regular graphs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cycle structure of two rows in a random Latin square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deciding switching equivalence of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4313195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monogamous latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Symmetric Designs (25,9,3) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets of three pairwise orthogonal Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect binary codes: constructions, properties, and enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5842949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of Graphs with Multiple Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of hill‐climbing to construct orthogonal steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing cospectral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some rigid Steiner 5-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twin Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4937802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a characterization of bipartite switching classes by means of forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hill‐climbing to Pasch valleys / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of perfect codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadamard matrices and their applications: progress 2007--2010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating uniformly distributed random latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: On symmetric and quasi-symmetric designs with the symmetric difference property and their codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner triple systems of order 19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There exist non‐isomorphic STS(19) with equivalent point codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification algorithms for codes and designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner quadruple systems of order 16 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On trades: An update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4805428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Binary One-Error-Correcting Codes of Lengths $2^{m}-4$ and $2^{m}-3$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of perfect \(q\)-ary codes by switchings of simple components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumeration of the perfect binary codes of length 15 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumeration of nonequivalent perfect binary codes of length 15 and rank 15 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overlarge sets and partial geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of transversals in a Latin square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4026151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On orthogonal double covers of k<sub>n</sub> and a conjecture of chung and west / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE 7 × 7 SQUARES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the enumeration of some D-optimal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching Operations for Hadamard Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of Binary Constant Weight Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal binary one-error-correcting codes of length 10 have 72 codewords / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of optimal binary codes of length 9 and covering radius 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Perfect Binary One-Error-Correcting Codes of Length &lt;formula formulatype="inline"&gt;&lt;tex Notation="TeX"&gt;$15$&lt;/tex&gt;&lt;/formula&gt;: Part I—Classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5736488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching equivalence classes of perfect codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank and Kernel of Binary Hadamard Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Matrices of Zeros and Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4048928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonisomorphic Solutions of pseudo‐(3.5,2) and pseudo‐(3,6,3) graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of \(i\)-components of perfect binary codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfect binary codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bath-generated work extraction and inversion-free gain in two-level systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3718724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On components of preparata codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5513521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle switches in Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New binary covering codes obtained by simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine Klasse spezieller gemischter Ovale in STS(v). (On a class of special mixed ovals in STS(v)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifications of the ``central-method'' to construct Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On one transformation of Steiner quadruple systems \(S(\upsilon , 4, 3)\) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2011.05.016 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:04, 10 December 2024

scientific article
Language Label Description Also known as
English
Switching codes and designs
scientific article

    Statements

    Switching codes and designs (English)
    0 references
    11 January 2012
    0 references
    This paper describes the concept of ``switch'' in the study of combinatorial structures including codes, designs, and related structures. Switching is a certain local transformation that does not alter the basic parameters of a combinatorial structure. For example, a switch of a binary code is a transformation that concerns exactly one coordinate and keeps the studied parameter of the code (for instance, minimum distance) unchanged. This paper gives a precise definition for a switch for codes, designs, and related structures. Then it unifies earlier results including a new result for covering codes, and applies switching exhaustively to some common structures with small parameters.
    0 references
    0 references
    combinatorial design
    0 references
    covering code
    0 references
    error-correctng code
    0 references
    switching
    0 references
    trade
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers