The extended 1-perfect trades in small hypercubes

DOI10.1016/J.DISC.2017.06.016MaRDI QIDQ2012553zbMATH OpenOpenAlexFDO

Authors Denis S. Krotov

Publication date 1 August 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.03421

zbMATH Keywords

trades1-perfect codebitradessmall Witt designSteiner trades

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial codes (94B25) Triple systems (05B07)

Abstract: An extended $1$-perfect trade is a pair $(T_0,T_1)$ of two disjoint binary distance-$4$ even-weight codes such that the set of words at distance $1$ from $T_0$ coincides with the set of words at distance $1$ from $T_1$. Such trade is called primary if any pair of proper subsets of $T_0$ and $T_1$ is not a trade. Using a computer-aided approach, we classify nonequivalent primary extended $1$-perfect trades of length $10$, constant-weight extended $1$-perfect trades of length $12$, and Steiner trades derived from them. In particular, all Steiner trades with parameters $(5,6,12)$ are classified.

Recommendations

• On existence of perfect bitrades in Hamming graphs
• Ternary trades and their codes
• scientific article; zbMATH DE number 2192199
• To the theory of \(q\)-ary Steiner and other-type trades
• On classification of 2-(8, 3) and 2-(9, 3) trades

Cites work

• scientific article; zbMATH DE number 3926802 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3555872 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 2104717 (Why is no real title available?)
• scientific article; zbMATH DE number 874547 (Why is no real title available?)
• scientific article; zbMATH DE number 1420999 (Why is no real title available?)
• A General Product Construction for Error Correcting Codes
• A survey of methods for constructing nonlinear perfect binary codes
• A survey of perfect codes
• Binary codes with a minimum distance of four (Corresp.)
• Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
• Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes
• Classification algorithms for codes and designs
• Embedding in a perfect code
• Intersections among Steiner systems
• Multidimensional Latin bitrades
• On mobile sets in the binary hypercube
• On the binary codes with parameters of doubly-shortened 1-perfect codes
• On the binary codes with parameters of triply-shortened 1-perfect codes
• On the structure of non-full-rank perfect \(q\)-ary codes
• Practical graph isomorphism. II.
• Structure of \(i\)-components of perfect binary codes
• Switching codes and designs
• Tactical Configurations of Rank Two
• The classification of some perfect codes
• The theory and application of latin bitrades: A survey
• The uniqueness of the Best code
• There exist Steiner triple systems of order 15 that do not occur in a perfect binary one‐error‐correcting code
• To the theory of \(q\)-ary Steiner and other-type trades

Cited in

(7)

• Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
• Minimum supports of functions on the Hamming graphs with spectral constraints
• On existence of perfect bitrades in Hamming graphs
• \(PI\)-eigenfunctions of the Star graphs
• On extended 1-perfect bitrades
• Minimum supports of eigenfunctions of graphs: a survey
• On degree-3 and \((n - 4)\)-correlation-immune perfect colorings of \(n\)-cubes

Describes a project that uses

Uses Software

• nauty
• SageMath
• Traces

This page was built for publication: The extended 1-perfect trades in small hypercubes

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