On Multifold Packings of Radius-1 Balls in Hamming Graphs

@article{Krotov2021OnMP,
  title={On Multifold Packings of Radius-1 Balls in Hamming Graphs},
  author={Denis S. Krotov and Vladimir N. Potapov},
  journal={IEEE Transactions on Information Theory},
  year={2021},
  volume={67},
  pages={3585-3598}
}
  • D. Krotov, V. Potapov
  • Published 31 January 2019
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
A <inline-formula> <tex-math notation="LaTeX">$\lambda $ </tex-math></inline-formula>-fold <inline-formula> <tex-math notation="LaTeX">${r}$ </tex-math></inline-formula>-packing (multiple radius-<inline-formula> <tex-math notation="LaTeX">${r}$ </tex-math></inline-formula> covering) in a Hamming metric space is a code <inline-formula> <tex-math notation="LaTeX">${C}$ </tex-math></inline-formula> such that the radius-<inline-formula> <tex-math notation="LaTeX">${r}$ </tex-math></inline-formula… Expand

Figures and Tables from this paper

On q-ary shortened-1-perfect-like codes
  • Minjia Shi, Rongsheng Wu, D. Krotov
  • Computer Science, Mathematics
  • ArXiv
  • 2021
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. Expand
Perfect 2‐colorings of Hamming graphs
We consider the problem of existence of perfect 2-colorings (equitable 2-partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that areExpand

References

SHOWING 1-10 OF 59 REFERENCES
List-Decodable Zero-Rate Codes
TLDR
Several results are proved on the rate of convergence of the maximal list decoding in the zero-rate regime for the binary alphabet and the spherical codes in Euclidean space. Expand
Bounds for binary multiple covering codes
TLDR
K(n, r, μ), the minimum cardinality of a binary code of lengthn such that the Hamming spheres of radiusr centered at the codewords cover at least μ times is discussed. Expand
New lower bounds for multiple coverings
TLDR
In this paper integer programming and exhaustive search are used to improve 57 lower bounds on K(n, R, μ) for 6 ≤ n ≤ 16, 1 ≤ R ≤ 4 and 2 ≤ μ ≤ 4. Expand
On two-fold packings of radius-1 balls in Hamming graphs
  • D. Krotov, V. Potapov
  • Mathematics, Computer Science
  • 2019 IEEE International Symposium on Information Theory (ISIT)
  • 2019
TLDR
This work proposes asymptotic bounds for q-ary 2- fold 1-packings as q grows, finds that the maximum size of a binary 2-fold 1-packing of length 9 is 96, and derives upper bounds for the size ofa binary λ-fold1 -packing. Expand
On An Extremal Hypergraph Problem Of Brown, Erdős And Sós
TLDR
This work partially resolve a problem raised by Brown, Erdős and Sós in 1973, by showing that for any fixed 2≤k<r, n - o ( 1,3) = o ( n k) in an r-uniform hypergraph on n vertices. Expand
On some extremal problems on r-graphs
  • P. Erdös
  • Computer Science, Mathematics
  • Discret. Math.
  • 1971
TLDR
It is proved that to every e > 0 and integer t there is an n"0 = n" 0(t,@e) so that every G(^r)(n;[(c"r","l+@e)(nR)]) has lt vertices x"t(^j), l= l. Expand
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. Expand
A generalized concatenation construction for q-ary 1-perfect codes
TLDR
A generalized concatenation construction forq-ary 1-perfect codes is presented that allows for the construction of perfect 1-error correcting codes over a finite field withq elements and can be regarded as the well-known Phelps construction. Expand
On weight distributions of perfect colorings and completely regular codes
  • D. Krotov
  • Mathematics, Computer Science
  • Des. Codes Cryptogr.
  • 2011
TLDR
The weight distribution of a perfect coloring (equitable partition) of a graph with respect to a completely regular set and a very simple formula for the weight enumerator of an arbitrary perfect coloring is proved. Expand
Upper Bound on List-Decoding Radius of Binary Codes
  • Yury Polyanskiy
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 2016
TLDR
An asymptotic upper bound on the rate of any such packing of Hamming balls of a given relative radius is proved and improves the best known bound for rates below a certain threshold. Expand
...
1
2
3
4
5
...