Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes

@article{stergrd2011TwoOO,
  title={Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes},
  author={Patric R. J. {\"O}sterg{\aa}rd and Olli Pottonen},
  journal={Designs, Codes and Cryptography},
  year={2011},
  volume={59},
  pages={281-285}
}
The optimal one-error-correcting codes of length 13 that are doubly shortened perfect codes are classified utilizing the results of [Östergård, P.R.J., Pottonen, O.: The perfect binary one-error-correcting codes of length 15: Part I—Classification. IEEE Trans. Inform. Theory 55, 4657–4660 (2009)]; there are 117821 such (13,512,3) codes. By applying a switching operation to those codes, two more (13,512,3) codes are obtained, which are then not doubly shortened perfect codes. 
The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
TLDR
It turns out that all but two full-rank codes can be obtained through a series of such transformations from the Hamming code, and the results include the fact that 33 of the 80 Steiner triple systems of order 15 occur in such codes.
On Optimal Binary One-Error-Correcting Codes of Lengths 2m-4 and 2m-3
TLDR
It is proved that triply- shortened and doubly-shortened binary Hamming codes (which have length $2^m-4$ and $2*m-3$ respectively) are optimal and there are optimal binary one-error-correcting codes of length $m \geq 4$ that cannot be lengthened to perfect codes of lengths up to 15.
On q-ary shortened-1-perfect-like codes
TLDR
The punctured Hamming code is an optimal $q$-fold packing with minimum distance $2$ and the existence of $4$-ary codes with parameters of shortened $1-perfect codes that cannot be obtained by shortening a $1$-perfect code is shown.
On the binary codes with parameters of triply-shortened 1-perfect codes
  • D. Krotov
  • Computer Science
    Des. Codes Cryptogr.
  • 2012
TLDR
It is proved, in terms of distance distributions, a general criterion for a partition of the vertices of a graph (from rather general class of graphs, including the distance-regular graphs) to be equitable.
On Optimal Binary One-Error-Correcting Codes of Lengths <formula formulatype="inline"><tex Notation="TeX">$2^{m}-4$</tex> </formula> and <formula formulatype="inline"><tex Notation="TeX">$2^{m}-3$</tex> </formula>
TLDR
It is proved that for any m ≥ 4, there are optimal binary one-error-correcting codes of length 2m-4 and 2m -3 that cannot be lengthened to perfect codes oflength 2 m-1.
On the OA(1536, 13, 2, 7) and related orthogonal arrays
  • D. Krotov
  • Mathematics, Computer Science
    Discret. Math.
  • 2020
Switching codes and designs
On Multifold Packings of Radius-1 Balls in Hamming Graphs
TLDR
Asymptotic bounds for the maximum size of a multifold 2-fold 1-packing are proposed and some properties of 1-perfect unitrades are proved, which are a special case of 2- fold 1-packings.

References

SHOWING 1-10 OF 15 REFERENCES
The Perfect Binary One-Error-Correcting Codes of Length $15$: Part I—Classification
TLDR
A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented, using the recent classification of Steiner quadruple systems of order 16.
The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
TLDR
It turns out that all but two full-rank codes can be obtained through a series of such transformations from the Hamming code, and the results include the fact that 33 of the 80 Steiner triple systems of order 15 occur in such codes.
Perfect binary codes: constructions, properties, and enumeration
TLDR
An upper bound on the cardinality of the intersection of two perfect codes of length n is presented, and perfect codes whose intersection attains the upper bound are constructed for all n.
Every Binary (2m-2, 22m-2-m, 3) Code Can Be Lengthened to Form a Perfect Code of Length 2m-1
TLDR
This paper shows that a binary code of length N=2(m)-2 with 2(N-m) codewords and minimum distance three can always be lengthened to form a perfect code oflength 2(m-1).
Structure of i-components of perfect binary codes
On perfect codes and tilings: problems and solutions
  • T. Etzion, A. Vardy
  • Computer Science
    Proceedings of IEEE International Symposium on Information Theory
  • 1997
TLDR
The generalized Hamming weight hierarchy of most perfect codes is determined, which shows that the smallest nonempty intersection of two perfect codes of length 2/sup m/-1 consists of two codewords, for all m/spl ges/3.
The triply shortened binary Hamming code is optimal
Kernels of nonlinear Hamming codes
TLDR
The main idea of this paper is to show the necessary and sufficient conditions for the existence of kernels of all possible sizes for nonlinear perfect binary codes.
Embedding in a perfect code
A binary 1 ‐error‐correcting code can always be embedded in a 1 ‐perfect code of some larger length. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 419–423, 2009
Introduction to Graph Theory
1. Fundamental Concepts. What Is a Graph? Paths, Cycles, and Trails. Vertex Degrees and Counting. Directed Graphs. 2. Trees and Distance. Basic Properties. Spanning Trees and Enumeration.
...
...